Search
Now showing items 1-8 of 8
Semantical Considerations on Floyd-Hoare Logic
(1976-09)
This paper deals with logics of programs. The objective is to formalize a notion of program description and to give both plausible (semantic) and effective (syntactic) criteria for the notion of truth of a description. ...
Nondeterminism in Logics of Programs
(1978-02)
We investigate the principles underlying reasoning about nondeterministic programs, and present a logic to support this kind of reasoning. Our logic, an extension of dynamic logic ([22] and [12]), subsumes most existing ...
A Near-optimal Method for Reasoning About Action
(1978-09)
We give an algorithm for "before-after" reasoning about action. The algorithm decides satisfiability and validity of formulae of propositional dynamic logic, a recently developed logic of change of state that subsumes the ...
Six Lectures on Dynamic Logic
(1978-12)
The distinction made there between static and dynamic logic has a very simple character, yet can play a central and unifying role in logic as a vantage point from which one can compare propositional calculus, predicate ...
Dynamic Algebras: Examples, Constructions, Application
(1979-07)
Dynamic algebras combine the classes of Boolean (B V ' 0) and regular (R U ; *) algebras into a single finitely axiomatized variety (B R ♦) resembling an R-module with "scalar" multiplication ♦. The basis result is that * ...
Computability and Completeness in Logics of Programs
(1978-02)
Dynamic logic is a generalization of first order logic in which quantifiers of the form "for all X…" are replaced by phrases of the form "after executing program α…". This logic subsumes most existing first-order logic of ...
Applications of Modal Logic to Programming
(1978-12)
The modal logician's notion of possible world and the computer scientist's notion of state of a machine provide a point of commonality which can form the foundation of a logic of action. Extending ordinary modal logic with ...
The Mutual Exclusion Problem for Unreliable Processes
(1977-04)
Consider n processes operating asynchronously in parallel, each of which maintains a single "public" variable which can be read (but not written) by the other processes. We show that the processes can synchronize their ...