Clarke, E. M. 1945
Overview
Works:  134 works in 324 publications in 3 languages and 3,357 library holdings 

Genres:  Conference papers and proceedings Handbooks and manuals History 
Roles:  Author, Editor, Owner 
Classifications:  QA76.76.V47, 004.21 
Publication Timeline
.
Most widely held works by
E. M Clarke
Model checking by
E. M Clarke(
Book
)
21 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
21 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
R. P Kurshan(
Book
)
23 editions published between 1990 and 1991 in 4 languages and held by 316 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
23 editions published between 1990 and 1991 in 4 languages and held by 316 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
Computeraided verification '90 : proceedings of a DIMACS workshop, June 1821, 1990 by CAV (Conference)(
Book
)
8 editions published in 1991 in English and held by 88 WorldCat member libraries worldwide
8 editions published in 1991 in English and held by 88 WorldCat member libraries worldwide
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
This book constitutes the thoroughly refereed postconference proceedings of the 16th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2010, which took place in Dakar, Senegal, in April/May 2010. The 27 revised full papers and 9 revised short papers presented together with 1 invited talk were carefully revised and selected from 47 submissions. The papers address all current issues in automated reasoning, computational logic, programming languages and deal with logic programming, logicbased program manipulation, formal methods, and various kinds of AI logics. Subjects covered range from theoretical aspects to various applications such as automata, linear arithmetic, verification, knowledge representation, proof theory, quantified constraints, as well as modal and temporal logics
16 editions published between 2010 and 2011 in English and held by 56 WorldCat member libraries worldwide
This book constitutes the thoroughly refereed postconference proceedings of the 16th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2010, which took place in Dakar, Senegal, in April/May 2010. The 27 revised full papers and 9 revised short papers presented together with 1 invited talk were carefully revised and selected from 47 submissions. The papers address all current issues in automated reasoning, computational logic, programming languages and deal with logic programming, logicbased program manipulation, formal methods, and various kinds of AI logics. Subjects covered range from theoretical aspects to various applications such as automata, linear arithmetic, verification, knowledge representation, proof theory, quantified constraints, as well as modal and temporal logics
The nurses' "Enquire within"; a pocket encyclopaedia of diseases, their symptoms, nursing treatment and much other valuable
information, alphabetically arranged by
E. M Clarke(
Book
)
18 editions published between 1906 and 1926 in English and held by 19 WorldCat member libraries worldwide
18 editions published between 1906 and 1926 in English and held by 19 WorldCat member libraries worldwide
The design and verification of finite state hardware controllers by
E. M Clarke(
Book
)
7 editions published between 1987 and 1989 in English and Undetermined and held by 13 WorldCat member libraries worldwide
7 editions published between 1987 and 1989 in English and Undetermined and held by 13 WorldCat member libraries worldwide
Automatic and hierarchical verification of asynchronous circuits using temporal logic by
B Mishra(
Book
)
6 editions published between 1983 and 1985 in English and Undetermined and held by 12 WorldCat member libraries worldwide
6 editions published between 1983 and 1985 in English and Undetermined and held by 12 WorldCat member libraries worldwide
Compositional model checking by
E. M Clarke(
Book
)
7 editions published between 1989 and 1998 in English and Undetermined and held by 11 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."
7 editions published between 1989 and 1998 in English and Undetermined and held by 11 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 finite state concurrent systems using temporal logic specifications : a practical approach by
E. M Clarke(
Book
)
5 editions published between 1983 and 1985 in English and Undetermined and held by 10 WorldCat member libraries worldwide
No abstract
5 editions published between 1983 and 1985 in English and Undetermined and held by 10 WorldCat member libraries worldwide
No abstract
Lectures on the Public Life and Character of Oliver Cromwell, etc by
E. M Clarke(
Book
)
5 editions published in 1847 in English and held by 10 WorldCat member libraries worldwide
5 editions published in 1847 in English and held by 10 WorldCat member libraries worldwide
Hybrid decision diagrams : overcoming the limitations of MTBDDs and BMDs by
E. M Clarke(
Book
)
2 editions published in 1995 in English and held by 9 WorldCat member libraries worldwide
Abstract: "Functions that map boolean vectors into the integers are important for the design and verification of arithmetic circuits. MTBDDs and BMDs have been proposed for representing this class of functions. We discuss the relationship between these methods and describe a generalization called hybrid decision diagrams which is often much more concise. The Walsh transform and ReedMuller transform have numerous applications in computeraided design, but the usefulness of these techniques in practice has been limited by the size of the boolean functions that can be transformed. Currently available techniques limit the functions to less than 20 variables. In this paper, we show how to compute concise representations of the Walsh transform and ReedMuller transform for functions with several hundred variables. We show how to implement arithmetic operations efficiently for hybrid decision diagrams. In practice, this is one of the main limitations of BMDs since performing arithmetic operations on functions expressed in this notation can be very expensive. In order to extend symbolic model checking algorithms to handle arithmetic properties, it is essential to be able to compute the BDD for the set of variable assignments that satisfy an arithmetic relation. Bryant and Chen do not provide an algorithm for this. In our paper, we give an efficient algorithm for this purpose. Moreover, we prove that for the class of linear expressions, the time complexity of our algorithm is linear in the number of variables. Our techniques for handling arithmetic oeprations and relations are used intensively in the verification of an SRT division algorithm similar to the one that is used in the Pentium."
2 editions published in 1995 in English and held by 9 WorldCat member libraries worldwide
Abstract: "Functions that map boolean vectors into the integers are important for the design and verification of arithmetic circuits. MTBDDs and BMDs have been proposed for representing this class of functions. We discuss the relationship between these methods and describe a generalization called hybrid decision diagrams which is often much more concise. The Walsh transform and ReedMuller transform have numerous applications in computeraided design, but the usefulness of these techniques in practice has been limited by the size of the boolean functions that can be transformed. Currently available techniques limit the functions to less than 20 variables. In this paper, we show how to compute concise representations of the Walsh transform and ReedMuller transform for functions with several hundred variables. We show how to implement arithmetic operations efficiently for hybrid decision diagrams. In practice, this is one of the main limitations of BMDs since performing arithmetic operations on functions expressed in this notation can be very expensive. In order to extend symbolic model checking algorithms to handle arithmetic properties, it is essential to be able to compute the BDD for the set of variable assignments that satisfy an arithmetic relation. Bryant and Chen do not provide an algorithm for this. In our paper, we give an efficient algorithm for this purpose. Moreover, we prove that for the class of linear expressions, the time complexity of our algorithm is linear in the number of variables. Our techniques for handling arithmetic oeprations and relations are used intensively in the verification of an SRT division algorithm similar to the one that is used in the Pentium."
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
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
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."
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 Undetermined and held by 8 WorldCat member libraries worldwide
3 editions published in 1985 in English and Undetermined and held by 8 WorldCat member libraries worldwide
A unified approach for showing language containment and equivalence between various types of [omega]automata by
E. M Clarke(
Book
)
4 editions published in 1989 in English and Undetermined and held by 8 WorldCat member libraries worldwide
Our algorithms use a model checking procedure for the logic with the formulas obtained from the automata. The results of our paper are important for verification of finite state concurrent systems with fairness constraints. A natural way of reasoning about such systems is to model the finite state program by one [omega]automation and its specification by another."
4 editions published in 1989 in English and Undetermined and held by 8 WorldCat member libraries worldwide
Our algorithms use a model checking procedure for the logic with the formulas obtained from the automata. The results of our paper are important for verification of finite state concurrent systems with fairness constraints. A natural way of reasoning about such systems is to model the finite state program by one [omega]automation and its specification by another."
Research on automatic verificaion of finitestate concurrent systems by
E. M Clarke(
Book
)
6 editions published in 1987 in English and Undetermined 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 Undetermined 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
Temporal logics for distributed systems : paradigms and algorithms ; 10.10.199915.10.1999 by
E. M Clarke(
Book
)
4 editions published between 1999 and 2000 in English and held by 7 WorldCat member libraries worldwide
4 editions published between 1999 and 2000 in English and held by 7 WorldCat member libraries worldwide
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."
Perspectives of systems informatics : 6th International Andrei Ershov Memorial Conference, PSI 2006, Novosibirsk, Russia,
June 2730, 2006 ; revised papers by
Edmund Clarke(
Book
)
3 editions published in 2012 in English and held by 2 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
3 editions published in 2012 in English and held by 2 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
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 Editor
 Virbitskaite, Irina Editor
 Zhao, Xudong
 Long, D. E.
 Browne, M. C. Author
 Mishra, B. Author
 CARNEGIEMELLON UNIV PITTSBURGH PA SCHOOL OF COMPUTER SCIENCE
Useful Links
Associated Subjects
Artificial intelligence Asynchronous circuits Automatic programming (Computer science) Automatic theorem proving Computational complexity Computeraided design Computer engineering Computer inputoutput equipment Computer programming Computer programsVerification Computer science Computer scienceMathematics Computer software Computer softwareReliability Computer softwareVerification Computer systems Computer systemsVerification Computer vision Cromwell, Oliver, Digital integrated circuitsComputeraided design Digital integrated circuitsDesign and constructionData processing Electronic circuit design Electronic circuitsTesting Electronic data processing Electronic data processingDistributed processing Electronic digital computersEvaluation Engineering Expert systems (Computer science)Verification Great Britain Integrated circuitsVerification Logic Logic, Symbolic and mathematical Logic design Logic programming Machine theory Machine theoryMathematical models Manufacturing processesPlanningData processing ML (Computer program language) Modality (Logic) Multiprocessors Nursing Parallel processing (Electronic computers) Parallel programming (Computer science) Programming languages (Electronic computers) Proof theory Puritan Revolution (Great Britain : 16421660) Software engineering System analysis System design Systems engineering
Alternative Names
Clarke, E.
Clarke, E. 1945
Clarke, E. M.
Clarke, E. M. 1945
Clarke, Edmund
Clarke, Edmund 1945
Clarke, Edmund Jr. 1945
Clarke, Edmund M.
Clarke, Edmund M. 1945
Clarke, Edmund M. Jr. 1945
Clarke, Edmund Melson
Clarke, Edmund Melson 1945
Clarke, Edmund Melson Jr. 1945
Edmund Clarke
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