Clarke, E. M. 1945Overview
Most widely held works by
E. M Clarke
Model checking
by Edmund Clarke
(
)
17 editions published between 1999 and 2008 in English and held by 1,322 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
Verification of infinitestate systems with applications to security
by NATO Advanced Research Workshop on Verification of Infinitestate Systems with Applications to Security
(
)
8 editions published in 2006 in English and held by 996 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
Logics of Programs, workshop, Carnegie Mellon University, Pittsburgh, PA, June 68, 1983
by Edmund Clarke
(
Book
)
14 editions published in 1984 in English and German and held by 342 WorldCat member libraries worldwide
Perspectives of systems informatics 8th International Andrei Ershov Memorial Conference, PSI 2011, Novosibirsk, Russia, June 27July 1, 2011, Revised selected papers
by Edmund Clarke
(
)
5 editions published in 2012 in English and held by 326 WorldCat member libraries worldwide
Computeraided verification : proceedings
by Edmund Clarke
(
Book
)
17 editions published in 1991 in 3 languages and held by 306 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
Logic for programming, artificial intelligence, and reasoning 16th international conference, LPAR16, Dakar, Senegal, April 25May 1, 2010 : revised selected papers
by Edmund Clarke
(
)
4 editions published between 2010 and 2011 in English and held by 41 WorldCat member libraries worldwide Annotation
Analytica : an experiment in combining theorem proving and symbolic computation
by Edmund Clarke
(
Book
)
5 editions published between 1992 and 1998 in English and held by 9 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."
Logic for programming, artificial intelligence, and reasoning 16th international conference ; revised selected papers
(
Book
)
2 editions published in 2010 in English and held by 9 WorldCat member libraries worldwide
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."
Software reliability methods
by Doron Peled
(
Book
)
1 edition published in 2001 in English and held by 9 WorldCat member libraries worldwide The book 'formal methods for software' presents a collection of current methods for dealing with software reliability. It compares between these methods, and shows their advantages and disadvantages. The book presents a description of the techniques, intended for a nonexpert audience with some minimal technical background (e.g., some training in software engineering, or basic computer science courses). It also describes some advanced techniques, aimed at researchers and practitioners in software engineering. This text/reference is intended to be used as an introduction to software methods techniques, a source for learning about various ways to enhanced software reliability, a reference on formal methods technique, and also as a basis for a one semester university course in this subject. It suggests various projects and exercises for achieving "handson" experience with the various formal methods tools
Automatic verification of finite state concurrent systems using temporal logic specifications : a practical approach
by Edmund Clarke
(
Book
)
2 editions published between 1983 and 1985 in English and held by 8 WorldCat member libraries worldwide No abstract
A parallel algorithm for constructing binary decision diagrams
by S Kimura
(
Book
)
2 editions published in 1990 in English and held by 8 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
Escher a geometrical layout system for recursively defined circuits
by Edmund Clarke
(
Book
)
2 editions published in 1985 in English and held by 8 WorldCat member libraries worldwide
Analytica : a theorem prover for Mathematica
by Edmund Clarke
(
Book
)
2 editions published in 1992 in English and held by 7 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."
Logics of Programs Workshop, Yorktown Heights, NY, USA
by Edmund Clarke
(
)
2 editions published in 2007 in English and held by 7 WorldCat member libraries worldwide
ComputerAided Verification 2nd International Conference, CAV '90 New Brunswick, NJ, USA, June 1821, 1990 Proceedings
by Edmund Clarke
(
)
2 editions published in 1991 in English and held by 7 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
Compositional model checking
by Edmund Clarke
(
Book
)
3 editions published in 1989 in English and Undetermined and held by 6 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."
Realtime symbolic model checking for discrete time models
by Sérgio V Campos
(
Book
)
2 editions published in 1994 in English and held by 6 WorldCat member libraries worldwide This allows the construction of smaller and more realistic models. A symbolic model checking algorithm is given for formulas using the bounded until operator in TTG models."
A unified approach for showing language containment and equivalence between various types of [omega]automata
by Edmund Clarke
(
Book
)
2 editions published in 1989 in English and held by 6 WorldCat member libraries worldwide Abstract: "We consider the language containment and equivalence problems for six different types of [omega]automata: Büchi, Muller, Rabin, Streett, the Lautomata of Kurshan, and the [universal quanitifier] automata of Manna and Pnueli. We give a six by six matrix in which each row and column is associated with one of these types of automata. The entry in the i[superscript th] column is the complexity of showing containment between the i[superscript th] type of automation and j[superscript th]. Thus, for example, we give the complexity of showing language containment and equivalence between a Büchi automation and a Muller or Streett automation. Our results are obtained by a uniform method that associates a formula of the computation tree logic CTL* with each type of automation
Reasoning about networks with many identical finitestate processes
by Edmund Clarke
(
Book
)
3 editions published between 1986 and 1987 in English and Undetermined and held by 6 WorldCat member libraries worldwide If we consider a distributed mutual exclusion algorithm for processes arranged in a ring network in which mutual exclusion is guaranteed by means of a token that is passed around the ring. A first attempt might be to consider a reduced system with with one or two processes. If the reduced system can be shown to be correct and of the individual processes are really identical, then we are tempted to conclude that the entire system will be correct. This type of informal argument is used quite frequently by designers in constructing systems that contain large numbers of identical processing elements. It is easy to contrive an example in which some pathological behavior only occurs when, say, 100 processes are connected together. By examining a system with only one or two processes it might be quite difficult to determine that this behavior is possible. One has the feeling that in many cases this kind of intuitive reasoning does lead to correct results. The question addressed is whether it is possible to provide a solid theoretical basis that will prevent fallacious conclusions in arguments of this type. Besides providing a firm basis for a common type of informal reasoning, our results are crucial for the success of automatic verification methods that involve temporal logic model checking. These techniques check that a finitestate concurrent system satisfies a temporal logic formula by searching all possible paths in the global state graph determined by the concurrent system. They have been used successfully to find subtle errors in tricky selftimed circuitserrors apparently unknown to the circuit designers. By using these results, model checking may become feasible for networks with large numbers of identical processes more
fewer
Audience Level
Related Identities
Associated Subjects
Artificial intelligence Automatic programming (Computer science) Automatic theorem proving Computeraided design Computer programming Computer programs Computer programsVerification Computer science Computer security Computer software Computer softwareReliability Computer softwareVerification Computer systems Computer systemsVerification Computer vision Digital integrated circuitsDesign and constructionData processing Electronic data processing Integrated circuitsVerification Logic, Symbolic and mathematical Logic design Logic programming Machine theory Modality (Logic) Multiprocessors Parallel processing (Electronic computers) Parallel programming (Computer science) Programming languages (Electronic computers) Realtime data processing Software engineering Systems engineering System theoryMathematical models TexasAustin

Alternative Names
Clarke, E.
Clarke, E. 1945
Clarke, E. M.
Clarke, E. M. 1945
Clarke, Edmund.
Clarke, Edmund, 1945
Clarke, Edmund M.
Clarke, Edmund M., 1945
Clarke, Edmund Melson
Clarke, Edmund Melson 1945 Vollstaendiger Name
Languages
Covers
