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
Dealing with time in content language expressions
TL;DR: This paper extends a CTL*-like temporal language with two very expressive interval operators, and integrates it with a FIPA-compatible representation of dates, and shows that the resulting language allows agents to express a rich assortment of temporal constraints in a very natural way.
Book ChapterDOI
Synchronized Product of Linear Bounded Machines
Teodor Knapik,Étienne Payet +1 more
TL;DR: It is shown that this class of graphs associated to linear bounded machines is closed, up to observational equivalence, under synchronized product, and the first-order theory of these graphs is investegated and shown to be undecidable.
Book ChapterDOI
Automatic test case generation with region-related coverage annotations for real-time systems
Geng-Dian Huang,Farn Wang +1 more
TL;DR: This paper investigates how to use symbolic techniques to automatically generate test cases for real-time systems and has implemented the ideas with BDD-like data-structures which could lead to performance advantage for testing complex embedded systems.
Dissertation
Games for Modal and Temporal Logics
TL;DR: This work defines simple model checking games for Propositional Dynamic Logic, PDL, and introduces the notion of a focus game, which is to equip players with a tool that highlights a particular formula in PDL.
Book ChapterDOI
An integrated approach to P systems formal verification
TL;DR: This paper presents a method to formally verify P system specifications by first identifying invariants and then checking them, using the NuSMV model checker, against a Kripke structure representation.
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.