Product Description: 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...read more

Product Description: This book is about the verification of reactive systems. A reactive system is a system that maintains an ongoing interaction with its environment, as opposed to computing some final value on termination. The family of reactive systems includes many classes of programs whose correct and reliable construction is con­ sidered to be particularly challenging, including concurrent programs, embedded and process control programs, and operating systems...read more

Product Description: This volume is dedicated to the memory of  the 1996 Turing Award winner Amir Pnueli. It contains articles written by leading scientists that span the breadth of Pnueli’s scientific work, with a focus on the development and the application of formal methods.

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.

Product Description: With the objective of making into a science the art of verifying computer programs (debugging), the author addresses both practical and theoretical aspects of the process. A classic of sequential program verification, this volume has been translated into almost a dozen other languages and is much in demand among graduate and advanced undergraduate computer science students...read more

(view table of contents)

Product Description: The Logical Basis for Computer Programming, Vol. 1: Deductive Reasoning

Product Description: 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...read more