Theories for Mechanical Proofs of Imperative Programs

Formal Aspects of Computing

Volumn 9, Issue 5-6, 1997, Pages 448-468

  Hesselink, Wim H ^a  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

Author keywords

Fairness; Peterson's algorithm; Shared variables; Theorem proving; While theorem

Indexed keywords

EID: 2542603816     PISSN: 09345043     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01211455     Document Type: Article

References (25)

1. Apt, K. R. and Olderog, E.-R.: Verification of Sequential and Concurrent Programs. Springer, 1991.
2. Back, R. J. R. and von Wright, J.: Refinement concepts formalized in higher order logic. Formal Aspects of Computing 2 (1990) 247-272.
3. Boyer, R. S. and Moore, J. S.: A Computational Logic Handbook. Academic Press, Boston etc., 1988.
4. Boyer, R. S. and Moore, J. S.: A Computational Logic Handbook, Authorized Excepts from a Proposed Second Edition, to be obtained by ftp from Computational Logic Inc. Information available at nqthm-request@cli.com.
5. Chandy, K. M. and Misra, J.: Parallel Program Design, A Foundation. Addison-Wesley, 1988.
6. Dijkstra, E. W.: A discipline of programming. Prentice-Hall 1976.
7. Engberg, U., Grønning, P. and Lamport, L.: Mechanical verification of concurrent systems with TLA. In Computer Aided Verification. Springer Verlag 1992, LNCS 663.
8. Garland, S. J. and Guttag, J. V.: LP: the Larch Prover. In E. Lusk and R. Overbeek, (eds.): 9th Conference on automated deduction (CADE). Springer 1988, LNCS 310, pp. 748-749.
9. Gordon, M. J. C.: Mechanizing programming logics in higher-order logic. In G. Birtwistle and P. A. Subrahmanyam, (eds.): Current trends in hardware verification and theorem proving. Springer 1989, pp. 387-439.
10. Gordon, M. J. C. and Melham, T. F. (eds.): Introduction to HOL: A theorem proving environment for higher order logic Cambridge University Press, Cambridge, UK, 1993.
11. Gries, D.: The science of programming. Springer 1981.
12. Hessehnk, W. H.: Wait-free Linearization with a mechanical proof. Distributed Computing 9 (1995) 21-36.
13. Hesselink, W. H.: The verified incremental design of a distributed spanning tree algorithm - extended abstract. See [Hes@].
14. Hesselink, W. H.: The design of a linearization of a concurrent data object. To appear in Proceedings Procomet '98. See [Hestg].
15. Hesselink, W. H.: Web site: http://www.cs.rug.nl/~wim.
16. Hooman, J.: Correctness of real time systems by construction. In: H. Langmaack, W.-P. de Roever and J. Vytopil, (eds.): Formal Techniques in real-time and fault-tolerant Systems. Springer 1994. LNCS 863. pp. 19-40.
17. Kaldewaij, A.: Programming: the Derivation of Algorithms. Prentice Hall International, 1990.
18. Lamport, L.: The temporal logic of actions. ACM Transactions on Programming Languages and Systems 16 (1994) 872-923.
19. Moore, J. S.: A formal model of asynchronous communication and its use in mechanically verifying a biphase mark protocol. Formal Aspects of Computing 6 (1994) 60-91.
20. Moore, J. S.: Piton: A mechanically verified assembly-level language. Kluwer, 1996.
21. Owre, S., Shankar, N. and Rushby, J. M.: User Guide for the PVS Specification and Verification System, Language, and Proof Checker (Beta Release). CSL, SRI International, Menlo Park, CA, February 1993 (three volumes).
22. Peterson, G. L.: Myths about the mutual exclusion problem. IPL 12 (1981) 115-116.
23. Russinoff, D. M.: A verification system for concurrent programs. Formal Aspects of Computing 4 (1992) 597-611.
24. Skakkebæk, J. U. and Shankar, A.: A duration calculus proof checker: Using PVS as a semantic framework. SRI, CSL Tech. Report, December 1993.
25. Tel, G.: Distributed Algorithms. Cambridge University Press, 1994.