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
Research on Collaborative Processes in Non Hierarchical Manufacturing Networks
Beatriz Andres,Raul Poler +1 more
TL;DR: A set of relevant collaborative processes are identified in the literature and analysed considering their specific application in non-hierarchical manufacturing networks (NHN) and would serve as a tool to improve the enterprises’ performance and, consequently, the network performance.
Book ChapterDOI
Knowledge as a window into distributed coordination
TL;DR: Reasoning about when elements of the system do or do not know relevant facts is a central aspect of the design and construction of distributed systems and distributed protocols.
Posted Content
Logic-Based Specification Languages for Intelligent Software Agents
TL;DR: In this paper, a detailed survey of six logic-based executable agent specification languages that have been chosen for their potential to be integrated in our ARPEGGIO project, an open framework for specifying and prototyping a MAS.
Dissertation
Verification in the Hierarchical Development of Reactive Systems
TL;DR: This work proposes a method that supports syntactic action refinement (in the process algebra TCSP and the Modal Mu-Calculus) and allows to automatically obtain (a priori) correct reactive systems by hierarchically adding details to the according specifications.
Journal ArticleDOI
Towardsaframeworkfor Classification and Recommendation of Semantic Web Service Composition Approaches
S. Kumar,R.B. Mishra +1 more
TL;DR: This framework presents a novel classification of various SWS composition approaches and provides recommendations to the user regarding the composition approach to use under given condition parameters and can be of immense use for the selection of appropriate composition approach during the development of semantic web based 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.