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
Correctness and worst-case optimality of Pratt-style decision procedures for modal and hybrid logics
TL;DR: Pratt's worst-case optimal decision procedure for PDL is extended to a richer logic with nominals, difference modalities, and inverse actions and it is proved that the correctness of the decision procedure is easily obtained.
Book ChapterDOI
History-dependent Petri nets
TL;DR: It is shown that some classes of history-dependent nets can be automatically converted to classical Petri nets for analysis purposes and some classes are characterized by the form of the guards and sometimes the additional requirement that the underlying Classical Petri net is either bounded or has finite synchronization distances.
Proceedings ArticleDOI
A Visualization Framework for Web Service Discovery and Selection Based on Quality of Service
TL;DR: A practical visualization framework in putting service discovery and selection process based on quality of service (QoS) attributes into a visual context is presented and serves as a foundation for designing the novel GUIs for different users.
Proceedings ArticleDOI
A temporal logic for input output symbolic transition systems
TL;DR: A temporal logic called /spl Fscr/ is presented whose interpretation is over input output symbolic transition systems (IOSTS) and three basic properties are established: adequacy and preservation of properties along synchronized product and IOSTS refinement.
Book ChapterDOI
A complete and decidable axiomatisation for deontic interpreted systems
Alessio Lomuscio,Bożena Woźna +1 more
TL;DR: This work solves the problem left open in [5] by providing a complete axiomatisation of deontic interpreted systems on a language that includes full CTL as well as the Ki, Oi and ${\mathcal{\widehat{\rm {K}}}}^j_i$ modalities.
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.