Mechanizing a theory of program composition for UNITY

ACM Transactions on Programming Languages and Systems

Volumn 23, Issue 5, 2001, Pages 626-656

  Paulson, Lawrence C ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Compositional reasoning; Concurrency; Isabelle; Theory; UNITY; Verification

Indexed keywords

EID: 0038843672     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/504709.504711     Document Type: Article

References (18)

1. ANDERSEN, F., PETERSEN, K. D., AND PETTERSSON, J. S. 1994. Program verification using HOL-UNITY. In Higher Order Logic Theorem Proving and Its Applications: HUG '93, J. Joyce and C. Seger, Eds. LNCS 780. Springer-Verlag, New York, NY, 1-15.
2. CHANDY, K. M. AND MISRA, J. 1988. Parallel Program Design: A Foundation. Addison-Wesley.
3. CHANDY, K. M. AND SANDERS, B. A. 2000. Reasoning about program composition. Tech. Rep. 2000-003, CISE, University of Florida. Available via http://www.cise.ufl.edu/~sanders/pubs/ composition.ps.
4. CHARPENTIER, M. AND CHANDY, K. M. 1999. Towards a compositional approach to the design and verification of distributed systems. In World Congress on Formal Methods in the Development of Computing Systems (FM'99), J. M. Wing, J. Woodcock, and J. Davies, Eds. LNCS 1708. Springer-Verlag, New York, NY, 570-589.
5. HEYD, B. AND CRÉGUT, P. 1996. A modular coding of UNITY in COQ. In Theorem Proving in Higher Order Logics: TPHOLs '96, J. von Wright, J. Grundy, and J. Harrison, Eds. LNCS 1125. Springer-Verlag, New York, NY, 251-266.
6. LAMPORT, L. 1994. The temporal logic of actions. ACM Trans. Program. Lang. Syst. 16, 3 (May), 872-923.
7. MERZ, S. 1999. An encoding of TLA in Isabelle. http://www.pst.informatik.uni-muenchen.de/ ~merz/isabelle/TLA/doc/IsaTLADesign.ps.
8. MISRA, J. 1994a. Asynchronous compositions of programs. At URL ftp://ftp.cs.utexas.edu/ pub/psp/unity/new_unity/composition.ps.Z.
9. MISRA, J. 1994b. Closure properties. At URL ftp://ftp.cs.utexas.edu/pub/psp/unity/new_ unity/closure.ps.Z.
10. MISRA, J. 1995a. A logic for concurrent programming: Progress. J. Comput. Soft. Eng. 3, 2, 273-300. Available at URL ftp://ftp.cs .utexas.edu/pub/psp/unity/new_unity/progress.ps.Z.
11. MISRA, J. 1995b. A logic for concurrent programming: Safety. J. Comput. Soft. Eng. 3, 2, 239-272. Available at URL ftp://ftp.cs.utexas.edu/pub/psp/unity/new_unity/safety.ps.Z.
12. PAULSON, L. C. 1994. Isabelle: A Generic Theorem Prover. Springer-Verlag, New York, NY, LNCS 828.
13. PAULSON, L. C. 2000. Mechanizing UNITY in Isabelle. ACM Trans. Comp. Logic 1, 1, 3-32.
14. PAULSON, L. C. AND GRA̧BCZEWSKI, K. 1996. Mechanizing set theory: Cardinal arithmetic and the axiom of choice. J. Auto. Reas. 17, 3 (Dec.), 291-323.
15. PRASETYA, I. S. W. B. 1995. Mechanically supported design of self-stabilizing algorithms. Ph.D. dissertation, University of Utrecht.
16. SANDERS, B. 1991. Eliminating the substitution axiom from UNITY logic. Formal Aspects of Computing 3, 2, 189-205.
17. SIVILOTTI, P. A. G. 1997. A method for the specification, composition, and testing of distributed object systems. Ph.D. dissertation, California Institute of Technology, Caltech, Pasadena, CA, 256-280.
18. VOS, T. E. J. 1999. UNITY in Diversity, a stratified approach to the verification of distributed algorithms. Ph.D. dissertation, Utrecht University.