Open Access
Logics of Programs.
Dexter Kozen,Jerzy Tiuryn +1 more
- pp 789-840
Reads0
Chats0
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
Proceedings ArticleDOI
Graphical and formal knowledge specification with KARL
TL;DR: A KARL-specification can be used as a means for communication between expert and knowledge engineer as well as an intermediate representation, closing the conceptual gap between an informal specification and an implementation of a KBS.
Book ChapterDOI
Change management for heterogeneous development graphs
TL;DR: Pre-signatures and pre-signature morphisms are introduced, which allow us to build up signatures in an incremental and parametric way, and the idea of stringent locality of definitions is pushed forward.
Book ChapterDOI
Bounded Model Checking for Propositional Projection Temporal Logic
TL;DR: A bounded model checking approach for propositional projection temporal logic (PPTL) is presented and experience shows that BMC approach for PPTL proposed in the paper is useful and feasible.
Book ChapterDOI
On the expressive power of QLTL
TL;DR: The quantifier hierarchy of Q(U) and Q(F), and it is shown that one alternation of existential and universal quantifiers is necessary and sufficient to express the whole class of ω-regular languages.
Book ChapterDOI
From logic to theoretical computer science: an update
TL;DR: In October 1997, whilst touching up this text, exactly 50 years had past since I was accepted for graduate studies under P.S. Novikov, and started to study and do research in logic and computability, which developed into research in Theoretical Computer Science (TCS).
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.