A structural proof of the soundness of rely/guarantee rules

Journal of Logic and Computation

Volumn 17, Issue 4, 2007, Pages 807-841

  Coleman, Joey W ^a   Jones, Cliff B ^a  

^a NEWCASTLE UNIVERSITY   (United Kingdom)

Author keywords

Concurrency; Rely guarantee reasoning; Soundness; Structural induction; Structural operational semantics

Indexed keywords

COMPUTATIONAL METHODS; SEMANTICS;

CONCURRENCY; GUARANTEE REASONING; STRUCTURAL INDUCTION; STRUCTURAL OPERATIONAL SEMANTICS;

CONCURRENT ENGINEERING;

EID: 34548414062     PISSN: 0955792X     EISSN: 1465363X     Source Type: Journal    
DOI: 10.1093/logcom/exm030     Document Type: Article

References (52)

1. P. Aczel. A note on program verification (private communication), Manuscript, Manchester, January 1982.
2. K. R. Apt. Ten years of Hoare's logic: A survey - part I. ACM Transactions on Programming Languages and Systems, 3, 431-483, 1981.
3. H. Barringer, J. H. Cheng, and C. B. Jones. A logic covering undefinedness in program proofs. Acta Informatica, 21, 251-269, 1984.
4. S. Brookes. Retracing the semantics of CSP. In Communicating Sequential Processes: the First 25 Years, A. E. Abdallah, C. B. Jones and J. W. Sanders, eds, Vol. 3525 of LNCS. Springer-Verlag, Berlin, 2005.
5. R. Burstall and F. Honsell. A natural deduction treatment of operational semantics. Technical Report ECS-LFCS-88-69, LFCS, University of Edinburgh, 1988.
6. J. W. Coleman and C. B. Jones. A structural proof of the soundness of rely /guarantee rules (revised). Technical Report, School of Computing Science, University of Newcastle, 2007.
7. J. Camilleri and T. Melham. Reasoning with inductively defined relations in the HOL theorem prover. Technical Report 265. Computer Laboratory, University of Cambridge, August 1992.
8. P. Collette and C. B. Jones. Enhancing the tractability of rely/guarantee specifications in the development of interfering operations. In Proof, Language and Interaction, G. Plotkin, C. Striling, and M. Tofte, eds, chapter 10, pp. 275-305. MIT Press, Cambridge, Massachusetts, 2000.
9. W. P. de Roever. Concurrency Verification: Introduction to Compositional and Non-compositional Methods. Cambridge University Press, Cambridge, United Kingdom, 2001.
10. E. W. Dijkstra. A Discipline of Programming. Prentice-Hall, Upper Saddle River, NJ, USA, 1976.
11. E. W. Dijkstra and C. S. Scholten. Predicate Calculus and Program Semantics. Springer-Verlag, 1990. ISBN 0-387-96957-8, 3-540-96957-8.
12. J. Dingel. Systematic Parallel Programming. PhD Thesis, Carnegie Mellon University, 2000. CMU-CS-99-172.
13. J. E. Donahue. Complementary Definitions of Programming Language Semantics. Vol. 42 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1976.
14. J. Fitzgerald and P. G. Larsen. Modelling Systems: Practical Tools and Techniques in Software Development. Cambridge University Press, 1998.
15. G. Gentzen. Untersuchungen über das logische Schliessen. Matematische Zeitschrift, 39, 176-210, 405-431, 1935. Available as Investigations into Logical Deduction, Chapter 3 of The Collected Papers of Gerhard Gentzen, M. E. Szabo, ed.
16. D. Gries. The Science of Programming. Springer-Verlag, Berlin, 1981.
17. D. Gries and F. B. Schneider. A Logical Approach to Discrete Math. Springer-Verlag, second edition, Berlin, 1996.
18. I. Hayes, M. Jackson, and C. Jones. Determining the specification of a control system from that of its environment. In FME 2003: Formal Methods, Vol. 2805 of LNCS, pp. 154-169. Springer-Verlag, Berlin, 2003.
19. C. A. R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, 12, 576-580, 583, 1969.
20. R. C. Holt, P. A. Matthews, J. A. Rosselet and J. R. Cordy. The Turing Programming Language: Design and Definition. Prentice Hall International, Upper Saddle River, NJ, USA, 1998.
21. C. Jones, I. Hayes, and M. Jackson. Deriving specifications for systems that are connected to the physical world. Vol. 4700 of LNCS, C. B. Jones, Z. Liu and J. P. C. Woodcock, eds, Springer Verlag, Berlin, 2007.
22. C. B. Jones. Formal development of correct algorithms: an example based on Earley's recogniser. In SIGPLAN Notices, vol. 7, number 1, pp. 150-169. ACM, New York, NY, USA, 1972.
23. C. B. Jones. Software Development: A Rigorous Approach. Prentice Hall International, Upper Saddle River, NJ, USA, 1980. ISBN 0-13-821884-6.
24. C. B. Jones. Development Methods for Computer Programs including a Notion of Interference. PhD Thesis, Oxford University, June 1981. Printed as: Programming Research Group, Technical Monograph 25.
25. C. B. Jones. Specification and design of (parallel) programs. In Proceedings of IFIP'83, pp. 321-332. North-Holland, Amsterdam, 1983.
26. C. B. Jones. Tentative steps toward a development method for interfering programs. ACM Transactions on Programming Languages and Systems, 5, 596-619, 1983.
27. C. B. Jones. Program specification and verification in VDM. Technical Report UMCS 86-10-5, University of Manchester, 1986. Extended version of [Jon87] (includes the full proofs).
28. C. B. Jones. Program specification and verification in VDM. In Logic of Programming and Calculi of Discrete Design, M. Broy, ed., Vol. 36 of NATO ASI Series F: Computer and Systems Sciences, pp. 149-184. Springer-Verlag, Berlin, 1987.
29. C. B. Jones. Systematic Software Development using VDM. Prentice Hall International, second edition, Upper Saddle River, NJ, USA, 1990. ISBN 0-13-880733-7.
30. C. B. Jones. Accommodating interference in the formal design of concurrent object-based programs. Formal Methods in System Design, 8, 105-122, 1996.
31. C. B. Jones. Wanted: a compositional approach to concurrency. In Programming Methodology, A. McIver and C. Morgan, eds, pp. 1-15. Springer-Verlag, Berlin, 2003.
32. C. B. Jones. Operational semantics: concepts and their expression. Information Processing Letters, 88, 27-32, 2003.
33. C. B. Jones. Splitting atoms safely. Theoretical Computer Science, 357, 109-119, 2007. doi:10.1016/j.tcs.2006.12.029.
34. C. B. Jones, K. D. Jones, P. A. Lindsay, and R. Moore. Mural: A Formal Development Support System. Springer-Verlag, Berlin, 1991. ISBN 3-540-19651-X.
35. T. Nipkow, D. von Oheimb, and C. Pusch. Embedding a programming language in a theorem prover. In Foundations of Secure Computation. Proceedings of International Summer School Marktoberdorf 1999, F. L. Bauer and R. Steinbrüggen, eds, pp. 117-114. IOS Press, Amesterdam, 2000.
36. R. Kuiper. On completeness of an inference rule for parallel composition, 1983 (private communication), Manuscript, Manchester.
37. P. E. Lauer. Consistent Formal Theories of the Semantics of Programming Languages. PhD Thesis, Queen's University of Belfast, 1971. Printed as TR 25.121, IBM Lab. Vienna.
38. P. Lucas and K. Walk. On The Formal Description of PL/I. Vol. 6 of Annual Review in Automatic Programming Part 3. Pergamon Press, Oxford, 1969.
39. Peter O'Hearn. Resources, concurrency and local reasoning. Theoretical Computer Science, 375, 271-307, 2007.
40. S. Owicki. Axiomatic Proof Techniques for Parallel Programs. PhD Thesis, Department of Computer Science, Cornell University, 1975.
41. S. S. Owicki and D. Gries. An axiomatic proof technique for parallel programs I. Acta Informatica, 6, 319-340, 1976.
42. G. D. Plotkin. A structural approach to operational semantics. Technical Report, Aarhus University, 1981.
43. G. D. Plotkin. The origins of structural operational semantics. Journal of Logic and Algebraic Programming, 60-61, 3-15, 2004.
44. G. D. Plotkin. A structural approach to operational semantics. Journal of Logic and Algebraic Programming, 60-61, 17-139, 2004.
45. D. Prawitz. Natural Deduction: a Proof-Theoretical Study. Dover publications, 1965.
46. L. P. Nieto. Verification of Parallel Programs with the Owicki-Gries and Rely-Guarantee Methods in Isabelle/HOL. PhD Thesis, Institut für Informatic der Technischen Universitaet München, 2001.
47. L. P. Nieto. The rely-guarantee method in Isabelle/HOL. Proceedings of ESOP 2003, Vol. 2618 of LNCS. Springer-Verlag, Berlin, 2003.
48. F. B. Schneider. On Concurrent Programming. Graduate Texts in Computer Science. Springer-Verlag, New York, Inc., New York, 1997.
49. C. Stirling. A compositional reformulation of Owicki-Gries' partial correctness logic for a concurrent while language. In ICALP'86, Vol. 226 of LNCS. Springer-Verlag, Berlin, 1986.
50. K. Stølen. Development of Parallel Programs on Shared Data-Structures. PhD Thesis, Manchester University, 1990. Available as UMCS-91-1-1.
51. Q. Xu. A Theory of State-based Parallel Programming. PhD Thesis, Oxford University, 1992.
52. Q. Xu, W.-P. de Rpever, and J. He. The rely-guarantee method for verifying shared variable concurrent programs. Formal Aspects of Computing, 9, 149-174, 1997.