AbstractSeveral different first-order formal logics of programs—Algorithmic Logic, Dynamic Logic, and Logic of Effective Definitions—are compared and shown to be equivalent to a fragment of constructive Lω1ω. When programs are modelled as effective flowcharts, the logics of deterministic and nondeterministic programs are equivalent
Abstract. Nowadays, in many critical situations (such as on-board software), it is mandatory to cert...
AbstractWe show that Test-free Propositional Dynamic Logic (PDL0) is less expressive than Propositio...
We show that strict deterministic propositional dynamic logic with intersection is highly undecidabl...
AbstractSeveral different first-order formal logics of programs—Algorithmic Logic, Dynamic Logic, an...
AbstractWe study the expressive power of various versions of Dynamic Logic and compare them with eac...
AbstractA simplified proof of the result stating that deterministic dynamic logic is strictly weaker...
We make explicit a connection between the “unwind property” and first-order logics of programs. Usin...
Abstract‘Looping’ of nondeterministic while-programs is shown to be expressible in Regular First Ord...
Programs are like constructive proofs of their specifications. This analogy is a precise equivalenc...
AbstractThis paper gives an account of results which answer some questions from Harel (1978, 1979), ...
The present author as well as Andréka's group has experienced, while writing program- verifying prog...
AbstractThe simple set WL of deterministic while programs is defined and a number of known methods f...
AbstractWe prove that the operator ⊥ (“during”) is not expressible in first-order logics of programs...
A programming language is viewed as a language for expressing “instructions” for a computation to be...
AbstractWe consider a restricted propositional dynamic logic, Strict Deterministic Propositional Dyn...
Abstract. Nowadays, in many critical situations (such as on-board software), it is mandatory to cert...
AbstractWe show that Test-free Propositional Dynamic Logic (PDL0) is less expressive than Propositio...
We show that strict deterministic propositional dynamic logic with intersection is highly undecidabl...
AbstractSeveral different first-order formal logics of programs—Algorithmic Logic, Dynamic Logic, an...
AbstractWe study the expressive power of various versions of Dynamic Logic and compare them with eac...
AbstractA simplified proof of the result stating that deterministic dynamic logic is strictly weaker...
We make explicit a connection between the “unwind property” and first-order logics of programs. Usin...
Abstract‘Looping’ of nondeterministic while-programs is shown to be expressible in Regular First Ord...
Programs are like constructive proofs of their specifications. This analogy is a precise equivalenc...
AbstractThis paper gives an account of results which answer some questions from Harel (1978, 1979), ...
The present author as well as Andréka's group has experienced, while writing program- verifying prog...
AbstractThe simple set WL of deterministic while programs is defined and a number of known methods f...
AbstractWe prove that the operator ⊥ (“during”) is not expressible in first-order logics of programs...
A programming language is viewed as a language for expressing “instructions” for a computation to be...
AbstractWe consider a restricted propositional dynamic logic, Strict Deterministic Propositional Dyn...
Abstract. Nowadays, in many critical situations (such as on-board software), it is mandatory to cert...
AbstractWe show that Test-free Propositional Dynamic Logic (PDL0) is less expressive than Propositio...
We show that strict deterministic propositional dynamic logic with intersection is highly undecidabl...
DOI
Add to ORKG