AbstractA classical while-program normal-form theorem is derived in demonic refinement algebra. In contrast to Kozen’s partial-correctness proof of the theorem in Kleene algebra with tests, the derivation in demonic refinement algebra provides a proof that the theorem holds in total correctness. A normal form for action systems is also discussed
A process algebra is given for specifying delay-insensitive processes. We show in two steps that exp...
A process algebra is given for specifying delay-insensitive processes. We show in two steps that exp...
1983) by adding demonic nondeterminism. For practical applications (e.g. combining loop invariants w...
A classical while-program normal-form theorem is derived in demonic refinement algebra. In contrast ...
AbstractA classical while-program normal-form theorem is derived in demonic refinement algebra. In c...
We introduce a calculus for reasoning about programs in total correctness which blends UTP designs w...
Refinement algebras are abstract algebras for reasoning about programs in a total correctness framew...
In relational semantics, the input-output semantics of a program is a relation on its set of states....
In relational semantics, the input-output semantics of a program is a relation on its set of states....
AbstractRefinement algebras are abstract algebras for reasoning about programs in a total correctnes...
AbstractIn relational semantics, the input-output semantics of a program is a relation on its set of...
Refinement algebras are axiomatisations intended for reasoning about programs in a total correctness...
Back and von Wright have developed algebraic laws for reasoning about loops in a total correctness f...
DI-algebra is a process algebra for delay-insensitive processes. Like in most process algebras, a no...
We formalise Kleene algebra with tests (KAT) and demonic refine-ment algebra (DRA) in Isabelle/HOL. ...
A process algebra is given for specifying delay-insensitive processes. We show in two steps that exp...
A process algebra is given for specifying delay-insensitive processes. We show in two steps that exp...
1983) by adding demonic nondeterminism. For practical applications (e.g. combining loop invariants w...
A classical while-program normal-form theorem is derived in demonic refinement algebra. In contrast ...
AbstractA classical while-program normal-form theorem is derived in demonic refinement algebra. In c...
We introduce a calculus for reasoning about programs in total correctness which blends UTP designs w...
Refinement algebras are abstract algebras for reasoning about programs in a total correctness framew...
In relational semantics, the input-output semantics of a program is a relation on its set of states....
In relational semantics, the input-output semantics of a program is a relation on its set of states....
AbstractRefinement algebras are abstract algebras for reasoning about programs in a total correctnes...
AbstractIn relational semantics, the input-output semantics of a program is a relation on its set of...
Refinement algebras are axiomatisations intended for reasoning about programs in a total correctness...
Back and von Wright have developed algebraic laws for reasoning about loops in a total correctness f...
DI-algebra is a process algebra for delay-insensitive processes. Like in most process algebras, a no...
We formalise Kleene algebra with tests (KAT) and demonic refine-ment algebra (DRA) in Isabelle/HOL. ...
A process algebra is given for specifying delay-insensitive processes. We show in two steps that exp...
A process algebra is given for specifying delay-insensitive processes. We show in two steps that exp...
1983) by adding demonic nondeterminism. For practical applications (e.g. combining loop invariants w...
DOI
Add to ORKG