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
Book ChapterDOI
Idel Stream Algebra
TL;DR: A special way of characterising behaviours through sets of relevant approximations is introduced and a number of distributivity and monotonicity laws for ide and related operators are proved.
Book ChapterDOI
Exact flow analysis by higher-order model checking
TL;DR: It is shown that, unlike most of the control flow analyses like k -CFA, it is exact for simply-typed (λ )-calculus with recursion and finite base types, and that it is indeed runnable in practice, at least for small programs.
Book ChapterDOI
Bounded Model Checking with Description Logic Reasoning
TL;DR: It is shown how Description Logic can serve as a natural setting for representing and solving a BMC problem, and formulation of a bounded model checking problem as a consistency problem in the DL dialect $\cal{ALCI}$.
Book ChapterDOI
On conspiracies and hyperfairness in distributed computing
TL;DR: It is argued that hyperfairness is a useful tool for understanding some impossibility results, in particular results involving crash-tolerance, and it is shown that a large subclass of hyper Fairness can be implemented through partial synchrony and randomization.
BookDOI
Fundamentals of Computation Theory
Gabriel Ciobanu,Gheorghe Paun +1 more
TL;DR: First nontrivial, in fact quadratic, randomized lower bounds on the problems like Knapsack and Bounded Integer Programming are derived.
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.