Mechanical Reasoning about Families of UTP Theories

Authors:
Frank Zeyda;Ana Cavalcanti
Affiliations:
Department of Computer Science, University of York, Heslington, York, YO10 5DD, U.K.;Department of Computer Science, University of York, Heslington, York, YO10 5DD, U.K.
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 6
Cited 1

Timed Communicating Object Z

IEEE Transactions on Software Engineering
Towards a Time Model for Circus

ICFEM '02 Proceedings of the 4th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
A UTP semantics for Circus

Formal Aspects of Computing
ClawZ: cost-effective formal verification for control systems

ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
Unifying theories in proofpower-z

UTP'06 Proceedings of the First international conference on Unifying Theories of Programming
Mechanising a unifying theory

UTP'06 Proceedings of the First international conference on Unifying Theories of Programming

Saoithín: a theorem prover for UTP

UTP'10 Proceedings of the Third international conference on Unifying theories of programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a semantic embedding of Hoare and He's Unifying Theories of Programming (UTP) framework into the ProofPower-Z theorem prover; it concisely captures the notion of UTP theory, theory instantiation, and, additionally, type restrictions on the alphabet. We show how the encoding can be used to reason about UTP theories and their predicates, including models of particular specifications and programs. We support encoding and reasoning about combinations of elements of collections of theory instantiations, as typically found in UTP models of particular specifications and programs.