Mechanizing compositional reasoning for concurrent systems: Some lessons

Formal Aspects of Computing

Volumn 17, Issue 1, 2005, Pages 58-68

  Ehmety, Sidi O ^a   Paulson, Lawrence C ^b  

^a France   (Mauritania)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Compositional reasoning; Existential properties; Guarantees assertions; Isabelle; UNITY; Universal properties

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; FORMAL LOGIC; MATHEMATICAL MODELS; PROBLEM SOLVING; SEMANTICS;

COMPOSITIONAL REASONING; EXISTENTIAL PROPERTIES; GUARANTEES ASSERTIONS; ISABELLE; UNITY; UNIVERSAL PROPERTIES;

LARGE SCALE SYSTEMS;

EID: 18744363350     PISSN: 09345043     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00165-004-0053-6     Document Type: Article

References (25)

1. [APP94] Flemming Andersen, Kim Dam Petersen, Jimmi S. Pettersson (1994) Program verification using HOL-UNITY. In: Joyce J, Seger C (eds) Higher order logic theorem proving and its applications: HUG '93, LNCS 780, Springer, Berlin Heidelberg New York, pp 1-15
2. [CC99] Michel Charpentier, Mani Chandy K (1999) Examples of program composition illustrating the use of universal properties. In: José Rolim (ed) Parallel and distributed processing, LNCS 1586, Workshop on formal methods for parallel programming: theory and applications, pp 1215-1227
3. [CC00] Michel Charpentier, Mani Chandy K (2000) Theorems about composition. In: Backhouse R, Nuno J. Oliveira (eds), Mathematics of program construction: 5th international conference, MPC 2000, LNCS 1837. Springer, Berlin Heidelberg New York, pp 167-186
4. [CC02] Mani Chandy K, Michel Charpentier (2002) An experiment in program composition and proof. Formal methods syst. des. 20(1):7-21
5. [CC04] Michel Charpentier, Mani Chandy K (2004) Specification transformers: a predicate transformer approach to composition. Acta Informatica 40(3):265-301
6. [CM88] Mani Chandy K, Jayadev Misra (1988) Parallel program design: a foundation. Addison-Wesley, Menlo park
7. [Coh02] Ernie Cohen (2002) Asynchronous progress. In: Annabelle McIver, Carroll Morgan (eds) Programming methodology. Springer, Berlin Heidelberg New York
8. [CS00] Mani Chandy K, Beverly A. Sanders (2000) Reasoning about program composition. Technical Report 2000-003, CISE, University of Florida, available via http://www.cise.ufl.edu/~sanders/pubs/composition.ps.
9. [DS90] Edsger W. Dijkstra, Carel S. Scholten (1990) Predicate calculus and program semantics. Springer, Berlin Heidelberg New York
10. [EP01] Sidi O. Ehmety, Lawrence C. Paulson (2001) Representing component states in higher-order logic. In: Richard J. Boulton, Paul B. Jackson (eds) TPHOLs 2001: supplemental proceedings, number EDI-INF-RR-0046 in Informatics Report Series, pp 151-158. Division of Informatics. University of Edinburgh. Online at http://www.informatics.ed.ac.uk/publications/report/ 0046.html.
11. [EP02] Sidi O. Ehmety, Lawrence C. Paulson (2002) Program composition in Isabelle/UNITY. In: Parallel and distributed processing. IEEE Workshop on formal methods for parallel programming: theory and applications; text on CD-ROM
12. [HC96] Barbara Heyd, Pierre Crégut (1996) A modular coding of UNITY in COQ. In: von Wright J, Grundy J, Harrison J (eds) Theorem proving in higher order logics: TPHOLs '96, vol 1125 of LNCS Springer. Berlin Heidelberg New York, pp 251-266
13. [Lam94] Leslie Lamport (1994) The temporal logic of actions. ACM Trans Programming Languages Syst 16(3):872-923
14. [Lam98] Leslie Lamport (1998) Composition: a way to make proofs harder. In: Willem-Paul de Roever, Hans Langmaack, Amir Pnueli (eds) Compositionality: the significant difference (Proceedings of the COMPOS'97 Symposium), vol 1536 of LNCS. Springer, Berlin Heidelberg New York, pp 402-423
15. [Mei97] David Meier (1997) Progress properties in program refinement and parallel composition. PhD Thesis, Swiss Federal Institute of Technology, Zurich
16. [Mer99] Stephan Merz (1999) Yet another encoding of TLA in Isabelle. On the Internet at http://vww.loria.fr/~merz/projects/ Isabelle-tla/doc/design.ps.gz
17. [Mis01] Jayadev Misra (2001) A discipline of multiprogramming. Springer, Berlin Heidelberg New York
18. [Mor94] Carroll Morgan (1994) Programming from specifications. Prentice-Hall, (2nd edn), Engelwood Cliffs
19. [MS00] David Meier, Beverly Sanders (2000) Composing leads-to properties. Theor Comput Sei 243(1-2):339-361
20. [NPW02] Tobias Nipkow, Lawrence C. Paulson, Markus Wenzel (2002) Isabelle/HOL: a proof assistant for higher-order logic. LNCS Tutorial 2283 Springer, Berlin Heidelberg New York
21. [Pau00] Lawrence C. Paulson (2000) Mechanizing UNITY in Isabelle. ACM Trans Comput Logic 1(1):3-32
22. [Pau0l] Lawrence C. Paulson (2001) Mechanizing a theory of program composition for UNITY. ACM Trans Programming Languages Syst 25(5):626-656
23. [PG96] Lawrence C. Paulson, Krzysztof Gra̧bczewski (1990) Mechanizing set theory: cardinal arithmetic and the axiom of choice. J Automated Reasoning 17(3):291-323
24. [San91] Beverly Sanders (1991) Eliminating the substitution axiom from UNITY logic. Formal Aspects Comput 3(2):189-205
25. [Vos99] Tanja E. J. Vos (1999) UNITY in Diversity, a Stratified approach to the verification of distributed algorithms. PhD Thesis, Utrecht University