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
Phylogenetic Analysis Using an SMV Tool
TL;DR: Three pillars are found in this approach: modeling evolution dynamics as transition systems; specifying phylogenetic properties using temporal logic formulae; and verifying the former by means of automated computer tools.
Book ChapterDOI
1-Bounded TWA Cannot Be Determinized
TL;DR: A weaker model, 1-TWA, of tree walking automata that can make only one pass through a tree is considered and it is shown that deterministic 1- TWA are weaker than 1-Deterministic TWA.
Ontology-based Description and Reasoning for Component-based Development on the Web
TL;DR: This work proposes to base this endeavour on ontology technology, an integral element of the Semantic Web, that provides a rich reasoning framework for behavioural aspects of Web services or, indeed, components on the Web.
Book ChapterDOI
From Löwenheim to PSL and SVA
TL;DR: This paper attempts to trace the tangled threads of the transformation of the mathematical machinery of automata on infinite words, introduced in the early 1960s for second-order logic, into effective algorithms for model-checking tools.
Journal ArticleDOI
Clausal Tableaux for Hybrid PDL
Mark Kaminski,Gert Smolka +1 more
TL;DR: This work presents the first tableau-based decision procedure for PDL with nominals based on a prefix-free clausal tableau system designed as a basis for gracefully degrading reasoners and pays off in transparent correctness proofs.
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.