Mechanizing UNITY in Isabelle

ACM Transactions on Computational Logic

Volumn 1, Issue 1, 2000, Pages 3-32

  Paulson, Lawrence C ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

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

Indexed keywords

EID: 84966544848     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/343369.343370     Document Type: Article

References (23)

1. Andersen, F., Petersen, K. D., and Pettersson, J. S. 1993. Program verificaiton using HOL-UNITY. In Higher Order Logic Theorem Proving and Its Applications (HUG'93), J. Joyce and C. Seger, Eds. Lecture Notes in Computer Science, vol. 780. Springer-Verlag, New York, 1-15.
2. Andersen, F., Petersen, K. D., and Pettesson, J. S. 1994. A graphical tool for proving UNIT progress. In Higher Order Logic Theorem Proving and Its Applications, T. F. Melham and J. Camilleri, Eds. Lecture Notes in Computer Science, vol. 859. Springer-Verlag, New York, 17-32.
3. Chandy, K. M. and Misra, J. 1988. Parallel Program Design: A Foundation. Addison-Wesley Longman Publ. Co., Inc., Reading, MA.
4. Chandy, K. M. and Sanders, B. A. 1998. Reasoning about program composition. Available via http://www.cise.ufl.edu/sanders/pubs/composition.ps.
5. 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. Springer Lecture Notes in Computer Science, vol. 1708. Springer-Verlag, New York, 570-589.
6. Dappert-Farquhar, A. 1990. A correction on “a family of 2-process mutual exclusion algorithms”. Available via ftp://ftp.cs.utexas.edu/pub/psp/unity/notes/22-90.ps.Z.
7. Gordon, M. J. C. and Melham, T. F., Eds. 1993. Introduction to HOL: A Theorem Proving Environment for Higher Order Logic. Cambridge University Press, New York, NY.
8. Heyd, B. and Cregut, P. 1996. A modular coding of UNITY in COQ. In Theorem Proving in Higher Order Logics (THPOL'96), J. von Wright, J. Grundy, and J. Harrison, Eds. Springer Lecture Notes in Computer Science, vol. 1125. Springer-Verlag, New York, 251-266.
9. Kaltenbach, M. 1996. Interactive verification exploiting program design knowledge: A model-checker for UNITY. Ph.D. Dissertation. University of Texas at Austin, Austin, TX.
10. Lamport, L. 1994. The temporal logic of actions. ACM Trans. Program. Lang. Syst. 16, 3 (May 1994), 872-923.
11. Marques, F. 1998. Program composition in COQ-UNITY. In Supplementary Proceedings on Theorem Proving in Higher Order Logics: Emerging Trends (TPHOLs'98), J. Grundy and M. Newey, Eds. 95-104.
12. Misra, J. 1990. A familty of 2-process mutual exclusion algorithms. Available via ftp://ftp.cs.utexas.edu/pub/psp/unity/notes/13-90.ps.Z.
13. Misra, J. 1994. Asynchronous compositions of programs. Available via ftp://ftp.cs.utexas.edu/pub/psp/unity/new_unity/composition.ps.Z.
14. Misra, J. 1995a. A logic for concurrent programming: Progress. J. Comput. Softw. Eng. 3, 2, 273-300. Also at ftp://ftp.cs.utexas.edu/pub/psp/unity/new_unity/progress.ps.Z.
15. Misra, J. 1995b. A logic for concurrent programming: Safety. J. Comput. Softw. Eng. 3, 2, 239-272. Also at ftp://ftp.cs.utexas.edU/pub/psp/unity/new_unity/safety.ps.Z.
16. Paulson, L. C. 1994. Isabelle: A Generic Theorem Prover. Lecture Notes in Computer Science, vol. 828. Springer-Verlag, New York, NY.
17. Paulson, L. C. 1998. The inductive approach to verifying cryptographic protocols. J. Comput. Secur. 6, 85-128.
18. Paulson, L. C. 1999. A generic tableau prover and its integration with Isabelle. J. Univ. Comput. Sci. 5, 3.
19. Paulson, L. and Grcabczewski, K. 1996. Mechanizing set theory: Cardinal arithmetic and the axiom of choice. J. Autom. Reasoning 17, 3 (Dec.), 291-323.
20. Prasetya, I. S. W. B. 1995. Mechanically supported design of self-stabilizing algorithms. Ph.D. Dissertation. University of Utrecht.
21. Sanders, B. 1991. Eliminating the substitution axiom from UNITY logic. Form. Asp. Comput. 3, 2, 189-205.
22. Thirioux, X. 1998. Automatically proving Unity safety properties with arrays and quantifiers. In Parallel and Distributed Processing, J. Rolim, Ed. Springer Lecture Notes in Computer Science, vol. 1388. Springer-Verlag, New York.
23. Vos, T. E. J. 1999. UNITY in diversity, a stratified approach to the verification of distributed algorithms. Ph.D. Dissertation. University of Utrecht.