Add to ORKGInvariants allow a rigorous treatment of types as sets in the refinement calculus, a method for developing imperative programs. The interaction of procedures and invariants is explored, resulting in a practical formalisation of existing programming practice
High-level language program compilation strategies can be proven correct by modelling the process as...
High-level language program compilation strategies can be proven correct by modelling the process as...
AbstractThe real-time refinement calculus is a formal method for the systematic derivation of real-t...
AbstractA rigorous treatment of types as sets is given for the refinement calculus, a method of impe...
The refinement calculus provides a framework for the stepwise development of imperative programs fro...
The refinement calculus is a formal technique for the development of programs which are provably cor...
Morgan's approach to program development is a refinement calculus: using this method, programs are d...
The invariant based programming is a technique of constructing correct programs by first identifying...
The logic programming refinement calculus is a method for transforming specifications to executable ...
Abstract. This article shows a correspondence between abstract inter-pretation of imperative program...
The refinement calculus and type theory are both frameworks that support the specification and verif...
Existing refinement calculi provide frameworks for the stepwise development of imperative programs f...
AbstractRefine is a tool that supports the application of Morgan's refinement calculus. It was desig...
Program algebras abstract the essential properties of programming languages in the form of algebraic...
AbstractA uniform treatment of specifications, programs, and programming is presented. The treatment...
High-level language program compilation strategies can be proven correct by modelling the process as...
High-level language program compilation strategies can be proven correct by modelling the process as...
AbstractThe real-time refinement calculus is a formal method for the systematic derivation of real-t...
AbstractA rigorous treatment of types as sets is given for the refinement calculus, a method of impe...
The refinement calculus provides a framework for the stepwise development of imperative programs fro...
The refinement calculus is a formal technique for the development of programs which are provably cor...
Morgan's approach to program development is a refinement calculus: using this method, programs are d...
The invariant based programming is a technique of constructing correct programs by first identifying...
The logic programming refinement calculus is a method for transforming specifications to executable ...
Abstract. This article shows a correspondence between abstract inter-pretation of imperative program...
The refinement calculus and type theory are both frameworks that support the specification and verif...
Existing refinement calculi provide frameworks for the stepwise development of imperative programs f...
AbstractRefine is a tool that supports the application of Morgan's refinement calculus. It was desig...
Program algebras abstract the essential properties of programming languages in the form of algebraic...
AbstractA uniform treatment of specifications, programs, and programming is presented. The treatment...
High-level language program compilation strategies can be proven correct by modelling the process as...
High-level language program compilation strategies can be proven correct by modelling the process as...
AbstractThe real-time refinement calculus is a formal method for the systematic derivation of real-t...