Open Access
Logics of Programs.
Dexter Kozen,Jerzy Tiuryn +1 more
- pp 789-840
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
Graded-CTL: Satisfiability and Symbolic Model Checking
TL;DR: This paper gives a simple algorithm to decide this logic, and it is proved that the satisfiability problem is ExpTime -complete when the constants of the quantifiers are represented in unary, and proposes symbolic algorithms to solve the model checking problem.
Proceedings ArticleDOI
Control of nondeterminism in testing distributed multithreaded programs
TL;DR: The framework of the authors' automated test control toolkit is introduced that can help users to realize some particular execution paths desired, and allows us to develop more efficient test tools based on some unique code extension for different test scenarios.
Book ChapterDOI
A Technique for Detection of Bots Which Are Using Polymorphic Code
TL;DR: A new sensor for polymorphic code detection within antivirus agent of multi-agent system was developed and performs provocative actions against probably infected file, restarts of the suspicious file for probably modified code detection, based on the principles of known levels of polymorphism.
Journal ArticleDOI
A conceptual architecture for semantic web services development and deployment
TL;DR: This work presents a conceptual architecture for ontology-based web service development and deployment and shows how ontologies can integrate models, languages, infrastructure, and activities within this architecture to support reuse and composition of semantic web services.
Book ChapterDOI
Formalization and automated verification of RESTful behavior
Uri Klein,Kedar S. Namjoshi +1 more
TL;DR: It is shown that the constraints of REST and of RESTful HTTP can be precisely formulated within temporal logic, which leads to methods for model checking and run-time verification of RESTy behavior.
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.