AbstractThe main result of this article is that every demonic refinement algebra with enabledness and termination is isomorphic to an algebra of ordered pairs of elements of a Kleene algebra with domain and with a divergence operator satisfying a mild condition. Divergence is an operator producing a test interpreted as the set of states from which nontermination may occur. An example of a KAD where a divergence operator cannot be defined is given. In addition, it is shown that every demonic refinement algebra with enabledness is also a demonic refinement algebra with termination
AbstractKleene algebra with tests (KAT) has proved to be useful for reasoning about programs in a pa...
Refinement algebras are axiomatisations intended for reasoning about programs in a total correctness...
AbstractTwo notions of nontermination are studied and compared in the setting of idempotent semiring...
AbstractThe main result of this article is that every demonic refinement algebra with enabledness an...
Weak omega algebra and demonic refinement algebra are two ways of describing systems with finite and...
Weak omega algebra and demonic refinement algebra are two ways of describing systems with finite and...
We present the complete lattice of demonic languages and its interpretation in refinement proofs. In...
Refinement algebras are abstract algebras for reasoning about programs in a total correctness framew...
AbstractRefinement algebras are abstract algebras for reasoning about programs in a total correctnes...
Nous rappelons d’abord le concept d’algèbre de Kleene avec domaine (AKD). Puis, nous expliquons comm...
AbstractKleene modules and modal Kleene algebras are applied to automatically verify refinement laws...
We formalise Kleene algebra with tests (KAT) and demonic refine-ment algebra (DRA) in Isabelle/HOL. ...
Five algebraic notions of termination are formalised, analysed and compared: well-foundedness or Noe...
A generalization of Kleene Algebras (structures with +·*, 0 and 1 operators) is considered to take i...
In relational semantics, the input-output semantics of a program is a relation on its set of states....
AbstractKleene algebra with tests (KAT) has proved to be useful for reasoning about programs in a pa...
Refinement algebras are axiomatisations intended for reasoning about programs in a total correctness...
AbstractTwo notions of nontermination are studied and compared in the setting of idempotent semiring...
AbstractThe main result of this article is that every demonic refinement algebra with enabledness an...
Weak omega algebra and demonic refinement algebra are two ways of describing systems with finite and...
Weak omega algebra and demonic refinement algebra are two ways of describing systems with finite and...
We present the complete lattice of demonic languages and its interpretation in refinement proofs. In...
Refinement algebras are abstract algebras for reasoning about programs in a total correctness framew...
AbstractRefinement algebras are abstract algebras for reasoning about programs in a total correctnes...
Nous rappelons d’abord le concept d’algèbre de Kleene avec domaine (AKD). Puis, nous expliquons comm...
AbstractKleene modules and modal Kleene algebras are applied to automatically verify refinement laws...
We formalise Kleene algebra with tests (KAT) and demonic refine-ment algebra (DRA) in Isabelle/HOL. ...
Five algebraic notions of termination are formalised, analysed and compared: well-foundedness or Noe...
A generalization of Kleene Algebras (structures with +·*, 0 and 1 operators) is considered to take i...
In relational semantics, the input-output semantics of a program is a relation on its set of states....
AbstractKleene algebra with tests (KAT) has proved to be useful for reasoning about programs in a pa...
Refinement algebras are axiomatisations intended for reasoning about programs in a total correctness...
AbstractTwo notions of nontermination are studied and compared in the setting of idempotent semiring...