Communications of the ACM
A theoretical basis for stepwise refinement and the programming calculus
Science of Computer Programming
Theoretical Computer Science
A generalization of Dijkstra's calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
Duality in specification languages: a lattice-theoretical approach
Acta Informatica
Programming from specifications
Programming from specifications
Specification case studies
The Z notation: a reference manual
The Z notation: a reference manual
A theory for the derivation of combinational C-mos circuit designs
Theoretical Computer Science - Images of programming dedicated to the memory of Andrei P. Ershov
Acta Informatica
Foundations of programming languages
Foundations of programming languages
Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM
The remaining trouble spots in ALGOL 60
Communications of the ACM
Revised report on the algorithm language ALGOL 60
Communications of the ACM
Report on the algorithmic language ALGOL 60
Communications of the ACM
Communication and Concurrency
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Principles of Program Analysis
Principles of Program Analysis
A Theory of Programming Language Semantics
A Theory of Programming Language Semantics
The Vienna Development Method: The Meta-Language
The Vienna Development Method: The Meta-Language
CICS Project Report: Experiences and Results from the use of Z in IBM
VDM '91 Proceedings of the 4th International Symposium of VDM Europe on Formal Software Development-Volume I: Conference Contributions - Volume I
An Algebraic Construction of Predicate Transformers
Proceedings of the Second International Conference on Mathematics of Program Construction
Refinement Calculus, Part I: Sequential Nondeterministic Programs
Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
Data Refinement: Model-Oriented Proof Methods and their Comparison
Data Refinement: Model-Oriented Proof Methods and their Comparison
| Hi-index | 0.00 |
Hoare and He's approach to unifying theories of programming, UTP, is a dozen years old. In spite of the importance of its ideas, UTP does not seem to be attracting due interest. The purpose of this article is to discuss why that is the case, and to consider UTP's destiny. To do so it analyses the nature of UTP, focusing primarily on unification, and makes suggestions to expand its use.