2011 - Fellow of the American Academy of Arts and Sciences
2007 - A. M. Turing Award Together with E. Allen Emerson and Joseph Sifakis, for their role in developing Model-Checking into a highly effective verification technology that is widely adopted in the hardware and software industries.
2005 - Member of the National Academy of Engineering For contributions to the formal verification of hardware and software correctness.
1998 - ACM Fellow Edmund M. Clarke is the co-inventor of Model Checking (with his former student Allen Emerson). He and his graduate students helped make Model Checking a tool that can be used to verify finite-state concurrent systems of industrial complexity.
1998 - ACM Paris Kanellakis Theory and Practice Award Symbolic Model Checking
Edmund M. Clarke mainly focuses on Model checking, Theoretical computer science, Temporal logic, Programming language and Abstraction model checking. His Model checking study integrates concerns from other disciplines, such as State space and Binary decision diagram. His Theoretical computer science research incorporates elements of Finite-state machine, Bounded function and Counterexample.
His studies in Temporal logic integrate themes in fields like Linear temporal logic, Construct, Skeleton and Synchronization. In most of his Programming language studies, his work intersects topics such as Boolean satisfiability problem. His Abstraction model checking research integrates issues from Abstract interpretation, CPAchecker, Kripke structure and Computation.
His primary areas of study are Model checking, Theoretical computer science, Programming language, Algorithm and Temporal logic. His Model checking research is multidisciplinary, incorporating perspectives in Formal verification, State space and Counterexample. He interconnects Formal specification and High-level verification in the investigation of issues within Formal verification.
His Theoretical computer science study incorporates themes from Bounded function, State and Boolean function. His Algorithm course of study focuses on Hybrid system and Mathematical optimization. His Temporal logic research is multidisciplinary, relying on both Linear temporal logic, Sequential logic and Finite-state machine.
The scientist’s investigation covers issues in Hybrid system, Model checking, Reachability, Programming language and Theoretical computer science. His biological study spans a wide range of topics, including Control system, Bounded function, Mathematical optimization, Nonlinear system and Formal verification. His Model checking research includes elements of Cancer, Logical data model and Temporal logic.
His Reachability study which covers Probabilistic logic that intersects with Optimization problem. His study in the fields of Software verification, Software, Interface and Concurrency under the domain of Programming language overlaps with other disciplines such as Preemption. The Theoretical computer science study combines topics in areas such as Execution model, Formal methods and Symbolic execution.
The scientist’s investigation covers issues in Hybrid system, Nonlinear system, Reachability, Theoretical computer science and Algorithm. His Hybrid system research is multidisciplinary, incorporating elements of Formal verification, Numerical analysis, Modulo and Ordinary differential equation. His research in Nonlinear system intersects with topics in Bounded function and Mathematical optimization.
Edmund M. Clarke has included themes like Abstract interpretation, Programming language and Software in his Reachability study. The concepts of his Theoretical computer science study are interwoven with issues in Solver and Counterexample. His research integrates issues of Fault tolerance and Bayesian probability, Bayes' theorem in his study of Algorithm.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Edmund M. Clarke;Bernd-Holger Schlingloff.
E. Clarke;O. Grumberg;D. Long.
Proceedings of the NATO Advanced Study Institute on Deductive program design (1996)
Symbolic Model Checking
Edmund M. Clarke;Kenneth L. McMillan;Sérgio Vale Aguiar Campos;Vassili Hartonas-Garmhausen.
Automatic verification of finite-state concurrent systems using temporal logic specifications
E. M. Clarke;E. A. Emerson;A. P. Sistla.
ACM Transactions on Programming Languages and Systems (1986)
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Edmund M. Clarke;E. Allen Emerson.
Logic of Programs, Workshop (1981)
Symbolic model checking: 10/sup 20/ states and beyond
J.R. Burch;E.M. Clarke;K.L. McMillan;D.L. Dill.
logic in computer science (1990)
Symbolic Model Checking without BDDs
Armin Biere;Alessandro Cimatti;Edmund M. Clarke;Yunshan Zhu.
tools and algorithms for construction and analysis of systems (1999)
Model checking and abstraction
Edmund M. Clarke;Orna Grumberg;David E. Long.
ACM Transactions on Programming Languages and Systems (1994)
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
Alessandro Cimatti;Edmund M. Clarke;Enrico Giunchiglia;Fausto Giunchiglia.
computer aided verification (2002)
Counterexample-guided abstraction refinement
international symposium on temporal representation and reasoning (2003)
Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: