Manna, Zohar
Overview
Works:  169 works in 678 publications in 3 languages and 4,983 library holdings 

Roles:  Author, Editor, Honoree 
Classifications:  QA76.6, 001.642 
Publication Timeline
.
Most widely held works about
Zohar Manna
 John McCarthy papers by John McCarthy John McCarthy( )
 by John McCarthy John McCarthy( )
Most widely held works by
Zohar Manna
Mathematical theory of computation
by
Zohar Manna(
Book
)
25 editions published between 1974 and 2003 in English and Italian and held by 625 WorldCat member libraries worldwide
25 editions published between 1974 and 2003 in English and Italian and held by 625 WorldCat member libraries worldwide
Calculus of computation decision procedures with applications to verification
by
Aaron R Bradley(
)
21 editions published between 2007 and 2010 in English and Undetermined and held by 557 WorldCat member libraries worldwide
"Computational logic is a fastgrowing field with applications in artificial intelligence, constraint solving, and the design and verification of software and hardware systems. Written with graduate and advanced undergraduate students in mind, this textbook introduces computational logic from the foundations of firstorder logic to stateoftheart decision procedures for arithmetic, data structures, and combination theories." "This textbook also presents a logical approach to engineering correct software. The increasing ubiquity of computers makes implementing correct systems more important than ever. Verification exercises develop the reader's facility in specifying and verifying software using logic. The treatment of verification concludes with an introduction to the static analysis of software, an important component of modern verification systems." "For readers interested in learning more about computational logic, decision procedures, verification, and other areas of formal methods, the final chapter outlines courses of further study."Jacket
21 editions published between 2007 and 2010 in English and Undetermined and held by 557 WorldCat member libraries worldwide
"Computational logic is a fastgrowing field with applications in artificial intelligence, constraint solving, and the design and verification of software and hardware systems. Written with graduate and advanced undergraduate students in mind, this textbook introduces computational logic from the foundations of firstorder logic to stateoftheart decision procedures for arithmetic, data structures, and combination theories." "This textbook also presents a logical approach to engineering correct software. The increasing ubiquity of computers makes implementing correct systems more important than ever. Verification exercises develop the reader's facility in specifying and verifying software using logic. The treatment of verification concludes with an introduction to the static analysis of software, an important component of modern verification systems." "For readers interested in learning more about computational logic, decision procedures, verification, and other areas of formal methods, the final chapter outlines courses of further study."Jacket
Time for verification essays in memory of Amir Pnueli
by
Zohar Manna(
)
15 editions published in 2010 in English and held by 477 WorldCat member libraries worldwide
This volume is dedicated to the memory of the 1996 Turing Award winner Amir Pnueli, who passed away in November 2009. The Festschrift contains 15 scientific articles written by leading scientists who were close to Amir Pnueli either as former students, colleagues or friends
15 editions published in 2010 in English and held by 477 WorldCat member libraries worldwide
This volume is dedicated to the memory of the 1996 Turing Award winner Amir Pnueli, who passed away in November 2009. The Festschrift contains 15 scientific articles written by leading scientists who were close to Amir Pnueli either as former students, colleagues or friends
The logical basis for computer programming
by
Zohar Manna(
Book
)
18 editions published between 1984 and 1990 in English and held by 459 WorldCat member libraries worldwide
Mathematical logic; Theories with induction
18 editions published between 1984 and 1990 in English and held by 459 WorldCat member libraries worldwide
Mathematical logic; Theories with induction
Lectures on the logic of computer programming
by
Zohar Manna(
Book
)
21 editions published in 1980 in English and held by 360 WorldCat member libraries worldwide
This monograph deals with aspects of the computer programming process that involve techniques derived from mathematical logic. The author focuses on proving that a given program produces the intended result whenever it halts, that a given program will eventually halt, that a given program is partially correct and terminates, and that a system of rewriting rules always halts. Also, the author describes the intermediate behavior of a given program, and discusses constructing a program to meet a given specification
21 editions published in 1980 in English and held by 360 WorldCat member libraries worldwide
This monograph deals with aspects of the computer programming process that involve techniques derived from mathematical logic. The author focuses on proving that a given program produces the intended result whenever it halts, that a given program will eventually halt, that a given program is partially correct and terminates, and that a system of rewriting rules always halts. Also, the author describes the intermediate behavior of a given program, and discusses constructing a program to meet a given specification
Studies in automatic programming logic
by
Zohar Manna(
Book
)
12 editions published in 1977 in English and Italian and held by 321 WorldCat member libraries worldwide
12 editions published in 1977 in English and Italian and held by 321 WorldCat member libraries worldwide
The temporal logic of reactive and concurrent systems
by
Zohar Manna(
Book
)
19 editions published between 1991 and 2013 in English and Undetermined and held by 283 WorldCat member libraries worldwide
Reactive systems are computing systems which are interactive, such as realtime systems, operating systems, concurrent systems, control systems, etc. They are among the most difficult computing systems to program. Temporal logic is a formal tool/language which yields excellent results in specifying reactive systems. This volume, the first of two, subtitled Specification, has a selfcontained introduction to temporal logic and, more important, an introduction to the computational model for reactive programs, developed by Zohar Manna and Amir Pnueli of Stanford University and the Weizmann Institute of Science, Israel, respectively
19 editions published between 1991 and 2013 in English and Undetermined and held by 283 WorldCat member libraries worldwide
Reactive systems are computing systems which are interactive, such as realtime systems, operating systems, concurrent systems, control systems, etc. They are among the most difficult computing systems to program. Temporal logic is a formal tool/language which yields excellent results in specifying reactive systems. This volume, the first of two, subtitled Specification, has a selfcontained introduction to temporal logic and, more important, an introduction to the computational model for reactive programs, developed by Zohar Manna and Amir Pnueli of Stanford University and the Weizmann Institute of Science, Israel, respectively
Verification : theory and practice : essays dedicated to Zohar Manna on the occasion of his 64th birthday
by
Nachum Dershowitz(
Book
)
13 editions published between 2003 and 2004 in English and German and held by 282 WorldCat member libraries worldwide
This festschrift volume constitutes a unique tribute to Zohar Manna on the occasion of his 64th birthday. Like the scientific work of Zohar Manna, the 32 research articles span the entire scope of the logical half of computer science. Also included is a paean to Zohar Manna by the volume editor. The articles presented are devoted to the theory of computing, program semantics, logics of programs, temporal logic, automated deduction, decision procedures, model checking, concurrent systems, reactive systems, hardware and software verification, testing, software engineering, requirements specification, and program synthesis
13 editions published between 2003 and 2004 in English and German and held by 282 WorldCat member libraries worldwide
This festschrift volume constitutes a unique tribute to Zohar Manna on the occasion of his 64th birthday. Like the scientific work of Zohar Manna, the 32 research articles span the entire scope of the logical half of computer science. Also included is a paean to Zohar Manna by the volume editor. The articles presented are devoted to the theory of computing, program semantics, logics of programs, temporal logic, automated deduction, decision procedures, model checking, concurrent systems, reactive systems, hardware and software verification, testing, software engineering, requirements specification, and program synthesis
Temporal verification of reactive systems : safety
by
Zohar Manna(
Book
)
14 editions published between 1991 and 2012 in English and German and held by 253 WorldCat member libraries worldwide
This book presents an extensive verification methodology for proving that reactive systems meet their specifications, expressed as safety properties in the language of temporal logic. The methods include deductive approaches based on theorem proving and fully automatic approaches based on model checking. All researchers and students interested in the analysis and verification of reactive and concurrent systems will find this book to be a comprehensive guide on how formal techniques can be used to ensure the correctness of such systems. An educational version of the Stanford Temporal Prover (STeP), a tool which supports the verification of reactive systems, is available for use with this book
14 editions published between 1991 and 2012 in English and German and held by 253 WorldCat member libraries worldwide
This book presents an extensive verification methodology for proving that reactive systems meet their specifications, expressed as safety properties in the language of temporal logic. The methods include deductive approaches based on theorem proving and fully automatic approaches based on model checking. All researchers and students interested in the analysis and verification of reactive and concurrent systems will find this book to be a comprehensive guide on how formal techniques can be used to ensure the correctness of such systems. An educational version of the Stanford Temporal Prover (STeP), a tool which supports the verification of reactive systems, is available for use with this book
The deductive foundations of computer programming : a onevolume version of The logical basis for computer programming
by
Zohar Manna(
Book
)
12 editions published between 1943 and 1993 in English and held by 179 WorldCat member libraries worldwide
12 editions published between 1943 and 1993 in English and held by 179 WorldCat member libraries worldwide
The Logical basis for computer programming
by
Zohar Manna(
Book
)
11 editions published in 1985 in English and held by 97 WorldCat member libraries worldwide
11 editions published in 1985 in English and held by 97 WorldCat member libraries worldwide
Software development technologies for reactive, realtime, and hybrid systems
by
Zohar Manna(
Book
)
1 edition published in 1997 in English and held by 76 WorldCat member libraries worldwide
1 edition published in 1997 in English and held by 76 WorldCat member libraries worldwide
Open architectures for formal reasoning and deductive technologies for software development final report 5/1/917/31/94, grant no. NAG2703
(
Book
)
1 edition published in 1994 in English and held by 69 WorldCat member libraries worldwide
1 edition published in 1994 in English and held by 69 WorldCat member libraries worldwide
The logical basis for computer programming
by
Zohar Manna(
Book
)
7 editions published in 1990 in English and held by 54 WorldCat member libraries worldwide
7 editions published in 1990 in English and held by 54 WorldCat member libraries worldwide
The temporal logic of reactive and concurrent systems
by
Zohar Manna(
Book
)
4 editions published between 1991 and 1992 in English and held by 36 WorldCat member libraries worldwide
4 editions published between 1991 and 1992 in English and held by 36 WorldCat member libraries worldwide
Verification of concurrent programs : a temporal proof system
by
Zohar Manna(
Book
)
18 editions published between 1981 and 1983 in English and Undetermined and held by 29 WorldCat member libraries worldwide
A proof system based on temporal logic is presented for proving properties of concurrent programs based on the sharedvariables computation model. The system consists of three parts: the general uninterpreted part, the domain dependent part and the program dependent part. In the general part we give a complete proof system for firstorder temporal logic with detailed proofs of useful theorems. This logic enables reasoning about general time sequences. The domain dependent part characterizes the special properties of the domain over which the program operates. The program dependent part introduces axioms which restrict the time sequences considered to be execution sequences of a given program. The utility of the full system is demonstrated by proving invariance, liveness and precedence properties of several concurrent programs. Derived proof principles for these classes of properties, are obtained and lead to a compact representation of proofs
18 editions published between 1981 and 1983 in English and Undetermined and held by 29 WorldCat member libraries worldwide
A proof system based on temporal logic is presented for proving properties of concurrent programs based on the sharedvariables computation model. The system consists of three parts: the general uninterpreted part, the domain dependent part and the program dependent part. In the general part we give a complete proof system for firstorder temporal logic with detailed proofs of useful theorems. This logic enables reasoning about general time sequences. The domain dependent part characterizes the special properties of the domain over which the program operates. The program dependent part introduces axioms which restrict the time sequences considered to be execution sequences of a given program. The utility of the full system is demonstrated by proving invariance, liveness and precedence properties of several concurrent programs. Derived proof principles for these classes of properties, are obtained and lead to a compact representation of proofs
Is "sometime" sometimes better than "always"? : Intermittent assertions in proving program correctness
by
Zohar Manna(
Book
)
16 editions published between 1976 and 1977 in English and Undetermined and held by 22 WorldCat member libraries worldwide
This paper explores a technique for proving the correctness and termination of programs simultaneously. This approach, which we call the intermittentassertion method, involves documenting the program with assertions that must be true at some time when control is passing through the corresponding point, but that need not be true every time. The method, introduced by Knuth and further developed by Burstall, promises to provide a valuable complement to the more conventional methods. The technique is introduced and illustrated with a number of examples. It is then shown that a correctness proof using the invariant assertion method or the subgoal induction method can always be expressed using intermittent assertions instead, but that the reverse is not always the case. The method can also be used just to prove termination, and any proof of termination using the conventional wellfounded sets approach can be rephrased as a proof using intermittent assertions. Finally, it is shown how the method can be applied to prove the validity of program transformations and the correctness of continuously operating programs
16 editions published between 1976 and 1977 in English and Undetermined and held by 22 WorldCat member libraries worldwide
This paper explores a technique for proving the correctness and termination of programs simultaneously. This approach, which we call the intermittentassertion method, involves documenting the program with assertions that must be true at some time when control is passing through the corresponding point, but that need not be true every time. The method, introduced by Knuth and further developed by Burstall, promises to provide a valuable complement to the more conventional methods. The technique is introduced and illustrated with a number of examples. It is then shown that a correctness proof using the invariant assertion method or the subgoal induction method can always be expressed using intermittent assertions instead, but that the reverse is not always the case. The method can also be used just to prove termination, and any proof of termination using the conventional wellfounded sets approach can be rephrased as a proof using intermittent assertions. Finally, it is shown how the method can be applied to prove the validity of program transformations and the correctness of continuously operating programs
Temporal verification of reactive systems
by
Zohar Manna(
Book
)
2 editions published in 1995 in English and held by 19 WorldCat member libraries worldwide
2 editions published in 1995 in English and held by 19 WorldCat member libraries worldwide
How to clear a block : a theory of plans
by
Zohar Manna(
Book
)
7 editions published between 1986 and 1987 in English and Undetermined and held by 19 WorldCat member libraries worldwide
Problems in commonsense and robot planning are approached by methods adapted from program synthesis research; planning is regard as an application of automated deduction. To support this approach, we introduce a variant of situational logic, called plan theory, in which plans are explicit objects. A machineoriented deductivetableau inference system is adapted to plan theory. Equations and equivalences of the theory are built into a unification algorithm for the system. Frame axioms are built into the resolution rule. Special attention is paid to the derivation of conditional and recursive plans. Inductive proofs of theorems for even the simplest planning problems, such as clearing a block, have been found to require challenging generalizations
7 editions published between 1986 and 1987 in English and Undetermined and held by 19 WorldCat member libraries worldwide
Problems in commonsense and robot planning are approached by methods adapted from program synthesis research; planning is regard as an application of automated deduction. To support this approach, we introduce a variant of situational logic, called plan theory, in which plans are explicit objects. A machineoriented deductivetableau inference system is adapted to plan theory. Equations and equivalences of the theory are built into a unification algorithm for the system. Frame axioms are built into the resolution rule. Special attention is paid to the derivation of conditional and recursive plans. Inductive proofs of theorems for even the simplest planning problems, such as clearing a block, have been found to require challenging generalizations
A hierarchy of temporal properties
by
Zohar Manna(
Book
)
6 editions published between 1987 and 1988 in English and held by 18 WorldCat member libraries worldwide
Abstract: "We propose a classification of temporal properties into a hierarchy which refines the known safetyliveness classification of properties. The new classification recognizes the classes of safety, guarantee, persistence, fairness, and hyperfairness. The classification suggested here is based on the different ways a property of finite computations can be extended into a property of infinite computations. For properties that are expressible by temporal logic and predicate automata, we provide a syntactic characterization of the formulae and automata that specify properties in the different classes. We consider the verification of properties over a given program, and provide a unique proof principle for each class."
6 editions published between 1987 and 1988 in English and held by 18 WorldCat member libraries worldwide
Abstract: "We propose a classification of temporal properties into a hierarchy which refines the known safetyliveness classification of properties. The new classification recognizes the classes of safety, guarantee, persistence, fairness, and hyperfairness. The classification suggested here is based on the different ways a property of finite computations can be extended into a property of infinite computations. For properties that are expressible by temporal logic and predicate automata, we provide a syntactic characterization of the formulae and automata that specify properties in the different classes. We consider the verification of properties over a given program, and provide a unique proof principle for each class."
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Pnueli, A.
 Waldinger, Richard Author
 Bradley, Aaron R. Author
 Peled, Doron A. 1962 Editor
 Dershowitz, Nachum Author Editor
 Stanford University Computer Science Department
 United States National Aeronautics and Space Administration
 Stanford Artificial Intelligence Laboratory
 McCarthy, John 19272011 Author
 STANFORD UNIV CA DEPT OF COMPUTER SCIENCE
Useful Links
Associated Subjects
Artificial intelligence Automatic programming (Computer science) Computer architecture Computer logic Computer programming Computer programs Computer programsCorrectness Computer programsTesting Computer programsVerification Computer science Computer software Computer softwareDevelopment Computer softwareVerification Computer systems Debugging in computer science Electronic data processingDistributed processing Electronic digital computers Information storage and retrieval systemsMedicine Information theory LISP (Computer program language) Logic Logic, Symbolic and mathematical Logic design Machine theory Parallel processing (Electronic computers) Parallel programming (Computer science) Planning Programming languages (Electronic computers)Syntax Software engineering Tense (Logic) Universities and collegesFaculty Verification (Logic)