Manna, Zohar
Overview
Works:  154 works in 720 publications in 4 languages and 5,284 library holdings 

Roles:  Author, Editor, Honoree 
Publication Timeline
.
Most widely held works about
Zohar Manna
 John McCarthy papers by John McCarthy( )
 by John McCarthy( )
Most widely held works by
Zohar Manna
Mathematical theory of computation by
Zohar Manna(
Book
)
33 editions published between 1974 and 2003 in 3 languages and held by 647 WorldCat member libraries worldwide
33 editions published between 1974 and 2003 in 3 languages and held by 647 WorldCat member libraries worldwide
Studies in automatic programming logic by
Zohar Manna(
Book
)
16 editions published in 1977 in English and Italian and held by 319 WorldCat member libraries worldwide
16 editions published in 1977 in English and Italian and held by 319 WorldCat member libraries worldwide
Lectures on the logic of computer programming by
Zohar Manna(
Book
)
20 editions published in 1980 in English and held by 317 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
20 editions published in 1980 in English and held by 317 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
The temporal logic of reactive and concurrent systems by
Zohar Manna(
Book
)
24 editions published between 1991 and 1992 in English and held by 316 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
24 editions published between 1991 and 1992 in English and held by 316 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
Temporal verification of reactive systems : safety by
Zohar Manna(
Book
)
20 editions published between 1991 and 2012 in English and German and held by 269 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
20 editions published between 1991 and 2012 in English and German and held by 269 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
)
17 editions published between 1943 and 1993 in English and held by 199 WorldCat member libraries worldwide
17 editions published between 1943 and 1993 in English and held by 199 WorldCat member libraries worldwide
Verification : theory and practice : essays dedicated to Zohar Manna on the occasion of his 64th birthday by
Nachum Dershowitz(
Book
)
16 editions published between 2003 and 2004 in English and German and held by 194 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
16 editions published between 2003 and 2004 in English and German and held by 194 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
Software development technologies for reactive, realtime, and hybrid systems by
Zohar Manna(
Book
)
1 edition published in 1997 in English and held by 82 WorldCat member libraries worldwide
1 edition published in 1997 in English and held by 82 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 76 WorldCat member libraries worldwide
1 edition published in 1994 in English and held by 76 WorldCat member libraries worldwide
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 21 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 21 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
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."
Completing the temporal picture by
Zohar Manna(
Book
)
9 editions published in 1989 in English and held by 17 WorldCat member libraries worldwide
The paper presents a relatively complete proof system for proving the validity of temporal properties of reactive programs. The presented proof system improves on previous temporal systems, such as (MP83a) and (MP83b), in that it reduces the validity of program properties into pure assertional reasoning, not involving additional temporal reasoning. The proof system is based on the classification of temporal properties according to the Borel hierarchy, providing an appropriate proof rule for each of the main classes, such as safety, response, and progress properties
9 editions published in 1989 in English and held by 17 WorldCat member libraries worldwide
The paper presents a relatively complete proof system for proving the validity of temporal properties of reactive programs. The presented proof system improves on previous temporal systems, such as (MP83a) and (MP83b), in that it reduces the validity of program properties into pure assertional reasoning, not involving additional temporal reasoning. The proof system is based on the classification of temporal properties according to the Borel hierarchy, providing an appropriate proof rule for each of the main classes, such as safety, response, and progress properties
How to clear a block : a theory of plans by
Zohar Manna(
Book
)
6 editions published in 1986 in English and held by 17 WorldCat member libraries worldwide
6 editions published in 1986 in English and held by 17 WorldCat member libraries worldwide
An interleaving model for real time by
T. A Henzinger(
Book
)
6 editions published in 1990 in English and held by 16 WorldCat member libraries worldwide
The interleaving model is both adequate and sufficiently abstract to allow for the practical specification and verification of many properties of concurrent systems. We incorporate real time into this model by defining the abstract notion of a realtime transition system as a conservative extension of traditional transition systems: qualitative fairness requirements are replaced (and superseded) by quantitative lowerbound and upperbound realtime requirements for transitions. We present proof rules to establish lower and upper realtime bounds for response properties of realtime transition systems. This proof system can be used to verify boundedinvariance and boundedresponse properties, such as timely terrnination of sharedvariables multiprocess systems, whose semantics is defined in terms of realtime transition systems
6 editions published in 1990 in English and held by 16 WorldCat member libraries worldwide
The interleaving model is both adequate and sufficiently abstract to allow for the practical specification and verification of many properties of concurrent systems. We incorporate real time into this model by defining the abstract notion of a realtime transition system as a conservative extension of traditional transition systems: qualitative fairness requirements are replaced (and superseded) by quantitative lowerbound and upperbound realtime requirements for transitions. We present proof rules to establish lower and upper realtime bounds for response properties of realtime transition systems. This proof system can be used to verify boundedinvariance and boundedresponse properties, such as timely terrnination of sharedvariables multiprocess systems, whose semantics is defined in terms of realtime transition systems
Fundamentals of deductive program synthesis by
Zohar Manna(
Book
)
5 editions published in 1992 in English and held by 15 WorldCat member libraries worldwide
Abstract: "An informal tutorial is presented for program synthesis, with an emphasis on deductive methods. According to this approach, to construct a program meeting a given specification, we prove the existence of an object meeting the specified conditions. The proof is restricted to be sufficiently constructive, in the sense that, in establishing the existence of the desired output, the proof is forced to indicate a computational method for finding it. That method becomes the basis for a program that can be extracted from the proof. The exposition is based on the deductivetableau system, a theoremproving framework particularly suitable for program synthesis
5 editions published in 1992 in English and held by 15 WorldCat member libraries worldwide
Abstract: "An informal tutorial is presented for program synthesis, with an emphasis on deductive methods. According to this approach, to construct a program meeting a given specification, we prove the existence of an object meeting the specified conditions. The proof is restricted to be sufficiently constructive, in the sense that, in establishing the existence of the desired output, the proof is forced to indicate a computational method for finding it. That method becomes the basis for a program that can be extracted from the proof. The exposition is based on the deductivetableau system, a theoremproving framework particularly suitable for program synthesis
TABLOG : the deductivetableau programming language by
Yonathan Malachi(
Book
)
10 editions published between 1984 and 1988 in English and held by 15 WorldCat member libraries worldwide
Our research concentrated on the following topics: The DeductiveTableau System, The TABLOG language and its implementation, A Resolution Approach to Temporal Proofs, Temporal Logic Programming, Logic Programming Semantics: Techniques and Applications. Keywords: Programming language. (sdw/jes)
10 editions published between 1984 and 1988 in English and held by 15 WorldCat member libraries worldwide
Our research concentrated on the following topics: The DeductiveTableau System, The TABLOG language and its implementation, A Resolution Approach to Temporal Proofs, Temporal Logic Programming, Logic Programming Semantics: Techniques and Applications. Keywords: Programming language. (sdw/jes)
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Pnueli, Amir 19412009
 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 Editor
 Society for Industrial and Applied Mathematics
Useful Links
Associated Subjects
Artificial intelligence Automatic programming (Computer science) Automatic theorem proving Baskett, Forest Computer architecture Computer logic Computer multitasking Computer programming Computer programs 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 Knuth, Donald Ervin, Lang, Serge, Lederberg, Joshua Lenat, Douglas B LISP (Computer program language) Logic Logic, Symbolic and mathematical Logic design Machine theory Manna, Zohar Michie, Donald Moravec, Hans P Parallel processing (Electronic computers) Planning Programming languages (Electronic computers)Syntax Proof theory Realtime data processing Sato, Masahiko, Sloman, Aaron Software engineering Stanford University.Computer Science Department TABLOG (Computer program language) Tense (Logic) Universities and collegesFaculty Verification (Logic)
Alternative Names
Manna, Z.
Manna, Z. (Zohar)
Mannāʿ, Zuhar 1939
Zohar Manna
Zohar Manna Amerikaans hoogleraar
Zohar Manna amerikansk ingeniør
Zohar Manna amerikansk ingenjör
Zohar Manna informaticien américain
Zohar Manna israelischUSamerikanischer Informatiker
Зохар Манна
Зохар Манна израильскоамериканский учёный в области информатики
זוהר מנה
조하르 만나
マンナ, ゾーハ
Languages
Covers