Owicki/Gries in Isabelle/HOL

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1577, Issue , 1999, Pages 188-203

  Nipkow, Tobias ^a   Nieto, Leonor Prensa ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; SEMANTICS;

CORRECTNESS PROOFS; HIGHER ORDER LOGIC; IMPERATIVE PROGRAMS; ISABELLE; PROOF RULES; SHARED VARIABLES; THEOREM PROVERS;

SOFTWARE ENGINEERING;

EID: 84947908053     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-49020-3_13     Document Type: Conference Paper

References (28)

1. F. Andersen, K. Petersen, and J. Pettersson. Program verification using HOLUNITY. In J. Joyce and C. Seger, editors, Higher Order Logic Theorem Proving and Its Applications, volume 780 of Led. Notes in Comp. Sci., pages 1-15. Springer-Verlag, 1994.
2. K. R. Apt and E.-R. Olderog. Verification of Sequential and Concurrent Programs. Springer-Verlag, 1991.
3. A. Camillieri. Mechanizing CSP trace theory in higher order logic. IEEE Transactions on Software Engineering, 16:993-1004, 1990
4. B. Chetali and B. Heyd. Formal verification of concurrent programs in LP and COQ: A comparative analysis. In E. Gunter and A. Felty, editors, Theorem Proving in Higher Order Logics, volume 1275 of Lect. Notes in Comp. Sci., pages 69-85. Springer-Verlag, 1997
5. F. de Boer, U. Hannemann, and W.-P. de Roever. A compositional proof system for shared variable concurrency. In J. Fitzgerald, C. Jones, and P. Lucas, editors, FME’97: Industrial Applications and Strengthened Foundations of Formal Methods, volume 1313 of Lect. Notes in Comp. Sci., pages 515-532. Springer-Verlag, 1997.
6. B. Dutertre and S. Schneider. Using a PVS embedding of CSP to verify authentication protocols. In E. Gunter and A. Felty, editors, Theorem Proving in Higher Order Logics, volume 1275 of Lect. Notes in Comp. Sci., pages 121-136. Springer-Verlag, 1997.
7. U. Engberg, P. Grønning, and L. Lamport. Mechanical verification of concurrent systems with TLA. In G. v. Bochmann and D. Probst, editors, Computer-Aided Verification (CAV’92), volume 663 of Lect. Notes in Comp. Sci., pages 44-55. Springer-Verlag, 1993.
8. D. Goldschlag. Mechanically verifying concurrent programs with the Boyer-Moore Prover. IEEE Transactions on Software Engineering, 16:1005-1022, 1990
9. M. Gordon. Mechanizing programming logics in higher order logic. In G. Birtwistle and P. Subrahmanyam, editors, Current Trends in Hardware Verification and Automated Theorem Proving. Springer-Verlag, 1989
10. M. Gordon and T. Melham. Introduction to HOL: a theorem-proving environment for higher order logic. Cambridge University Press, 1993.
11. B. Heyd and P. Cregut. A modular coding of Unity in Coq. In J. von Wright, J. Grundy, and J. Harrison, editors, Theorem Proving in Higher Order Logics, volume 1125 of Lect. Notes in Comp. Sci., pages 251-266. Springer-Verlag, 1996.
12. Isabelle home page. www.cl.cam.ac.uk/Research/HVG/isabelle.html.
13. C. B. Jones. Development methods for computer programs including a notion of interference. Technical Report PRG-25, Programming Research Group, Oxford University Computing Laboratory, 1981
14. C. B. Jones. Tentative steps toward a development method for interfering programs. ACM Trans. Programming Languages and Systems, 5:596-619, 1983
15. S. Kalvala. A formulation of TLA in isabelle. In E. Schubert, P. Windley, and J. Alves-Foss, editors, Higher Order Logic Theorem Proving and its Applications, volume 971 of Lect. Notes in Comp. Sci., pages 214-228. Springer-Verlag, 1995.
16. T. Langbacka and J. von Wright. Refining reactive systems in HOL using action systems. In E. Gunter and A. Felty, editors, Theorem Proving in Higher Order Logics, volume 1275 of Lect. Notes in Comp. Sci., pages 183-197. Springer-Verlag, 1997.
17. O. Müller and T. Nipkow. Traces of I/O automata in Isabelle/HOLCF. In M. Bidoit and M. Dauchet, editors, TAPSOFT’97: Theory and Practice of Software Development, volume 1214 of Lect. Notes in Comp. Sci., pages 580-594. Springer- Verlag, 1997.
18. M. Nesi. Value-passing CCS in HOL. In J. Joyce and C. Seger, editors, Higher Order Logic Theorem Proving and Its Applications, volume 780 of Lect. Notes in Comp. Sci., pages 352-365. Springer-Verlag, 1994.
19. T. Nipkow. Winskel is (almost) right: Towards a mechanized semantics textbook. In V. Chandru and V. Vinay, editors, Foundations of Software Technology and Theoretical Computer Science, volume 1180 of Lect. Notes in Comp. Sci., pages 180-192. Springer-Verlag, 1996.
20. T. Nipkow. Isabelle/HOL. The Tutorial, 1998. Unpublished Manuscript. Available at www.in.tum.de/˜nipkow/pubs/HOL.html.
21. T. Nipkow. Winskel is (almost) right: Towards a mechanized semantics textbook. Formal Aspects of Computing, ?, 1998. To appear.
22. S. Owicki and D. Gries. An axiomatic proof technique for parallel programs. Acta Informatica, 6:319-340, 1976.
23. L. C. Paulson. Isabelle: A Generic Theorem Prover, volume 828 of Lect. Notes in Comp. Sci. Springer-Verlag, 1994.
24. J. Søgaard-Andersen, S. Garland, J. Guttag, N. Lynch, and A. Pogosyants. Computer-assisted simulation proofs. In Fourth Conference on Computer-Aided Verification, volume 697 of Lect. Notes in Comp. Sci., pages 305-319. Springer- Verlag, 1993
25. K. Stølen. Development of Parallel Programs on Shared Data-Structures. PhD thesis, Computer Science Department, Manchester University, 1990.
26. H. Tej and B. Wolff. A corrected failure-divergence model for CSP in Isabelle/ HOL. In J. Fitzgerald, C. Jones, and P. Lucas, editors, FME’97: Industrial Applications and Strengthened Foundations of Formal Methods, volume 1313 of Led. Notes in Corny. Sci., pages 318-337. Springer-Verlag, 1997.
27. J. von Wright, J. Hekanaho, P. Luostarinen, and T. Langbacka. Mechanizing some advanced refinement concepts. Formal Methods in System Design, 3:49-81, 1993.
28. J. von Wright and T. Langbacka. Using a theorem prover for reasoning about concurrent algorithms. In G. v. Bochmann and D. Probst, editors, Computer- Aided Verification (CAV’92), volume 663 of Lect. Notes in Comp. Sci., pages 56-68. Springer-Verlag, 1993.