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
Ontologies for the semantic web in CASL
TL;DR: A sublanguage of Casl is described, called textscCasl-DL, that corresponds to the Web Ontology Language (OWL) being used for the semantic web, and can thus benefit from Casl's strong typing discipline and powerful structuring concepts.
Problem-Solving Methods: Making Assumptions for Efficienty Reasons
TL;DR: This paper presents the following view on problem-solving methods for knowledge-based systems: Problem-s solving methods describe an efficient reasoning strategy to achieve a goal by introducing assumptions about the available domain knowledge and the required functionality.
Journal ArticleDOI
A dynamic logic for acting, sensing, and planning
Luca Spalazzi,Paolo Traverso +1 more
TL;DR: This paper is a first attempt towards a theory for reactive planning systems, i.e. systems able to plan and control execution of plans in a partially known and unpredictable environment and proposes a formal theory based on these requirements.
Book ChapterDOI
Identification and counter abstraction for full virtual symmetry
TL;DR: This paper studies symmetry from the point of view of abstraction, which allows for an efficient procedure for identifying full virtual symmetry and explores techniques for combining virtual symmetry with symbolic model-checking and report on experiments that illustrate the feasibility of this approach.
Book ChapterDOI
Quantified CTL: expressiveness and model checking
TL;DR: The expressiveness of CTL with quantification over atomic propositions is studied and the complexity of its model-checking problem is characterized, depending on the number of nested propositional quantifiers.
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.