Edmund M. Clarke

Known as: Clarke, E. M. Clarke, Edmund Clarke 
Edmund Melson Clarke, Jr. (born July 27, 1945) is a computer scientist and academic noted for developingmodel checking, a method for formally… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
Turing Lecture from the winners of the 2007 ACM A.M. Turing Award.In 1981, Edmund M. Clarke and E. Allen Emerson, working in the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Review
2003
Review
2003
ion and Counterexample-Guided Refinement in Model Checking of Hybrid Systems Edmund Clarke Ansgar Fehnker Zhi Han Bruce Krogh J… (More)
  • figure 3
  • figure 4
  • figure 5
  • figure 6
  • figure 8
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Counterexamples for specification violations provide engineers with important debugging information. Although counterexamples are… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We introduce a symbolic model checking procedure for Probabilistic Computation Tree Logic PCTL over labelled Markov chains as… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
The temporal logic model checking algorithm of Clarke, Emerson, and Sistla [17] is modified to represent state graphs using… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Many different methods have been devised for automatically verifying finite state systems by examining state-graph models of… (More)
  • figure 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1990
Highly Cited
1990
The temporal logic model checking algorithm developed by Clarke, Emerson, and Sistla [9] is modified to represent a state graph… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
Is this relevant?
Highly Cited
1987
Highly Cited
1987
1. Introduction Many distributed programs can be viewed at some level of abstraction as communicating finite state machines. The… (More)
  • figure 2
  • figure 31
  • figure 4-1
  • figure 5
  • figure 7
Is this relevant?
Highly Cited
1982
Highly Cited
1982
Astract. We present a method of constructing concurrent programs in which the synchronization skeleton of the program is… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 7
  • figure 9
Is this relevant?
Highly Cited
1980
Highly Cited
1980
1.1 Background. Dijkstra [DI76] proposes the use of weakest precondition predicate transformers to describe correctness… (More)
Is this relevant?