Clarke, Edmund
Overview
Works:  7 works in 41 publications in 3 languages and 1,923 library holdings 

Genres:  Conference papers and proceedings 
Roles:  Author, Editor 
Classifications:  QA76.6, 001.642 
Publication Timeline
.
Most widely held works by
Edmund Clarke
Logics of Programs, workshop, Carnegie Mellon University, Pittsburgh, PA, June 68, 1983 by
Edmund Clarke(
Book
)
18 editions published between 1984 and 2007 in 3 languages and held by 309 WorldCat member libraries worldwide
None Available
18 editions published between 1984 and 2007 in 3 languages and held by 309 WorldCat member libraries worldwide
None Available
Verification of infinitestate systems with applications to security by NATO Advanced Research Workshop on Verification of Infinitestate Systems with Applications to Security(
Book
)
9 editions published in 2006 in English and held by 60 WorldCat member libraries worldwide
Provides information for researchers interested in the development of mathematical techniques for the analysis of infinite state systems. The papers come from a successful workshop
9 editions published in 2006 in English and held by 60 WorldCat member libraries worldwide
Provides information for researchers interested in the development of mathematical techniques for the analysis of infinite state systems. The papers come from a successful workshop
Escher a geometrical layout system for recursively defined circuits by
Edmund Clarke(
Book
)
3 editions published in 1985 in English and held by 9 WorldCat member libraries worldwide
3 editions published in 1985 in English and held by 9 WorldCat member libraries worldwide
Efficient generation of counterexamples and witnesses in symbolic model checking by
Edmund Clarke(
Book
)
3 editions published in 1994 in English and held by 6 WorldCat member libraries worldwide
Abstract: "Model checking is an automatic technique for verifying sequential circuit designs and protocols. An efficient search procedure is used to determine whether or not the specification is satisfied. If it is not satisfied, our technique will produce a counterexample execution trace that shows the cause of the problem. Although finding counterexamples is extremely important, there is no description of how to do this in the literature on model checking. We describe an efficient algorithm to produce counterexamples and witnesses for symbolic model checking algorithms. This algorithm is used in the SMV model checker and works quite well in practice. We also discuss how to extend our technique to more complicated specifications. This extension makes it possible to find counterexamples for verification procedures based on showing language containment between various types of [omega]automata."
3 editions published in 1994 in English and held by 6 WorldCat member libraries worldwide
Abstract: "Model checking is an automatic technique for verifying sequential circuit designs and protocols. An efficient search procedure is used to determine whether or not the specification is satisfied. If it is not satisfied, our technique will produce a counterexample execution trace that shows the cause of the problem. Although finding counterexamples is extremely important, there is no description of how to do this in the literature on model checking. We describe an efficient algorithm to produce counterexamples and witnesses for symbolic model checking algorithms. This algorithm is used in the SMV model checker and works quite well in practice. We also discuss how to extend our technique to more complicated specifications. This extension makes it possible to find counterexamples for verification procedures based on showing language containment between various types of [omega]automata."
Another look at LTL model checking by
Edmund Clarke(
Book
)
3 editions published between 1993 and 1994 in English and held by 5 WorldCat member libraries worldwide
Abstract: "We show how LTL model checking can be reduced to CTL model checking with fairness constraints. Using this reduction, we also describe how to construct a symbolic LTL model checker that appears to be quite efficient in practice. In particular, we show how the SMV model checking system developed by McMillan [16] can be extended to permit LTL specifications. The results that we have obtained are quite surprising. For the examples we considered, the LTL model checker required at most twice as much time and space as the CTL model checker. Although additional examples still need to be tried, it appears that efficient LTL model checking is possible when the specifications are not excessively complicated."
3 editions published between 1993 and 1994 in English and held by 5 WorldCat member libraries worldwide
Abstract: "We show how LTL model checking can be reduced to CTL model checking with fairness constraints. Using this reduction, we also describe how to construct a symbolic LTL model checker that appears to be quite efficient in practice. In particular, we show how the SMV model checking system developed by McMillan [16] can be extended to permit LTL specifications. The results that we have obtained are quite surprising. For the examples we considered, the LTL model checker required at most twice as much time and space as the CTL model checker. Although additional examples still need to be tried, it appears that efficient LTL model checking is possible when the specifications are not excessively complicated."
Combining symbolic computation and theorem proving : some problems of Ramanujan by
Edmund Clarke(
Book
)
3 editions published in 1994 in English and held by 5 WorldCat member libraries worldwide
Abstract: "One way of building more powerful theorem provers is to use techniques from symbolic computation. The challenge problems in this paper are taken from Chapter 2 of Ramanujan's Notebooks. They were selected because they are nontrivial and require the use of symbolic computation techniques. We have developed a theorem prover based on the symbolic computation system Mathematica that can prove all the challenge problems completely automatically. The axioms and inference rules for constructing the proofs are also briefly discussed."
3 editions published in 1994 in English and held by 5 WorldCat member libraries worldwide
Abstract: "One way of building more powerful theorem provers is to use techniques from symbolic computation. The challenge problems in this paper are taken from Chapter 2 of Ramanujan's Notebooks. They were selected because they are nontrivial and require the use of symbolic computation techniques. We have developed a theorem prover based on the symbolic computation system Mathematica that can prove all the challenge problems completely automatically. The axioms and inference rules for constructing the proofs are also briefly discussed."
A Summary of research on program derivation by
Edmund Clarke(
Book
)
1 edition published in 1978 in English and held by 1 WorldCat member library worldwide
1 edition published in 1978 in English and held by 1 WorldCat member library worldwide
Audience Level
0 

1  
Kids  General  Special 
Related Identities
Associated Subjects
Automatic theorem proving Computer algorithms Computer programming Computer programsCorrectness Computer programsVerification Computer science Computer security Computer software Computer softwareVerification Fixed point theory Integrated circuitsDesign and construction Logic design Parallel programming (Computer science) System theory System theoryMathematical models