Mechanizing UNITY in Isabelle

Authors:
Lawrence C. Paulson
Affiliations:
Univ. of Cambridge, Cambridge, UK
Venue:
ACM Transactions on Computational Logic (TOCL)
Year:
2000

Citing 8
Cited 11

Parallel program design: a foundation

Parallel program design: a foundation
Introduction to HOL: a theorem proving environment for higher order logic

Introduction to HOL: a theorem proving environment for higher order logic
The temporal logic of actions

ACM Transactions on Programming Languages and Systems (TOPLAS)
The inductive approach to verifying cryptographic protocols

Journal of Computer Security
Program Verification using HOL-UNITY

HUG '93 Proceedings of the 6th International Workshop on Higher Order Logic Theorem Proving and its Applications
A Graphical Tool for Proving Unity Progress

Proceedings of the 7th International Workshop on Higher Order Logic Theorem Proving and Its Applications
A Modular Coding of UNITY in COQ

TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
Interactive verification exploiting program design knowledge: a model-checker for unity

Interactive verification exploiting program design knowledge: a model-checker for unity

Mechanizing a theory of program composition for UNITY

ACM Transactions on Programming Languages and Systems (TOPLAS)
Program Composition in Isabelle/UNITY

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
A Structural Embedding of Ocsid in PVS

TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
Cones and foci: A mechanical framework for protocol verification

Formal Methods in System Design
Compositionality for Tightly Coupled Systems: A New Application of the Propositions-as-Types Interpretation

Fundamenta Informaticae - Behavior of Composed Concurrent Systems: Logic and Reasoning
A Formalized Theory for Verifying Stability and Convergence of Automata in PVS

TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Compositionality for Tightly Coupled Systems: A New Application of the Propositions-as-Types Interpretation

Electronic Notes in Theoretical Computer Science (ENTCS)
Rewriting UNITY

RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
A framework for verifying data-centric protocols

FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Compositionality for Tightly Coupled Systems: A New Application of the Propositions-as-Types Interpretation

Fundamenta Informaticae - Behavior of Composed Concurrent Systems: Logic and Reasoning
Specification and Verification of Concurrent Programs Through Refinements

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

UNITY is an abstract formalism for proving properties of concurrent systems, which typically are expressed using guarded assignments [Chandy and Misra 1988]. UNITY has been mechanized in higher-order logic using Isabelle, a proof assistant. Safety and progress primitives, their weak forms (for the substitution axiom), and the program composition operator (union) have been formalized. To give a feel for the concrete syntax, this article presents a few extracts from the Isabelle definitions andproofs. It discusses a small example, two-process mutual exclusion. A mechanical theory of unions of programs supports a degree of compositional reasoning. Original work on extending program states is presented and then illustrated through a simple example involving an array of processes.