Most widely held works by Edmund Clarke
Verification of infinite-state systems with applications to security by NATO Advanced Research Workshop on Verification of Infinite-state Systems with Applications to Security ( )
7 editions published in 2006 in English and held by 890 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 6-8, 1983 by Egerton Clarke ( Book )
11 editions published in 1984 in English and German and held by 321 WorldCat member libraries worldwide
Model checking by E. M Clarke ( Book )
12 editions published between 1999 and 2008 in English and held by 112 WorldCat member libraries worldwide
This presentation of the theory and practice of model checking includes basic as well as state-of-the-art techniques, algorithms and tools, and can be used as an introduction to the subject or a reference for researchers
Computer-aided verification : proceedings by R. P Kurshan ( Book )
12 editions published in 1991 in 3 languages and held by 81 WorldCat member libraries worldwide
Perspectives of systems informatics 8th International Andrei Ershov Memorial Conference, PSI 2011, Novosibirsk, Russia, June 27-July 1, 2011, Revised selected papers by Edmund Clarke ( )
4 editions published in 2012 in English and held by 30 WorldCat member libraries worldwide
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 "hands-on" experience with the various formal methods tools
Escher-- a geometrical layout system for recursively defined circuits by Edmund Clarke ( Book )
1 edition published in 1985 in English and held by 7 WorldCat member libraries worldwide
Logic for programming, artificial intelligence, and reasoning 16th international conference, LPAR-16, Dakar, Senegal, April 25-May 1, 2010 : revised selected papers by Edmund M Clarke ( )
2 editions published between 2010 and 2011 in English and held by 6 WorldCat member libraries worldwide
A language for compositional specification and verification of finite state hardware controllers by Edmund Clarke ( Book )
1 edition published in 1989 in English and held by 6 WorldCat member libraries worldwide
Real-time 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."
Reasoning about procedures as parameters in the language L4 by Steven M German ( Book )
2 editions published in 1988 in English and held by 5 WorldCat member libraries worldwide
Efficient generation of counterexamples and witnesses in symbolic model checking ( Book )
1 edition published in 1994 in English and held by 5 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."
Combining symbolic computation and theorem proving : some problems of Ramanujan by Edmund Clarke ( Book )
2 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 non-trivial 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."
Hybrid decision diagrams : overcoming the limitations of MTBDDs and BMDs by Edmund Clarke ( Book )
1 edition published in 1995 in English and held by 5 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. 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 operations and relations are used intensively in the verification of an SRT division algorithm similar to the one that is used in the Pentium."
Word level symbolic model checking : a new approach for verifying arithmetic circuits by Edmund Clarke ( Book )
1 edition published in 1995 in English and held by 5 WorldCat member libraries worldwide
Abstract: "The highly-publicized division error in the Pentium has emphasized the importance of formal verification of arithmetic operations. Symbolic model checking techniques based on binary decision diagrams (BDDs) have been successful in verifying control logic. However, lack of proper representation for functions that map boolean vectors into integers has prevented this technique from being used for verifying arithmetic circuits. We have used hybrid decision diagrams to represent the integer functions that occur in the arithmetic circuit verification. For the state variables corresponding to data bits, our representation behaves like a binary moment diagram (BMD) while for the state variables corresponding to control signals, it behaves like a multi-terminal BDD (MTBDD). By using this representation, we are able to handle circuits with both control logic and wide data paths. We have extended the symbolic model checking system SMV so that it can also handle properties involving relationships among data words. In the original SMV system, atomic formulas could only contain state variables. In the extended system, we allow atomic formulas to be equations or inequalities between expressions as well. These expressions are represented as hybrid decision diagrams. The extended model checking system enables us to verify circuits for division and square root computation that are based on the SRT algorithm used by the Pentium. We are able to handle both the control logic and the data paths. The total number of state variables exceeds 600 (which is much larger than any circuit previously checked by SMV)."
Verification of infinite-state systems with applications to security : [proceedings of the NATO Advanced research workshop on Verification of infinite-state systems with applications to security, VISSAS 2005, Timaşoara, Romania, 17-22 March, 2005] by NATO Advanced Research Workshop on Verification of Infinite-state Systems with Applications to Security ( Book )
3 editions published in 2006 in English and held by 4 WorldCat member libraries worldwide
Symbolic techniques for formally verifying industrial systems by Sérgio V Campos ( Book )
2 editions published in 1996 in English and held by 4 WorldCat member libraries worldwide
Abstract: "The design of correct computer systems is extremely difficult. However, it is also a very important task. Such systems are frequently used in applications where failures can have catastrophic consequences, or cause significant financial losses. Simulation and testing are the most widely used verification techniques, but they can only show the presence of errors and cannot demonstrate correctness. Until lately formal methods were too expensive to be used in industrial problems, but recent research has made it possible to apply formal techniques to the verification of complex real-world systems. Symbolic model checking is an example of such a technique that has been successful in verifying large finite-state systems. It has also been extended to produce timing and performance information. These properties are extremely important in the design of high-performance systems and time-critical applications. A more detailed analysis of a model is possible using these extensions than by simply determining whether a property is satisfied or not. We present algorithms that determine the exact bounds on the delay between two specified events and the number of occurrences of another event in all such intervels. To demonstrate how our method works, we present two complex examples: the verification of the Futurebus+ cache coherence protocol and the timing analysis of the PCI local bus. These results show the usefulness of symbolic model checking in analyzing modern industrial designs."
Another look at LTL model checking by Edmund Clarke ( Book )
1 edition published in 1994 in English and held by 4 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  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."
Computer-Aided Verification 2nd International Conference, CAV '90 New Brunswick, NJ, USA, June 18-21, 1990 Proceedings by Edmund Clarke ( )
1 edition published in 1991 in English and held by 4 WorldCat member libraries worldwide
This volume contains the proceedings of the second workshop on Computer Aided Verification, held at DIMACS, Rutgers University, June 18-21, 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 proof-checking 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
Model checking for security protocols by Will Marrero ( Book )
2 editions published in 1997 in English and held by 4 WorldCat member libraries worldwide
Abstract: "As more resources are added to computer networks, and as more vendors look to the World Wide Web as a viable marketplace, the importance of being able to restrict access and to insure some kind of acceptable behavior even in the presence of malicious intruders becomes paramount. People have looked to cryptography to help solve many of these problems. However, cryptography itself is only a tool. The security of a system depends not only on the cryptosystem being used, but also on how it is used. Typically, researchers have proposed the use of security protocols to provide these security guarantees. These protocols consist of a sequence of messages, many with encrypted parts. In this paper, we develop a way of verifying these protocols using model checking. Model checking has proven to be a very useful technique for verifying hardware designs. By modelling circuits as finite-state machines, and examining all possible execution traces, model checking has found a number of errors in real world designs. Like hardware designs, security protocols are very subtle, and can also have bugs which are difficult to find. By examining all possible execution traces of a security protocol in the presence of a malicious intruder with well defined capabilities, we can determine if a protocol does indeed enforce its security guarantees. If not, we can provide a sample trace of an attack on the protocol."
Clarke, E. 1945-
Clarke, E. M.
Clarke, E. M. 1945-
Clarke, Edmund, 1945-
Clarke, Edmund M.
Clarke, Edmund M., 1945-
Clarke, Edmund Melson
Clarke, Edmund Melson 1945- Vollstaendiger Name