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
A Conceptual Framework for Semantic Web Services Development and Deployment
TL;DR: In this paper, a conceptual framework for ontology-based Web service development and deployment is presented, where ontologies can integrate models, languages, infrastructure, and activities within this framework to support reuse and composition of semantic Web services.
Observations on Co
TL;DR: In this paper, an analytic theory of a class of obviousness judgments of this type is presented, which can be used to construct integrated theories of linguistics, knowledge representation, and inference.
SAVCBS 2003: Specification and Verification of Component-Based Systems
TL;DR: This paper presents a meta-modelling framework called Ontology-based Description and Reasoning for Component-based Development on the Web that automates the very labor-intensive and therefore time-heavy and expensive process of designing and testing software components.
Book ChapterDOI
Synthesizing Masking Fault-Tolerant Systems from Deontic Specifications
TL;DR: A combination of an extension of a synthesis algorithm for CTL to cope with dCTL specifications, with simulation algorithms, is defined in order to synthesize masking fault-tolerant implementations.
Journal ArticleDOI
On the expressive power of finitely typed and universally polymorphic recursive procedures
TL;DR: The well-known programming language ML is essentially FL, augmented with the polymorphic let-in constructor, and it is shown that ML computes the same class of functions as FL as a consequence.
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.