|Born||December 12, 1971|
|Alma mater||University of Bucharest |
University of California, San Diego
|Known for||Runtime verification |
K language framework
|Institutions||University of Illinois at Urbana-Champaign |
Runtime Verification, Inc.
Alexandru Ioan Cuza University
NASA Ames Research Center
University of California at San Diego
University of Bucharest
|Thesis||Hidden Logic (2000)|
|Doctoral advisor||Joseph Goguen|
Grigore Roșu is a computer science professor at the University of Illinois at Urbana-Champaign and a researcher in the Information Trust Institute. He is known for his contributions in runtime verification, the K framework, matching logic, and automated coinduction.
Roșu received a B.A. in Mathematics in 1995 and an M.S. in Fundamentals of Computing in 1996, both from the University of Bucharest, Romania, and a Ph.D. in Computer Science in 2000 from the University of California at San Diego. Between 2000 and 2002 he was a research scientist at NASA Ames Research Center. In 2002, he joined the department of computer science at the University of Illinois at Urbana–Champaign as an assistant professor. He became an associate professor in 2008 and a full professor in 2014.
- IEEE/ACM most influential paper of the International Conference on Automated Software Engineering (ASE) award in 2016 (for an ASE 2001 paper)
- Runtime Verification (RV) test of time award (for an RV 2001 paper)
- ACM distinguished paper awards at ASE 2008, ASE 2016, and OOPSLA 2016
- Best software science paper award at ETAPS 2002
- NSF CAREER award in 2005
- Ad AStra award in 2016
Roșu coined the term "runtime verification" together with Havelund as the name of a workshop started in 2001, aiming at addressing problems at the boundary between formal verification and testing. Roșu and his collaborators introduced algorithms and techniques for parametric property monitoring, efficient monitor synthesis, runtime predictive analysis, and monitoring-oriented programming. Roșu also founded Runtime Verification, Inc., a company aimed at commercializing runtime verification technology.
Roșu introduced matching logic as a foundation for the K framework and for programming languages, specification, and verification. It is as expressive as first-order logic plus mathematical induction, and uses a compact notation to capture, as syntactic sugar, several formal systems of critical importance, such as algebraic specification and initial algebra semantics, first-order logic with least fixed points, typed or untyped lambda-calculi, dependent type systems, separation logic with recursive predicates, rewriting logic, Hoare logic, temporal logics, dynamic logic, and the modal μ-calculus.
Roșu's Ph.D. thesis proposed circular coinduction as an automation of coinduction in the context of hidden logic. This was further generalized into a principle that unifies and automates proofs by both induction and coinduction, and has been implemented in Coq, Isabelle/HOL, Dafny, and as part of the CIRC theorem prover.
- ^ a b Grigore Rosu's curriculum vitae
- ^ a b K framework. https://kframework.org
- ^ a b Matching logic. https://matching-logic.org
- ^ Automated coinduction. https://fsl.cs.illinois.edu/index.php/Circ
- ^ Most influential papers of Automated Software Engineering. https://ase-conferences.org/Mip.html
- ^ K. Havelund, G. Rosu. 2001, Monitoring Programs Using Rewriting, Automated Software Engineering (ASE), pp. 135-143.
- ^ Runtime Verification. https://runtime-verification.org/
- ^ K. Havelund, G. Rosu. 2001, Monitoring Java Programs with Java PathExplorer, Electronic Notes in Theoretical Computer Science vol. 55(2), pp. 200-217.
- ^ ACM SIGSOFT distinguished paper awards. https://sigsoft.org/awards/distinguishedPaperAward.html
- ^ European Association for the Study of Science and Technology. https://easst.aulp.co.uk/awards-to-date
- ^ NSF Award Search: Award#0448501 - CAREER: Runtime Verification and Monitoring. https://nsf.gov/awardsearch/showAward?AWD_ID=0448501
- ^ Grigore Roșu | Premiile Ad Astra. https://premii.ad-astra.ro/?p=314
- ^ Klaus Havelund homepage. https://havelund.com/
- ^ International Conference of Runtime Verification. https://runtime-verification.org
- ^ G. Rosu, F. Chen. 2012, Semantics and Algorithms for Parametric Monitoring Logical Methods in Computer Science (LMCS), vol. 8(1), pp. 1–47.
- ^ P. Meredith, D. Jin, F. Chen, G. Rosu. 2010, Efficient Monitoring of Parametric Context-Free Patterns Journal of Automated Software Engineering, vol. 17(2), pp. 149-180.
- ^ F. Chen, T. Serbanuta, G. Rosu. 2008, jPredictor: A Predictive Runtime Analysis Tool for Java International Conference on Software Engineering (ICSE), pp. 221–230.
- ^ Monitoring-Oriented Programming. https://fsl.cs.illinois.edu/index.php/Monitoring-Oriented_Programming
- ^ Runtimve Verification Inc.
- ^ C. Hathhorn, C. Ellison, G. Rosu. 2015, Defining the Undefinedness of C In Proceedings of Programming Language Design and Implementation (PLDI), pp. 336-345.
- ^ D. Bogdanas, G. Rosu. 2015, K-Java: A Complete Semantics of Java In Proceedings of Principles of Programming Languages (POPL), pp. 445-456.
- ^ D. Guth. 2013, M.S. thesis, A Formal Semantics of Python 3.3 University of Illinois at Urbana-Champaign.
- ^ E. Hildenbrandt, M. Saxena, X. Zhu, N. Rodrigues, P. Daian, D. Guth, B. Moore, Y. Zhang, D. Park, A. Stefanescu, G. Rosu. 2018, KEVM: A Complete Semantics of the Ethereum Virtual Machine In Proceedings of Computer Security Foundations (CSF), pp. 204-217.
- ^ Y. Gurevich, S. Shelah. 1985, Fixed-point extensions of first-order logic In Proceedings of Foundations of Computer Science (SFCS), pp. 346-353.
- ^ J. Meseguer. 2012, Twenty Years of Rewriting Logic In the Journal of Logic and Algebraic Programming (JLAP), vol. 81(7-8), pp. 721-781.
- ^ Rewriting Logics and Systems, https://csl.sri.com/programs/rewriting/
- ^ G. Rosu. 2000, Ph.D. thesis Hidden Logic University of California San Diego.
- ^ G. Rosu, D. Lucanu. 2009, Circular Coinduction: A Proof Theoretical Foundation In Proceedings of Algebra and Coalgebra in Computer Science (CALCO), pp. 127-144.
- ^ J. Endrullis, D. Hendriks, M. Bodin. Circular Coinduction in Coq Using Bisimulation-Up-To Techniques International Conference on Interactive Theorem Proving, pp. 354-369.
- ^ D. Hausmann, T. Mossakowski, L. Schroder. Iterative Circular Coinduction for CoCasl in Isabelle/HOL International Conference on Fundamental Approaches to Software Engineering, pp. 341-356.
- ^ K. Rustan M. Leino, M. Moskal. Co-induction Simply - Automatic Co-inductive Proofs in a Program Verifier International Symposium on Formal Methods, pp. 382-398.
- ^ Formal Systems Laboratory | Circ Prover. https://fsl.cs.illinois.edu/index.php/Circ