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
Weighted versus Probabilistic Logics
Benedikt Bollig,Paul Gastin +1 more
TL;DR: This paper identifies weighted versions of MSO and CTL that generalize the classical logics and even other quantitative extensions such as probabilistic CTL and establishes expressiveness results on the authors' logics giving translations from weighted and probabilistically CTL into weighted MSO.
Book ChapterDOI
A Heterogeneous Approach to UML Semantics
TL;DR: A heterogeneous approach to the semantics of UML is proposed where each diagram type can be described in its "natural" semantics, and the relations between diagram types are expressed by appropriate translations.
Journal Article
Unrestricted and finite model reasoning in class-based representation formalisms
TL;DR: Thesis and Main Results: Representing Structured Information 1.vii 1.1 Semantic Networks and Frame Based Systems 2.2 Description Logics 2.1 Syntax and Semantics of L-Languages .
Book ChapterDOI
Abstraction for falsification
TL;DR: A framework for abstraction for verification that is indeed stronger (than other abstraction frameworks designed for verification), and can be made even stronger by parameterizing its transitions by predicates, and described how it can be used for falsification of branching-time and linear-time temporal properties.
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.