We 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...
The growing complexity and diversity of models used for engineering dependable systems implies that ...
In abstract interpretation-based static analysis, approximation is encoded by abstract domains. They...
AbstractWe consider the abstract command language of Dunne, and his account of general correctness. ...
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...
We use the theorem prover Isabelle to formalise and machine-check results of the theory of generalis...
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...
Abstract. Partial, total and general correctness and further models of sequential computations diffe...
We extend Hoares logic by allowing quantifiers and other logical connectives to be used on the level...
A correctness proof is a formal mathematical argument that an algorithm meets its specification, whi...
We provide a sound and relatively complete axiom system for partial correctness assertions in an Alg...
Hoare Logic has a long tradition in formal verification and has been continuously developed and used...
AbstractWe provide a sound and relatively complete axiom system for partial correctness assertions i...
The growing complexity and diversity of models used for engineering dependable systems implies that ...
In abstract interpretation-based static analysis, approximation is encoded by abstract domains. They...
AbstractWe consider the abstract command language of Dunne, and his account of general correctness. ...
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...
We use the theorem prover Isabelle to formalise and machine-check results of the theory of generalis...
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...
Abstract. Partial, total and general correctness and further models of sequential computations diffe...
We extend Hoares logic by allowing quantifiers and other logical connectives to be used on the level...
A correctness proof is a formal mathematical argument that an algorithm meets its specification, whi...
We provide a sound and relatively complete axiom system for partial correctness assertions in an Alg...
Hoare Logic has a long tradition in formal verification and has been continuously developed and used...
AbstractWe provide a sound and relatively complete axiom system for partial correctness assertions i...
The growing complexity and diversity of models used for engineering dependable systems implies that ...
In abstract interpretation-based static analysis, approximation is encoded by abstract domains. They...
DOI
Add to ORKG