AbstractAssertional s-rings are introduced to provide an algebraic setting in which the finite and infinite behavior of nondeterministic programs can be expressed and reasoned about. This includes expressing the fair infinite behavior of nondeterministic iterative programs, and reasoning about termination under various fairness assumptions. We also address the question of when the reasoning techniques are semantically complete
AbstractFairness of a program execution, c, is usually expressed such that all objects which are suf...
AbstractWe use the notions of closures and fair chaotic iterations to give a semantics to logic prog...
Hoare and He´s Unifying Theories of Programming take a relational view on semantics. The meaning of ...
AbstractAssertional s-rings are introduced to provide an algebraic setting in which the finite and i...
We introduce a calculus for reasoning about programs in total correctness which blends UTP designs w...
Abstract. Partial, total and general correctness and further models of sequential computations diffe...
AbstractThis paper demonstrates completeness of a termination-rule for iterative programs with stron...
AbstractThis paper examines the joint influence of fairness and asynchrony on the semantic modelling...
AbstractRefinement algebras are abstract algebras for reasoning about programs in a total correctnes...
Refinement algebras are abstract algebras for reasoning about programs in a total correctness framew...
AbstractA successful SLD-derivation from a logic program has as result a positive assertion which is...
AbstractWe show that termination is a first-order notion if approached via Nonstandard Logics of Pro...
AbstractVarious principles of proof have been proposed to reason about fairness. This paper addresse...
Refinement algebras are axiomatisations intended for reasoning about programs in a total correctness...
AbstractWe introduce and discuss a notion of strictly arithmetical completeness related to relative ...
AbstractFairness of a program execution, c, is usually expressed such that all objects which are suf...
AbstractWe use the notions of closures and fair chaotic iterations to give a semantics to logic prog...
Hoare and He´s Unifying Theories of Programming take a relational view on semantics. The meaning of ...
AbstractAssertional s-rings are introduced to provide an algebraic setting in which the finite and i...
We introduce a calculus for reasoning about programs in total correctness which blends UTP designs w...
Abstract. Partial, total and general correctness and further models of sequential computations diffe...
AbstractThis paper demonstrates completeness of a termination-rule for iterative programs with stron...
AbstractThis paper examines the joint influence of fairness and asynchrony on the semantic modelling...
AbstractRefinement algebras are abstract algebras for reasoning about programs in a total correctnes...
Refinement algebras are abstract algebras for reasoning about programs in a total correctness framew...
AbstractA successful SLD-derivation from a logic program has as result a positive assertion which is...
AbstractWe show that termination is a first-order notion if approached via Nonstandard Logics of Pro...
AbstractVarious principles of proof have been proposed to reason about fairness. This paper addresse...
Refinement algebras are axiomatisations intended for reasoning about programs in a total correctness...
AbstractWe introduce and discuss a notion of strictly arithmetical completeness related to relative ...
AbstractFairness of a program execution, c, is usually expressed such that all objects which are suf...
AbstractWe use the notions of closures and fair chaotic iterations to give a semantics to logic prog...
Hoare and He´s Unifying Theories of Programming take a relational view on semantics. The meaning of ...
DOI
Add to ORKG