AbstractWe consider the abstract command language of Dunne, and his account of general correctness. We provide an operational interpretation of his abstract commands, and use the automated theorem proving system Isabelle to prove that this operational interpretation leads to Dunne's semantics. We consider the difficulties in precisely formalising some formulae found in the literature
AbstractWe provide a sound and relatively complete axiom system for partial correctness assertions i...
AbstractWe show that termination is a first-order notion if approached via Nonstandard Logics of Pro...
This thesis presents a formal apparatus which is adequate both to express the termination and correc...
AbstractWe consider the abstract command language of Dunne, and his account of general correctness. ...
We consider the abstract command language of Dunne, and his account of general correctness. We provi...
AbstractTotal correctness and general correctness are examined, and the latter is promoted as the mo...
Abstract. We augment B's existing total-correctness semantics of weak-est precondition (wp) wit...
General correctness, which subsumes partial and total correctness, is defined for both weakest prec...
We introduce a calculus for reasoning about programs in total correctness which blends UTP designs w...
AbstractA programming system is a language made from a fixed class of data abstractions and a select...
International audiencePartial correctness is perhaps the most important functional property of algo-...
Abstract. Partial, total and general correctness and further models of sequential computations diffe...
AbstractThis paper provides the syntax and semantics for a systematic approach to the problem of ana...
AbstractFor an arbitrary programming language with nondeterminism to be implementable, the existence...
We advocate a declarative approach to proving properties of logic programs. Total correctness can be...
AbstractWe provide a sound and relatively complete axiom system for partial correctness assertions i...
AbstractWe show that termination is a first-order notion if approached via Nonstandard Logics of Pro...
This thesis presents a formal apparatus which is adequate both to express the termination and correc...
AbstractWe consider the abstract command language of Dunne, and his account of general correctness. ...
We consider the abstract command language of Dunne, and his account of general correctness. We provi...
AbstractTotal correctness and general correctness are examined, and the latter is promoted as the mo...
Abstract. We augment B's existing total-correctness semantics of weak-est precondition (wp) wit...
General correctness, which subsumes partial and total correctness, is defined for both weakest prec...
We introduce a calculus for reasoning about programs in total correctness which blends UTP designs w...
AbstractA programming system is a language made from a fixed class of data abstractions and a select...
International audiencePartial correctness is perhaps the most important functional property of algo-...
Abstract. Partial, total and general correctness and further models of sequential computations diffe...
AbstractThis paper provides the syntax and semantics for a systematic approach to the problem of ana...
AbstractFor an arbitrary programming language with nondeterminism to be implementable, the existence...
We advocate a declarative approach to proving properties of logic programs. Total correctness can be...
AbstractWe provide a sound and relatively complete axiom system for partial correctness assertions i...
AbstractWe show that termination is a first-order notion if approached via Nonstandard Logics of Pro...
This thesis presents a formal apparatus which is adequate both to express the termination and correc...
DOI
Add to ORKG