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
Journal ArticleDOI
Unifying class-based representation formalisms
TL;DR: It is argued that, by virtue of the high expressive power and of the associated reasoning capabilities on both unrestricted and finite models, the proposed logic provides a common core for class-based representation formalisms.
Book ChapterDOI
The ForSpec Temporal Logic: A New Temporal Property-Specification Language
Roy Armoni,Limor Fix,Alon Flaisher,Rob Gerth,Boris Ginsburg,Tomer Kanza,Avner Landver,Sela Mador-Haim,Eli Singerman,Andreas Tiemeyer,Moshe Y. Vardi,Yael Zbar +11 more
TL;DR: The ForSpec Temporal Logic (FTL) is the new temporal property-specification logic of ForSpec, Intel's new formal specification language and includes constructs that enable the user to model multiple clock and reset signals, which is useful in the verification of hardware design.
Journal ArticleDOI
Automatic service composition based on behavioral descriptions
TL;DR: This work is the first attempt to provide a provably correct technique for the automatic synthesis of service composition, in a framework where the behavior of services is explicitly specified.
Proceedings Article
TBox and ABox reasoning in expressive description logics
TL;DR: In this article, the authors present a sound, complete, and terminating (in worstcase EXPTIME) inference procedure that solves the problem of reasoning in a DL system with the following characteristics: it comes equipped with a very expressive language, it allows the most general form of TBox assertions, and it takes into account instance assertions on both concepts and roles in the ABox.
Journal ArticleDOI
Logics for hybrid systems
J. M. Davoren,Anil Nerode +1 more
TL;DR: This paper offers synthetic overview of, and original contributions to, the use of logics and formal methods in the analysis of hybrid systems.
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.