Introduction to Mathematical Logic and Type Theory: To Truth through Proof
Introduction to Mathematical Logic and Type Theory: To Truth through Proof
A Denotational Semantics for Circus
Electronic Notes in Theoretical Computer Science (ENTCS)
An Extensible Encoding of Object-oriented Data Models in hol
Journal of Automated Reasoning
Test-sequence generation with Hol-TestGen with an application to firewall testing
TAP'07 Proceedings of the 1st international conference on Tests and proofs
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
A note on traces refinement and the conf relation in the unifying theories of programming
UTP'08 Proceedings of the 2nd international conference on Unifying theories of programming
Encoding circus programs in ProofPower-Z
UTP'08 Proceedings of the 2nd international conference on Unifying theories of programming
Unifying theories in proofpower-z
UTP'06 Proceedings of the First international conference on Unifying Theories of Programming
Mechanical reasoning about families of UTP theories
Science of Computer Programming
Symbolic test case generation for primitive recursive functions
FATES'04 Proceedings of the 4th international conference on Formal Approaches to Software Testing
Isabelle/circus: a process specification and verification environment
VSTTE'12 Proceedings of the 4th international conference on Verified Software: theories, tools, experiments
| Hi-index | 0.00 |
In this paper, we present various extensions of Isabelle/HOL by theories that are essential for several formal methods. First, we explain how we have developed an Isabelle/HOL theory for a part of the Unifying Theories of Programming (UTP). It contains the theories of alphabetized relations and designs. Then we explain how we have encoded first the theory of reactive processes and then the UTP theory for CSP. Our work takes advantage of the rich existing logical core of HOL. Our extension contains the proofs for most of the lemmas and theorems presented in the UTP book. Our goal is to propose a framework that will allow us to deal with formal methods that are semantically based, partly or totally, on UTP, for instance CSP and Circus. The theories presented here will allow us to make proofs about such specifications and to apply verified transformations on them, with the objective of assisting refinement and test generation.