We make explicit a connection between the “unwind property” and first-order logics of programs. Using known results on the unwind property, we can then quickly compare various logics of programs. In Section 1, we give a sample of these comparative results, which are already known but established differently in this paper. In Sections 2 and 3, given an arbitrary deterministic regular program S (with or without parameterless recursive calls), we show how to construct a first-order structure where S will unwind. Based on this construction, we then prove that the logic of regular programs (with or without parameterless recursive calls) is more expressive than the logic of deterministic regular programs (with or without parameterless recursive c...
AbstractThe borderline between decidable and undecidable propositional dynamic Logic (PDL) is sought...
We show that strict deterministic propositional dynamic logic with intersection is highly undecidabl...
The present author as well as Andréka's group has experienced, while writing program- verifying prog...
We make explicit a connection between the “unwind property” and first-order logics of programs. Usin...
In (A. P. Stolboushkin and M.A. Taitslin, Inform. Contr. 57 (1983), 48–55) Taitslin introduced a str...
AbstractWe consider a restricted propositional dynamic logic, Strict Deterministic Propositional Dyn...
The ability of flow-chart programs to define relations and functions nondefinable by open first-orde...
There is a language L and structures A1 and A2 for L such that, for each closed formula F of determi...
AbstractThis paper gives an account of results which answer some questions from Harel (1978, 1979), ...
AbstractA simplified proof of the result stating that deterministic dynamic logic is strictly weaker...
AbstractThe simple set WL of deterministic while programs is defined and a number of known methods f...
AbstractSeveral different first-order formal logics of programs—Algorithmic Logic, Dynamic Logic, an...
Abstract‘Looping’ of nondeterministic while-programs is shown to be expressible in Regular First Ord...
In this paper we study the expressive power of nondeterminism in dynamic logic. In particular, we sh...
Non-regular program correctness properties play an important role in the specification of unbounded ...
AbstractThe borderline between decidable and undecidable propositional dynamic Logic (PDL) is sought...
We show that strict deterministic propositional dynamic logic with intersection is highly undecidabl...
The present author as well as Andréka's group has experienced, while writing program- verifying prog...
We make explicit a connection between the “unwind property” and first-order logics of programs. Usin...
In (A. P. Stolboushkin and M.A. Taitslin, Inform. Contr. 57 (1983), 48–55) Taitslin introduced a str...
AbstractWe consider a restricted propositional dynamic logic, Strict Deterministic Propositional Dyn...
The ability of flow-chart programs to define relations and functions nondefinable by open first-orde...
There is a language L and structures A1 and A2 for L such that, for each closed formula F of determi...
AbstractThis paper gives an account of results which answer some questions from Harel (1978, 1979), ...
AbstractA simplified proof of the result stating that deterministic dynamic logic is strictly weaker...
AbstractThe simple set WL of deterministic while programs is defined and a number of known methods f...
AbstractSeveral different first-order formal logics of programs—Algorithmic Logic, Dynamic Logic, an...
Abstract‘Looping’ of nondeterministic while-programs is shown to be expressible in Regular First Ord...
In this paper we study the expressive power of nondeterminism in dynamic logic. In particular, we sh...
Non-regular program correctness properties play an important role in the specification of unbounded ...
AbstractThe borderline between decidable and undecidable propositional dynamic Logic (PDL) is sought...
We show that strict deterministic propositional dynamic logic with intersection is highly undecidabl...
The present author as well as Andréka's group has experienced, while writing program- verifying prog...