Clarke, E. M. 1945
Overview
Works:  71 works in 236 publications in 3 languages and 3,724 library holdings 

Genres:  Conference papers and proceedings 
Roles:  Author, Editor 
Publication Timeline
.
Most widely held works by
E. M Clarke
Model checking by
E. M Clarke(
Book
)
22 editions published between 1999 and 2008 in English and Undetermined and held by 462 WorldCat member libraries worldwide
This presentation of the theory and practice of model checking includes basic as well as stateoftheart techniques, algorithms and tools, and can be used as an introduction to the subject or a reference for researchers
22 editions published between 1999 and 2008 in English and Undetermined and held by 462 WorldCat member libraries worldwide
This presentation of the theory and practice of model checking includes basic as well as stateoftheart techniques, algorithms and tools, and can be used as an introduction to the subject or a reference for researchers
Computeraided verification : proceedings by
E. M Clarke(
Book
)
27 editions published between 1990 and 1991 in 4 languages and held by 312 WorldCat member libraries worldwide
"This volume contains the proceedings of the second workshop on Computer Aided Verification, held at DIMACS, Rutgers University, June 1821, 1990. Itfeatures theoretical results that lead to new or more powerful verification methods. Among these are advances in the use of binary decision diagrams, dense time, reductions based upon partial order representations and proofchecking in controller verification. The motivation for holding a workshop on computer aided verification was to bring together work on effective algorithms or methodologies for formal verification  as distinguished, say, from attributes of logics or formal languages. The considerable interest generated by the first workshop, held in Grenoble, June 1989 (see LNCS 407), prompted this second meeting. The general focus of this volume is on the problem of making formal verification feasible for various models of computation. Specific emphasis is on models associated with distributed programs, protocols, and digital circuits. The general test of algorithm feasibility is to embed it into a verification tool, and exercise that tool on realistic examples: the workshop included sessionsfor the demonstration of new verification tools."PUBLISHER'S WEBSITE
27 editions published between 1990 and 1991 in 4 languages and held by 312 WorldCat member libraries worldwide
"This volume contains the proceedings of the second workshop on Computer Aided Verification, held at DIMACS, Rutgers University, June 1821, 1990. Itfeatures theoretical results that lead to new or more powerful verification methods. Among these are advances in the use of binary decision diagrams, dense time, reductions based upon partial order representations and proofchecking in controller verification. The motivation for holding a workshop on computer aided verification was to bring together work on effective algorithms or methodologies for formal verification  as distinguished, say, from attributes of logics or formal languages. The considerable interest generated by the first workshop, held in Grenoble, June 1989 (see LNCS 407), prompted this second meeting. The general focus of this volume is on the problem of making formal verification feasible for various models of computation. Specific emphasis is on models associated with distributed programs, protocols, and digital circuits. The general test of algorithm feasibility is to embed it into a verification tool, and exercise that tool on realistic examples: the workshop included sessionsfor the demonstration of new verification tools."PUBLISHER'S WEBSITE
Logics of Programs, workshop, Carnegie Mellon University, Pittsburgh, PA, June 68, 1983 by
E. M Clarke(
Book
)
18 editions published between 1984 and 2007 in 3 languages and held by 308 WorldCat member libraries worldwide
None Available
18 editions published between 1984 and 2007 in 3 languages and held by 308 WorldCat member libraries worldwide
None Available
Computeraided verification '90 : proceedings of a DIMACS workshop, June 1821, 1990 by
R. P Kurshan(
Book
)
10 editions published in 1991 in English and Undetermined and held by 97 WorldCat member libraries worldwide
This volume, published jointly with the Association for Computing Machinery, contains the proceedings of the second workshop on ComputerAided Verification, held at DIMACS at Rutgers University in June 1990. The motivation for the workshop was to bring together researchers working on effective algorithms or methodologies for formal verification (as distinguished from, for example, attributes of logics or formal languages). The theoretical results leading to new or more powerful verification methods include advances in the use of binary decision diagrams, dense time, reductions based on partial
10 editions published in 1991 in English and Undetermined and held by 97 WorldCat member libraries worldwide
This volume, published jointly with the Association for Computing Machinery, contains the proceedings of the second workshop on ComputerAided Verification, held at DIMACS at Rutgers University in June 1990. The motivation for the workshop was to bring together researchers working on effective algorithms or methodologies for formal verification (as distinguished from, for example, attributes of logics or formal languages). The theoretical results leading to new or more powerful verification methods include advances in the use of binary decision diagrams, dense time, reductions based on partial
Logic for Programming, Artificial Intelligence, and Reasoning 16th International Conference, LPAR16, Dakar, Senegal, April
25May 1, 2010, Revised Selected Papers by
E. M Clarke(
)
16 editions published between 2010 and 2011 in English and held by 56 WorldCat member libraries worldwide
Annotation
16 editions published between 2010 and 2011 in English and held by 56 WorldCat member libraries worldwide
Annotation
Software reliability methods by
Doron A Peled(
Book
)
1 edition published in 2001 in English and held by 9 WorldCat member libraries worldwide
This book presents current methods for dealing with software reliability, illustrating the advantages and disadvantages of each method. The description of the techniques is intended for a nonexpert audience with some minimal technical background. It also describes some advanced techniques, aimed at researchers and practitioners in software engineering. This reference will serve as an introduction to formal methods and techniques and will be a source for learning about various ways to enhance software reliability
1 edition published in 2001 in English and held by 9 WorldCat member libraries worldwide
This book presents current methods for dealing with software reliability, illustrating the advantages and disadvantages of each method. The description of the techniques is intended for a nonexpert audience with some minimal technical background. It also describes some advanced techniques, aimed at researchers and practitioners in software engineering. This reference will serve as an introduction to formal methods and techniques and will be a source for learning about various ways to enhance software reliability
Parallel symbolic computation algorithms(
Book
)
2 editions published in 1990 in English and held by 9 WorldCat member libraries worldwide
Abstract: "We describe the implementation of three symbolic computation algorithms on shared memory multiprocessors. We also evaluate the performance of the implementations, point out some of their common characteristics, and describe why these algorithms should be able to take advantage of the large scale heterogeneous shared memory machines currently being developed."
2 editions published in 1990 in English and held by 9 WorldCat member libraries worldwide
Abstract: "We describe the implementation of three symbolic computation algorithms on shared memory multiprocessors. We also evaluate the performance of the implementations, point out some of their common characteristics, and describe why these algorithms should be able to take advantage of the large scale heterogeneous shared memory machines currently being developed."
A parallel algorithm for constructing binary decision diagrams by
Shōji Kimura(
Book
)
3 editions published in 1990 in English and held by 9 WorldCat member libraries worldwide
Our approach to binary decision diagrams is somewhat different from the one used in [1]. We view the binary decision diagram for an nargument Boolean function as the minimal finite state automaton for the set of Boolean vectors of length n that satisfy f (i.e. the set of vectors in f⁻¹(1)). Because the minimal finite automaton for a regular language is unique up to isomorphism, it is easy to argue that this representation provides a canonical form for Boolean functions. Boolean operations involving NOT, AND, OR, etc. are implemented by the standard constructions for complement, intersection, and union of the finite languages accepted by these automata
3 editions published in 1990 in English and held by 9 WorldCat member libraries worldwide
Our approach to binary decision diagrams is somewhat different from the one used in [1]. We view the binary decision diagram for an nargument Boolean function as the minimal finite state automaton for the set of Boolean vectors of length n that satisfy f (i.e. the set of vectors in f⁻¹(1)). Because the minimal finite automaton for a regular language is unique up to isomorphism, it is easy to argue that this representation provides a canonical form for Boolean functions. Boolean operations involving NOT, AND, OR, etc. are implemented by the standard constructions for complement, intersection, and union of the finite languages accepted by these automata
SMLa high level language for the design and verification of finite state machines by M. C Browne(
Book
)
3 editions published in 1985 in English and held by 8 WorldCat member libraries worldwide
3 editions published in 1985 in English and held by 8 WorldCat member libraries worldwide
Analytica : a theorem prover for Mathematica by
E. M Clarke(
Book
)
3 editions published in 1992 in English and held by 8 WorldCat member libraries worldwide
We have tried to make the paper as selfcontained as possible so that it will be accessible to a wide audience of potential users. We illustrate the power of our theorem prover by several nontrivial examples including the basic properties of the stereographic projection and a series of three lemmas that lead to a proof of Weierstrass's example of a continuous nowhere differentiable function. Each of the lemmas in the latter example is proved completely automatically."
3 editions published in 1992 in English and held by 8 WorldCat member libraries worldwide
We have tried to make the paper as selfcontained as possible so that it will be accessible to a wide audience of potential users. We illustrate the power of our theorem prover by several nontrivial examples including the basic properties of the stereographic projection and a series of three lemmas that lead to a proof of Weierstrass's example of a continuous nowhere differentiable function. Each of the lemmas in the latter example is proved completely automatically."
Perspectives of systems informatics : 6th International Andrei Ershov Memorial Conference, PSI 2006, Novosibirsk, Russia,
June 2730, 2006 ; revised papers by
E. M Clarke(
Book
)
11 editions published in 2012 in English and held by 8 WorldCat member libraries worldwide
This book contains thoroughly refereed and revised papers from the 8th International Andrei Ershov Memorial Conference on Perspectives of System Informatics, PSI 2011, held in Akademgorodok, Novosibirsk, Russia, in June/July 2011. The 18 revised full papers and 10 revised short papers presented were carefully reviewed and selected from 60 submissions. The volume also contains 5 invited papers covering a range of hot topics in computer science and informatics. The papers are organized in topical sections on foundations of program and system development and analysis, partial evaluation, mixed computation, abstract interpretation, compiler construction, computer models and algorithms for bioinformatics, programming methodology and software engineering, information technologies, knowledgebased systems, and knowledge engineering
11 editions published in 2012 in English and held by 8 WorldCat member libraries worldwide
This book contains thoroughly refereed and revised papers from the 8th International Andrei Ershov Memorial Conference on Perspectives of System Informatics, PSI 2011, held in Akademgorodok, Novosibirsk, Russia, in June/July 2011. The 18 revised full papers and 10 revised short papers presented were carefully reviewed and selected from 60 submissions. The volume also contains 5 invited papers covering a range of hot topics in computer science and informatics. The papers are organized in topical sections on foundations of program and system development and analysis, partial evaluation, mixed computation, abstract interpretation, compiler construction, computer models and algorithms for bioinformatics, programming methodology and software engineering, information technologies, knowledgebased systems, and knowledge engineering
Verification of the Futurebus+ cache coherence protocol by
E. M Clarke(
Book
)
4 editions published in 1992 in English and held by 7 WorldCat member libraries worldwide
Abstract: "We used a hardware description language to construct a formal model of the cache coherence protocol described in the draft IEEE Futurebus+ standard. By applying temporal logic model checking techniques, we found several errors in the standard. The result of our project is a concise, comprehensible and unambiguous model of the protocol that should be useful both to the Futurebus+ Working Group members, who are responsible for the protocol, and to actual designers of Futurebus+ boards."
4 editions published in 1992 in English and held by 7 WorldCat member libraries worldwide
Abstract: "We used a hardware description language to construct a formal model of the cache coherence protocol described in the draft IEEE Futurebus+ standard. By applying temporal logic model checking techniques, we found several errors in the standard. The result of our project is a concise, comprehensible and unambiguous model of the protocol that should be useful both to the Futurebus+ Working Group members, who are responsible for the protocol, and to actual designers of Futurebus+ boards."
The design and verification of finite state hardware controllers by
E. M Clarke(
Book
)
3 editions published in 1987 in English and held by 7 WorldCat member libraries worldwide
3 editions published in 1987 in English and held by 7 WorldCat member libraries worldwide
Automatic and hierarchical verification of asynchronous circuits using temporal logic by
B Mishra(
Book
)
3 editions published in 1983 in English and held by 7 WorldCat member libraries worldwide
3 editions published in 1983 in English and held by 7 WorldCat member libraries worldwide
Research on automatic verificaion of finitestate concurrent systems by
E. M Clarke(
Book
)
6 editions published in 1987 in English and held by 7 WorldCat member libraries worldwide
This survey is organized as follows: Section 2 describes the syntax and semantics of the temporal logics that are used in this paper. Section 3 states the model checking problem and give an efficient algorithm for checking simple branchingtime formulas. Section 4 discusses the issue of fairness and show how the algorithm of Section 3 can be extended to include fairness constraints. Section 5 demonstrates how the model checking algorithm can be used to debug a simple mutual exclusion program. Section 6 describes some alternative approaches for verifying systems of finite state concurrent process. The complexity of checking linear temporal logic formulas are analyzed and the techniques of Pnueli and Lichtenstein and Vardi and Wolper are outlined. Additional applications to circuit and protocol verification are discussed in Section 7. The paper concludes in Section 8 with a discussion of some of the important remaining research problems like the state explosion problem
6 editions published in 1987 in English and held by 7 WorldCat member libraries worldwide
This survey is organized as follows: Section 2 describes the syntax and semantics of the temporal logics that are used in this paper. Section 3 states the model checking problem and give an efficient algorithm for checking simple branchingtime formulas. Section 4 discusses the issue of fairness and show how the algorithm of Section 3 can be extended to include fairness constraints. Section 5 demonstrates how the model checking algorithm can be used to debug a simple mutual exclusion program. Section 6 describes some alternative approaches for verifying systems of finite state concurrent process. The complexity of checking linear temporal logic formulas are analyzed and the techniques of Pnueli and Lichtenstein and Vardi and Wolper are outlined. Additional applications to circuit and protocol verification are discussed in Section 7. The paper concludes in Section 8 with a discussion of some of the important remaining research problems like the state explosion problem
Compositional model checking by
E. M Clarke(
Book
)
4 editions published in 1989 in English and Undetermined and held by 7 WorldCat member libraries worldwide
Abstract: "We describe a method for reducing the complexity of temporal logic model checking in systems composed of many parallel processes. Thegoal is to check properties of the components of a system and then deduce globalproperties from these local properties. The main difficulty with this type of approach is that local properties are often not preserved at the global level. We present a general framework for using additional interface processes to model the environment for a component. These interface processes are typically much simpler than the full environment of the component. By composing a component with its interface processes and then checking properties of this composition, we can guarantee that these properties will be preserved at the global level. We give two example compositional systems based on the logic CTL."
4 editions published in 1989 in English and Undetermined and held by 7 WorldCat member libraries worldwide
Abstract: "We describe a method for reducing the complexity of temporal logic model checking in systems composed of many parallel processes. Thegoal is to check properties of the components of a system and then deduce globalproperties from these local properties. The main difficulty with this type of approach is that local properties are often not preserved at the global level. We present a general framework for using additional interface processes to model the environment for a component. These interface processes are typically much simpler than the full environment of the component. By composing a component with its interface processes and then checking properties of this composition, we can guarantee that these properties will be preserved at the global level. We give two example compositional systems based on the logic CTL."
Automatic verification of sequential circuits using temporal logic by
M Browne(
Book
)
3 editions published between 1984 and 1985 in English and held by 7 WorldCat member libraries worldwide
3 editions published between 1984 and 1985 in English and held by 7 WorldCat member libraries worldwide
Characterizing Kripke structures in temporal logic by M. C Browne(
Book
)
2 editions published in 1987 in English and held by 7 WorldCat member libraries worldwide
The question of whether branchingtime temporal logic or lineartime temporal logic is best for reasoning about concurrent programs is one of the most controversial issues in logics of programs. Concurrent programs are usually modelled by labelled statetransition graphs in which some state is designated as the initial state. For historical reasons such graphs are called Kripke structures. In linear temporal logic operators are provided for describing events along a single time path (i.e., along a single path in a Kripke structure). In a branchingtime logic the temporal operators quantify over the futures that are possible from a given state (i.e., over the possible paths that lead from a state). It is well known that the two types of temporal logic have different expressive powers. Linear temporal logic, for example, can express certain fairness properties that cannot be expressed in branchingtime temporal logic. On the other hand, certain practical decision problems like model checking are easier for branchingtime temporal logic than for linear temporal logic. This paper provides further insight on which type of logic is best. It is shown that if two finite Kripke structures can be distinguished by some formula that contains both branchingtime and lineartime operators, then the structures can be distinguished by a formula that contains only branching time operators. Specifically, we show that if two finite Kripke structures can be distinguished by some formula of the logic CTL (i.e., if there is some CTL formula that is true in one but not in the other), then they can be distinguished by some formula of the logic CTL
2 editions published in 1987 in English and held by 7 WorldCat member libraries worldwide
The question of whether branchingtime temporal logic or lineartime temporal logic is best for reasoning about concurrent programs is one of the most controversial issues in logics of programs. Concurrent programs are usually modelled by labelled statetransition graphs in which some state is designated as the initial state. For historical reasons such graphs are called Kripke structures. In linear temporal logic operators are provided for describing events along a single time path (i.e., along a single path in a Kripke structure). In a branchingtime logic the temporal operators quantify over the futures that are possible from a given state (i.e., over the possible paths that lead from a state). It is well known that the two types of temporal logic have different expressive powers. Linear temporal logic, for example, can express certain fairness properties that cannot be expressed in branchingtime temporal logic. On the other hand, certain practical decision problems like model checking are easier for branchingtime temporal logic than for linear temporal logic. This paper provides further insight on which type of logic is best. It is shown that if two finite Kripke structures can be distinguished by some formula that contains both branchingtime and lineartime operators, then the structures can be distinguished by a formula that contains only branching time operators. Specifically, we show that if two finite Kripke structures can be distinguished by some formula of the logic CTL (i.e., if there is some CTL formula that is true in one but not in the other), then they can be distinguished by some formula of the logic CTL
Analytica : an experiment in combining theorem proving and symbolic computation by
E. M Clarke(
Book
)
3 editions published in 1992 in English and held by 6 WorldCat member libraries worldwide
Analytica has been able to prove several nontrivial examples including the basic properties of the stereographic projection and a series of three lemmas that lead to a proof of Weierstrass's example of a continuous nowhere differentiable function. Each of the lemmas in the latter example is proved completely automatically."
3 editions published in 1992 in English and held by 6 WorldCat member libraries worldwide
Analytica has been able to prove several nontrivial examples including the basic properties of the stereographic projection and a series of three lemmas that lead to a proof of Weierstrass's example of a continuous nowhere differentiable function. Each of the lemmas in the latter example is proved completely automatically."
Realtime symbolic model checking for discrete time models by Sérgio V Campos(
Book
)
3 editions published in 1994 in English and held by 6 WorldCat member libraries worldwide
Abstract: "The BDDbased symbolic model checking algorithm given in [4, 10] is extended to handle realtime properties using the bounded until operator [9]. We believe that this algorithm, which is based on discrete time, is able to handle many realtime properties that arise in practical problems. One example of such a property is priority inversion. This is a serious problem that can make realtime systems unpredictable in subtle ways. Our work discusses this problem and presents one possible solution. The solution is formalized and verified using the modified algorithm. We also propose another extension to the model checking algorithm. Timed transition graphs are transition graphs in which events may take nonunit time to occur. The time it takes for a transition in a TTG to happen is determined by a time interval
3 editions published in 1994 in English and held by 6 WorldCat member libraries worldwide
Abstract: "The BDDbased symbolic model checking algorithm given in [4, 10] is extended to handle realtime properties using the bounded until operator [9]. We believe that this algorithm, which is based on discrete time, is able to handle many realtime properties that arise in practical problems. One example of such a property is priority inversion. This is a serious problem that can make realtime systems unpredictable in subtle ways. Our work discusses this problem and presents one possible solution. The solution is formalized and verified using the modified algorithm. We also propose another extension to the model checking algorithm. Timed transition graphs are transition graphs in which events may take nonunit time to occur. The time it takes for a transition in a TTG to happen is determined by a time interval
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Grumberg, Orna
 Peled, Doron A. 1962 Author
 Voronkov, Andrei 1959 Editor
 Kurshan, R. P. 1943 Author Editor
 Virbitskaite, Irina Editor
 Kozen, Dexter 1951 Editor
 CAV. <2, 1990, New Brunswick, NJ>
 Browne, M. C. Author
 Mishra, B. Author
 Zhao, Xudong
Useful Links
Associated Subjects
Artificial intelligence Automatic theorem proving Cache memory Computeraided design Computeraided engineering Computer engineering Computer logic Computer network protocols Computer programming Computer programs Computer programsCorrectness Computer programsVerification Computers Computers, Special purpose Computer science Computer software Computer softwareReliability Computer softwareVerification Computer systems Computer systemsVerification Computer vision Digital integrated circuitsComputeraided design Digital integrated circuitsDesign and constructionData processing Electrical engineering Electronic circuit design Electronic circuits Electronic circuitsTesting Electronic data processing Electronic data processingDistributed processing Electronic digital computersEvaluation Engineering Integrated circuitsVerification Logic Logic, Symbolic and mathematical Logic design Logic programming Machine theoryMathematical models Mathematics ML (Computer program language) Multiprocessors Parallel processing (Electronic computers) Parallel programming (Computer science) Proof theory Realtime data processing Reasoning Software engineering Systems engineering
Alternative Names
Clarke, E.
Clarke, E. 1945
Clarke, E. M.
Clarke, E. M. 1945
Clarke, Edmund.
Clarke, Edmund 1945
Clarke, Edmund 1945 Jr
Clarke, Edmund Jr. 1945
Clarke, Edmund M.
Clarke, Edmund M. 1945
Clarke, Edmund M. 1945 Jr
Clarke, Edmund M. Jr. 1945
Clarke, Edmund Melson
Clarke, Edmund Melson 1945
Clarke, Edmund Melson 1945 Jr
Clarke, Edmund Melson Jr. 1945
Edmund Clarke informático teórico estadounidense
Edmund M. Clarke Amerikaans informaticus
Edmund M. Clarke amerikanischer Informatiker
Edmund M. Clarke amerikansk ingeniør og informatikar
Edmund M. Clarke amerikansk ingeniør og informatiker
Edmund M. Clarke amerikansk ingenjör och datavetare
Edmund M. Clarke informaticien américain
Έντμουντ Μ. Κλαρκ
Едмунд Кларк
Кларк, Эдмунд Мельсон
ادموند ام. کلارک دانشمند علوم کامپیوتر و مهندس آمریکایی
إدموند كلارك
এডমুন্ড এম. ক্লার্ক
エドムンド・クラーク
爱德蒙·克拉克
Languages
Covers