WorldCat Identities

Manna, Zohar

Overview
Works: 158 works in 720 publications in 5 languages and 5,341 library holdings
Roles: Author, Editor, Honoree
Classifications: QA76.6, 001.642
Publication Timeline
.
Most widely held works about Zohar Manna
 
Most widely held works by Zohar Manna
Mathematical theory of computation by Zohar Manna( Book )

32 editions published between 1974 and 2003 in 3 languages and held by 663 WorldCat member libraries worldwide

The logical basis for computer programming by Zohar Manna( Book )

27 editions published between 1984 and 1990 in English and Spanish and held by 544 WorldCat member libraries worldwide

Mathematical logic; Theories with induction
Studies in automatic programming logic by Zohar Manna( Book )

15 editions published in 1977 in English and Italian and held by 325 WorldCat member libraries worldwide

Lectures on the logic of computer programming by Zohar Manna( Book )

22 editions published in 1980 in English and held by 324 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 )

26 editions published between 1991 and 2013 in English and Undetermined and held by 322 WorldCat member libraries worldwide

Reactive systems are computing systems which are interactive, such as real-time 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 self-contained 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 )

19 editions published between 1991 and 2012 in English and German and held by 265 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 one-volume version of The logical basis for computer programming by Zohar Manna( Book )

17 editions published between 1943 and 1993 in English and held by 196 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 held by 190 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
The calculus of computation : decision procedures with applications to verification by Aaron R Bradley( Book )

21 editions published between 2007 and 2010 in English and Undetermined and held by 168 WorldCat member libraries worldwide

Computational logic is a growing field with applications in artificial intelligence, constraint solving, and the design and verification of software and hardware systems. This book introduces computational logic from the foundations of first-order logic to decision procedures for arithmetic, data structures, and combination theories
The logical basis for computer programming by Zohar Manna( Book )

13 editions published between 1985 and 1990 in English and held by 82 WorldCat member libraries worldwide

Software development technologies for reactive, real-time, and hybrid systems by Zohar Manna( Book )

1 edition published in 1997 in English and held by 81 WorldCat member libraries worldwide

Open architectures for formal reasoning and deductive technologies for software development : final report 5/1/91-7/31/94, grant no. NAG2-703( Book )

1 edition published in 1994 in English and held by 75 WorldCat member libraries worldwide

Time for verification : essays in memory of Amir Pnueli by Zohar Manna( Book )

13 editions published in 2010 in English and held by 44 WorldCat member libraries worldwide

The topics covered span the entire breadth of the scientific work of Amir Pnueli, with a focus on the development and the application of formal methods. Also included is the first chapter of the unpublished Volume III of Zohar Manna and Amir Pnueli's work on the verification of reactive systems using temporal logic techniques. --Book Jacket
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 intermittent-assertion 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 well-founded 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
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 machine-oriented deductive-tableau 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 safety-liveness classification of properties. The new classification recognizes the classes of safety, guarantee, persistence, fairness, and hyper-fairness. 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 oll 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
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 real-time transition system as a conservative extension of traditional transition systems: qualitative fairness requirements are replaced (and superseded) by quantitative lower-bound and upper-bound real-time requirements for transitions. We present proof rules to establish lower and upper real-time bounds for response properties of real-time transition systems. This proof system can be used to verify bounded-invariance and bounded-response properties, such as timely terrnination of shared-variables multi-process systems, whose semantics is defined in terms of real-time transition systems
Fundamentals of deductive program synthesis by Zohar Manna( Book )

6 editions published in 1992 in English and held by 16 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 deductive-tableau system, a theorem-proving framework particularly suitable for program synthesis
TABLOG : the deductive-tableau programming language by Yonathan Malachi( Book )

10 editions published between 1984 and 1988 in English and Undetermined and held by 15 WorldCat member libraries worldwide

Our research concentrated on the following topics: The Deductive-Tableau 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)
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.64 (from 0.48 for The calcul ... to 1.00 for Papers, 19 ...)

The logical basis for computer programming
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 israelisch-US-amerikanischer Informatiker

Зохар Манна

זוהר מנה

조하르 만나

マンナ, ゾーハ

Languages
Covers
The logical basis for computer programmingLectures on the logic of computer programmingThe temporal logic of reactive and concurrent systemsTemporal verification of reactive systems : safetyThe deductive foundations of computer programming : a one-volume version of The logical basis for computer programmingVerification : theory and practice : essays dedicated to Zohar Manna on the occasion of his 64th birthdayThe calculus of computation : decision procedures with applications to verificationThe logical basis for computer programmingTime for verification : essays in memory of Amir Pnueli