Open Access
Logics of Programs.
Dexter Kozen,Jerzy Tiuryn +1 more
- pp 789-840
TLDR
In this paper, the authors present an introduction to some of the basic issues in the study of program logics and discuss their syntax, semantics, proof theory, and expressiveness.Abstract:
Publisher Summary This chapter presents an introduction to some of the basic issues in the study of program logics. The chapter describes various forms of first-order Dynamic Logic and discusses their syntax, semantics, proof theory, and expressiveness. The chapter discusses the power of auxiliary data structures such as arrays and stacks, and a powerful assignment statement called the nondeterministic assignment. Program logics differ from classical logics in that truth is dynamic rather than static. In classical predicate logic, the truth value of a formula is determined by a valuation of its free variables over some structure. The valuation and the truth value of the formula it induces are regarded as immutable. In program logics, there are explicit syntactic constructs called programs to change the values of variables, thereby changing the truth values of formulas. There are two main approaches to modal logics of programs: (1) the exogenous approach, exemplified by Dynamic Logic and its precursor, the Partial Correctness Assertions Method; and (2) the endogenous approach, exemplified by Temporal Logic and its precursor, the Inductive Assertions Method.read more
Citations
More filters
Book ChapterDOI
Compositional Control Synthesis for Partially Observable Systems
Wouter Kuijper,Jaco van de Pol +1 more
TL;DR: The constraint derivation method works in conjunction with an antichain---based, symbolic algorithm for computing weakest strategies in safety games of imperfect information and allows a reactive controller to be synthesized in an incremental manner.
Book ChapterDOI
Discriminative Model Checking
TL;DR: A model checking algorithm in the style of the standard CTLi¾?decision procedure is proposed, which can be used for comparing between good and bad executions in a system and outside it, providing assistance in locating the design or programming errors.
Book ChapterDOI
On the Krohn-Rhodes cascaded decomposition theorem
TL;DR: A very constructive proof of a variant of the Krohn-Rhodes theorem, where any deterministic automaton is a homomorphic image of a cascade of very simple automata which realize either resets or permutations.
Book ChapterDOI
Semantical considerations on some primitives for agent specification
TL;DR: This work proposes formal definitions for intentions, knowledge, and know-how in a general model of actions and time and is able to prove a success result for agents that is akin to the notion of liveness in traditional computing.
References
More filters
Proceedings ArticleDOI
The temporal logic of programs
TL;DR: A unified approach to program verification is suggested, which applies to both sequential and parallel programs, and the main proof method is that of temporal reasoning in which the time dependence of events is the basic concept.
Book ChapterDOI
Temporal and modal logic
TL;DR: In this article, a multiaxis classification of temporal and modal logic is presented, and the formal syntax and semantics for two representative systems of propositional branching-time temporal logics are described.
Journal ArticleDOI
An axiomatic basis for computer programming
TL;DR: An attempt is made to explore the logical foundations of computer programming by use of techniques which were first applied in the study of geometry and have later been extended to other branches of mathematics.
Journal ArticleDOI
Propositional dynamic logic of regular programs
TL;DR: A formal syntax and semantics for the propositional dynamic logic of regular programs is defined and principal conclusions are that deciding satisfiability of length n formulas requires time d n /log n for some d > 1, and that satisfiability can be decided in nondeterministic time cn for some c.