| Grigore Roșu | |
| Birth Date: | 12 December 1971 |
| Nationality: | Romanian-American |
| Fields: | Computer Science |
| Workplaces: | University 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 |
| Alma Mater: | University of Bucharest University of California, San Diego |
| Thesis Title: | Hidden Logic (2000) |
| Doctoral Advisor: | Joseph Goguen |
| Known For: | Runtime verification K language framework matching logic circular coinduction |
| Spouses: | )--> |
| Partners: | )--> |
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] and automated coinduction.[4]
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.
Roșu coined the term "runtime verification" together with Havelund[13] as the name of a workshop[14] 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,[15] efficient monitor synthesis,[16] runtime predictive analysis,[17] and monitoring-oriented programming.[18] Roșu also founded Runtime Verification, Inc.,a company aimed at commercializing runtime verification technology.[19]
Roșu created and led the design and development of the K framework, 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,[20] Java,[21] JavaScript,[22] Python,[23] and Ethereum Virtual Machine[24] are defined using the K framework.
Roșu introduced matching logicas 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,[25] typed or untyped lambda-calculi, dependent type systems, separation logic with recursive predicates, rewriting logic,[26] [27] Hoare logic, temporal logics, dynamic logic, and the modal μ-calculus.
Roșu's Ph.D. thesis[28] proposed circular coinduction[29] 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 implementedin Coq,[30] Isabelle/HOL,[31] Dafny,[32] and as part of the CIRC theorem prover.[33]