Overview

Among the many approaches to formal reasoning about programmes, Dynamic Logic enjoys the singular advantage of being strongly related to classical logic. Its variants constitute natural generalizations and extensions of classical formalisms. For example, Propositional Dynamic Logic (PDL) can be described as a blend of three complementary classical ingredients: propositional calculus, modal logic and the algebra of regular events. In First-Order Dynamic Logic (DL), the propositional calculus is replaced by classical first-order predicate calculus. Dynamic Logic is a system of remarkable unity that is theoretically rich as well as of practical value. It can be used for formalizing correctness specifications and proving rigorously that those specifications are met by a particular programme. Other uses include determining the equivalence of programmes, comparing the expressive power of various programming constructs, and synthesizing programmes from specifications. This book provides the first comprehensive introduction to Dynamic Logic. It is divided into three parts. The first part reviews the appropriate fundamental concepts of logic and computability theory and can stand alone as an introduction to these topics. The second part discusses PDL and its variants, and the third part discusses DL and its variants. Examples are provided throughout, and exercises and a short historical section are included at the end of each chapter.

Full Product Details

9780262082891

Table of Contents

Reviews

Author Information

Dexter Kozen is Joseph Newton Pew, Jr., Professor of Engineering in the Computing and Information Science Department at Cornell University. Jerzy Tiuryn is Professor in the Institute of Computer Science at the University of Warsaw.

Tab Content 6

Countries Available