Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Symbolic model checking: an approach to the state explosion problem
Symbolic model checking: an approach to the state explosion problem
Information Processing Letters - Special issue on the calculational method
Model checking
Refinement Calculus: A Systematic Introduction
Refinement Calculus: A Systematic Introduction
Towards a Time Model for Circus
ICFEM '02 Proceedings of the 4th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
Angelic nondeterminism in the unifying theories of programming
Formal Aspects of Computing
rCOS: a refinement calculus of object systems
Theoretical Computer Science - Components and objects
Angelic Nondeterminism and Unifying Theories of Programming
Electronic Notes in Theoretical Computer Science (ENTCS)
Slotted-circus: a UTP-family of reactive theories
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
UTP'06 Proceedings of the First international conference on Unifying Theories of Programming
Pointers and records in the unifying theories of programming
UTP'06 Proceedings of the First international conference on Unifying Theories of Programming
Control law diagrams in circus
FM'05 Proceedings of the 2005 international conference on Formal Methods
| Hi-index | 0.00 |
In this paper we give an additional perspective to the formal verification of programs through temporal logic model checking, which uses Hoare and He Unifying Theories of Programming (UTP). Our perspective emphasizes the use of UTP designs, an alphabetised relational calculus expressed as a pre/post condition pair of relations, to verify state or temporal assertions about programs. The temporal model checking relation is derived from a satisfaction relation between the model and its properties. The contribution of this paper is that it shows a UTP perspective to temporal logic model checking. The approach includes the notion of efficiency found in traditional model checkers, which reduced a state explosion problem through the use of efficient data structures.