Titlebook: Unifying Theories of Programming; First International Steve Dunne,Bill Stoddart Conference proceedings 2006 Springer-Verlag Berlin Heidelb

腐蚀

安抚

Disk199

Unifying Theories in ProofPower-Z,ns, is presented here. We aim at providing tool support for further explorations of Hoare & He’s unification, and for the mechanisation of languages based on this unification. More specifically, ., a specification language that combines Z, CSP, specification statements, and Dijkstra’s guarded command language is our final target.

难管

Hierarchical Organisation of Predicate-Semantic Models,g can be supported by laws of generic composition. The techniques also help simplify the proof of well-definedness of program combinators (i.e. their closure in the semantic space) so that we no longer need to prove it (in predicate calculus) for every new model.

迫击炮

Pointers and Records in the Unifying Theories of Programming,and non-terminating programs. Therefore, we link it with the theory of designs, providing a foundation for reasoning about total correctness of pointer-based sequential programs. Our work is a step towards the semantics of an object-oriented language that also integrates constructs for specifying state-rich and concurrent systems.

是突袭

Modal Design Algebra,ber of authors. Finally we show that the designs form a left semiring and even a Kleene and omega algebra. This is used to calculate closed expressions for the least and greatest fixed-point semantics of the demonic while loop that are simpler than the ones obtained from standard UTP theory and previous algebraic approaches.

notice

花费

Mechanising a Unifying Theory,l semantics to an imperative programming language, and use our definitions to create a deep embedding of the language in .. We use ProofPowerZ, a theorem prover for . to provide mechanised support for reasoning about programs in the unifying theory.

大量杀死

Object-Orientation in the UTP,amming (UTP). This work shows how subtyping, data inheritance, (mutually) recursive methods, and dynamic binding can be described in the UTP by combining and extending the theories of designs and higher-order procedures. A distinguishing feature of our approach is modularity: following the style of

detach

CSP Is a Retract of CCS,cesses and to prove their correctness. For example, theories based on CCS are often pre-ordered by simulation (or more commonly bisimulation), of which the main varieties are strong or weak or barbed. Theories based on CSP choose as their pre-order a refinement relation, defined as inclusion over se