Software quahty is achieved through the apphcatlon of development techniques and the use
of verification procedures throughout the development process Careful consideratmn of …

The purpose of this paper is to show that logic provides a convenient formalism for studying
classical database problems. There are two main parts to the paper, devoted respectively to …

• There are IDEs for KeY, including an Eclipse extension, that make it easy to keep track of
proof obligations in larger projects [Hentschel et al., 2014c].• A stripped down version of …

Abstract Model checking is an automatic technique for verifying finite-state reactive systems,
such as sequential circuit designs and communication protocols. Specifications are …

Publisher Summary This chapter discusses temporal and modal logic. The chapter
describes a multiaxis classification of systems of temporal logic. The chapter describes the …

Among the many approaches to formal reasoning about programs, Dynamic Logic enjoys
the singulax aclv~ ntage of being strongly related to classical logic. Its variants constitute …

The temporal logic of actions (TLA) is a logic for specifying and reasoning about concurrent
systems. Systems and their properties are represented in the same logic, so the assertion …

We introduce a fundamental propositional logical system for describing correctness,
termination and equivalence of programs. We define a formal syntax and semantics for the …

Since a nondeterministic and concurrent program may, in general, communicate repeatedly
with its environment, its meaning cannot be presented naturally as an input/output function …

This book develops a view of logic as a theory of information-driven agency and intelligent
interaction between many agents-with conversation, argumentation and games as guiding …