Grigore Roșu

Grigore Roșu
Roșu in 2020
Born (1971-12-12) December 12, 1971
NationalityRomanian-American
Alma materUniversity of Bucharest
University of California, San Diego
Known forRuntime verification
K language framework
matching logic
circular coinduction
Scientific career
FieldsComputer Science
InstitutionsUniversity of Illinois at Urbana-Champaign
Runtime Verification, Inc.
Alexandru Ioan Cuza University
Microsoft Research
NASA Ames Research Center
University of California at San Diego
University of Bucharest
Thesis Hidden Logic (2000)
Doctoral advisorJoseph Goguen
Websitefsl.cs.illinois.edu/~grosu

Grigore Roșu (born December 12, 1971) is a computer science professor at the University of Illinois at Urbana-Champaign and a researcher in the Information Trust Institute.[1] He is known for his contributions in Runtime Verification, the K framework,[2] matching logic,[3] automated coinduction.[4], and for founding Runtime Verification, Inc. and Pi Squared, Inc..

Biography

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.

After completing his doctorate, he joined NASA in 2000 as a research scientist at the Ames Research Center, where he focused on formal specification and verification of flight and navigation software, coining the term "runtime verification" to enhance the reliability of mission-critical systems.

In 2002, he joined the department of computer science at the University of Illinois at Urbana–Champaign as an assistant professor, later becoming an associate professor in 2008 and a full professor in 2014.

In 2003, Roșu, alongside his student Traian Serbanuta, developed the K framework, providing an intuitive and modular approach to defining formal semantics for programming languages.

He founded Runtime Verification, Inc. in 2010, translating his research into practical applications by collaborating with industry leaders like Boeing and Toyota in the embedded systems domain.

In late 2023, he founded Pi Squared, Inc. as a spin-off from Runtime Verification, aiming to address challenges in programming language interoperability and computational trust.

Awards

Contributions

Roșu coined the term "Runtime Verification" together with Havelund[15] as the name of a workshop[16] 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,[17] efficient monitor synthesis,[18] runtime predictive analysis,[19] and monitoring-oriented programming.[20]

Roșu created and led the design and development of the K framework,[2] which is an executable semantic framework where programming languages, type systems, and formal analysis tools are defined using configurations, computations, and rewrite rules. Language tools such as interpreters, virtual machines, compilers, symbolic execution and formal verification tools, are automatically or semi-automatically generated by the K framework. Formal semantics of several known programming languages, such as C,[21] Java,[22] JavaScript,[23] Python,[24] and Ethereum Virtual Machine[25] are defined using the K framework.

Roșu introduced matching logic[3] 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,[26] typed or untyped lambda-calculi, dependent type systems, separation logic with recursive predicates, rewriting logic,[27][28] Hoare logic, temporal logics, dynamic logic, and the modal μ-calculus.

Roșu's Ph.D. thesis[29] proposed circular coinduction[30] 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,[31] Isabelle/HOL,[32] Dafny,[33] and as part of the CIRC theorem prover.[34]

References

  1. ^ Grigore Rosu's [1]
  2. ^ a b K framework. https://kframework.org
  3. ^ a b Matching logic. https://matching-logic.org
  4. ^ Automated coinduction. https://fsl.cs.illinois.edu/index.php/Circ
  5. ^ Most influential papers of Automated Software Engineering. https://ase-conferences.org/Mip.html
  6. ^ K. Havelund, G. Rosu. 2001, Monitoring Programs Using Rewriting, Automated Software Engineering (ASE), pp. 135-143.
  7. ^ Havelund, Klaus; Roşu, Grigore (2001-10-01). "Monitoring Java Programs with Java PathExplorer". Electronic Notes in Theoretical Computer Science. RV'2001, Runtime Verification (in connection with CAV '01). 55 (2): 200–217. doi:10.1016/S1571-0661(04)00253-1. hdl:2060/20020051234. ISSN 1571-0661.
  8. ^ "Awards". Runtime Verification. Retrieved 2025-03-24.
  9. ^ ACM SIGSOFT distinguished paper awards. https://sigsoft.org/awards/distinguishedPaperAward.html
  10. ^ European Association for the Study of Science and Technology. https://easst.aulp.co.uk/awards-to-date
  11. ^ NSF Award Search: Award#0448501 - CAREER: Runtime Verification and Monitoring. https://nsf.gov/awardsearch/showAward?AWD_ID=0448501
  12. ^ Grigore Roșu | Premiile Ad Astra. https://premii.ad-astra.ro/?p=314
  13. ^ 2021 IEEE Computer Society Fellows
  14. ^ "2022 AAAS Fellows | American Association for the Advancement of Science (AAAS)". www.aaas.org. Retrieved 2025-03-24.
  15. ^ Klaus Havelund homepage. https://havelund.com/
  16. ^ International Conference of Runtime Verification. https://runtime-verification.org
  17. ^ G. Rosu, F. Chen. 2012, Semantics and Algorithms for Parametric Monitoring Logical Methods in Computer Science (LMCS), vol. 8(1), pp. 1–47.
  18. ^ 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.
  19. ^ F. Chen, T. Serbanuta, G. Rosu. 2008, jPredictor: A Predictive Runtime Analysis Tool for Java International Conference on Software Engineering (ICSE), pp. 221–230.
  20. ^ Monitoring-Oriented Programming. https://fsl.cs.illinois.edu/index.php/Monitoring-Oriented_Programming
  21. ^ C. Hathhorn, C. Ellison, G. Rosu. 2015, Defining the Undefinedness of C In Proceedings of Programming Language Design and Implementation (PLDI), pp. 336-345.
  22. ^ D. Bogdanas, G. Rosu. 2015, K-Java: A Complete Semantics of Java In Proceedings of Principles of Programming Languages (POPL), pp. 445-456.
  23. ^ D. Park, A. Stefanescu, G. Rosu. 2015, KJS: A Complete Formal Semantics of JavaScript In Proceedings of Programming Language Design and Implementation (PLDI), pp. 346-356.
  24. ^ D. Guth. 2013, M.S. thesis, A Formal Semantics of Python 3.3 University of Illinois at Urbana-Champaign.
  25. ^ 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.
  26. ^ Y. Gurevich, S. Shelah. 1985, Fixed-point extensions of first-order logic In Proceedings of Foundations of Computer Science (SFCS), pp. 346-353.
  27. ^ J. Meseguer. 2012, Twenty Years of Rewriting Logic In the Journal of Logic and Algebraic Programming (JLAP), vol. 81(7-8), pp. 721-781.
  28. ^ Rewriting Logics and Systems, https://csl.sri.com/programs/rewriting/
  29. ^ G. Rosu. 2000, Ph.D. thesis Hidden Logic University of California San Diego.
  30. ^ G. Rosu, D. Lucanu. 2009, Circular Coinduction: A Proof Theoretical Foundation In Proceedings of Algebra and Coalgebra in Computer Science (CALCO), pp. 127-144.
  31. ^ J. Endrullis, D. Hendriks, M. Bodin. Circular Coinduction in Coq Using Bisimulation-Up-To Techniques International Conference on Interactive Theorem Proving, pp. 354-369.
  32. ^ 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.
  33. ^ 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.
  34. ^ Formal Systems Laboratory | Circ Prover. https://fsl.cs.illinois.edu/index.php/Circ
This article is issued from Wikipedia. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.