Skip to main content
SpringerLink
Log in

A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency

  • Original Article
  • Published:
Formal Aspects of Computing

Abstract

In this paper we introduce an abstract algebra for reasoning about concurrent programs, that includes an abstract algebra of atomic steps, with sub-algebras of program and environment steps, and an abstract synchronisation operator. We show how the abstract synchronisation operator can be instantiated as a synchronous parallel operator with interpretations in rely-guarantee concurrency for shared-memory systems, and in process algebras CCS and CSP. It is also instantiated as a weak conjunction operator, an operator that is useful for the specification of rely and guarantee conditions in rely/guarantee concurrency. The main differences between the parallel and weak conjunction instantiations of the synchronisation operator are how they combine individual atomic steps. Lemmas common to these different instantiations are proved once using the axiomatisation of the abstract synchronous operator. Using the sub-algebras of program and environment atomic steps, rely and guarantee conditions, as well as Morgan-style specification commands, are defined at a high-level of abstraction in the program algebra. Lifting these concepts from rely/guarantee concurrency to a higher level of abstraction makes them more widely applicable. We demonstrate the practicality of the algebra by showing how a core law from rely-guarantee theory, the parallel introduction law, can be abstracted and verified easily in the algebra. In addition to proving fundamental properties for reasoning about concurrent shared-variable programs, the algebra is instantiated to prove abstract process synchronisation properties familiar from the process algebras CCS and CSP. The algebra has been encoded in Isabelle/HOL to provide a basis for tool support for concurrent program verification based on the rely/guarantee technique. It facilitates simpler, more general, proofs that allow a higher level of automation than what is possible in low-level, model-specific interpretations.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aczel PHG (1983) On an inference rule for parallel composition. Private communication to Cliff Jones http://homepages.cs.ncl.ac.uk/cliff.jones/publications/MSs/PHGA-traces.pdf

  2. Armstrong A, Gomes VBF, Struth G (2014) Algebras for program correctness in Isabelle/HOL. In: Höfner P et al. (eds) International conference on relational and algebraic methods in computer science (RAMiCS 2014), volume 8428 of Lecture notes in computer science. Springer, pp 49–64

  3. Back, R.-J.R.: On correct refinement of programs. J Comput Syst Sci 23(1), 49–68 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bergstra, J.A., Klop, J.W.: Process algebra for synchronous communication. Inf Control 60(1–3), 109–137 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  5. Blikle A (1978) Specified programming. In: Blum EK, Paul M, Takasu S (eds) Mathematical studies of information processing, volume 75 of Lecture notes in computer science. Springer, pp 228–251

  6. Back, R.-J.R., von Wright, J.: Refinement calculus: a systematic introduction. Springer, New York (1998)

    Book  MATH  Google Scholar 

  7. Colvin RJ, Hayes IJ (2009) CSP with hierarchical state. In: Leuschel M, Wehrheim H (eds) Integrated formal methods (IFM 2009), volume 5423 of LNCS. Springer, pp 118–135

  8. Colvin, R.J., Hayes, I.J., Meinicke, L.A.: Designing a semantic model for a wide-spectrum language with concurrency. Form Asp Comput 29, 853–875 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  9. Coleman, J.W., Jones, C.B.: A structural proof of the soundness of rely/guarantee rules. J Log Comput 17(4), 807–841 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  10. de Roever, W.-P.: Concurrency verification: introduction to compositional and noncompositional methods. Cambridge University Press, Cambridge (2001)

    MATH  Google Scholar 

  11. Gardiner, P.H.B., Morgan, C.: A single complete rule for data refinement. Form Asp Comput 5, 367–382 (1993)

    Article  MATH  Google Scholar 

  12. Hayes, I.J.: Generalised rely-guarantee concurrency: an algebraic foundation. Form Asp Comput 28(6), 1057–1078 (November 2016)

  13. Hayes IJ, Colvin RJ, Meinicke LA, Winter K, Velykis A (2016) An algebra of synchronous atomic steps. In: Fitzgerald J, Heitmeyer C, Gnesi S, Philippou A (eds) FM 2016: formal methods: 21st international symposium, proceedings, volume 9995 of LNCS.Springer International Publishing, Cham, pp 352–369

  14. Hayes IJ, Jones CB, Colvin RJ (2014) Laws and semantics for rely-guarantee refinement. Technical Report CS-TR-1425, Newcastle University

  15. Hoare, C.A.R., Möller, B., Struth, G., Wehrman, I.: Concurrent Kleene algebra and its foundations. J Log Algebr Program 80(6), 266–296 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  16. Hoare, C.A.R.: Communicating sequential processes. Prentice-Hall, Englewood-Cliffs (1985)

    MATH  Google Scholar 

  17. Jones CB, Hayes IJ (2016) Possible values: exploring a concept for concurrency. J Log Algebr Methods Program 85(5, Part 2):972–984

  18. Jones, C.B., Hayes, I.J., Colvin, R.J.: Balancing expressiveness in formal approaches to concurrency. Form Asp Comput 27(3), 475–497 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  19. Jones CB (1981) Development methods for computer programs including a notion of interference. Ph.D. thesis, Oxford University, June 1981. Available as: Oxford University Computing Laboratory (now Computer Science) Technical Monograph PRG-25

  20. Jones CB (1983) Specification and design of (parallel) programs. In: Proceedings of IFIP'83. North-Holland, pp 321–332

  21. Jones, C.B.: Tentative steps toward a development method for interfering programs. ACM ToPLaS 5(4), 596–619 (1983)

    Article  MATH  Google Scholar 

  22. Kozen, D.: Kleene algebra with tests. ACM Trans Prog Lang Syst 19(3), 427–443 (1997)

    Article  MATH  Google Scholar 

  23. Robin, Milner: A calculus of communicating systems. Springer, New York (1982)

    MATH  Google Scholar 

  24. Milner, R.: Calculi for synchrony and asynchrony. Theor Comput Sci 25(3), 267–310 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  25. Milner, A.J.R.G.: Communication and concurrency. Prentice-Hall, Englewood-Cliffs (1989)

    MATH  Google Scholar 

  26. Morris, J.M.: A theoretical basis for stepwise refinement and the programming calculus. Sci Comput Program 9(3), 287–306 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  27. Morgan, C.C.: The specification statement. ACM Trans Prog Lang Syst 10(3), 403–419 (1988)

    Article  MATH  Google Scholar 

  28. Morgan, C.C.: Programming from specifications, 2nd edn. Prentice Hall, Englewood-Cliffs (1994)

    MATH  Google Scholar 

  29. Nipkow T, Paulson LC, Wenzel M (2002) Isabelle/HOL: a proof assistant for higher-order logic, volume 2283 of LNCS. Springer, Berlin

  30. Owicki, S.S., Gries, D.: An axiomatic proof technique for parallel programs I. Acta Inform 6(4), 319–340 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  31. Prensa Nieto L (2003) The rely-guarantee method in Isabelle/HOL. In: Proceedings of ESOP 2003, volume 2618 of LNCS. Springer

  32. Prisacariu, C.: Synchronous Kleene algebra. J Log Algebr Program 79(7), 608–635 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  33. Roscoe, A.W.: The theory and practice of concurrency. Prentice-Hall, Englewood-Cliffs (1998)

    Google Scholar 

  34. Sun J, Liu Y, Dong JS (2008) Model checking CSP revisited: introducing a process analysis toolkit. In: Margaria T, Steffen B (eds) Leveraging applications of formal methods, verification and validation: third international symposium, ISoLA 2008, Porto Sani, Greece, October 13–15, 2008. Proceedings. Springer, Berlin, pp 307–322

  35. Solin K (2007) Abstract algebra of program refinement. Ph.D. thesis, Turku Centre for Computer Science

  36. von Wright, J.: Towards a refinement algebra. Sci Comput Program 51, 23–45 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  37. Woodcock, J.C.P., Cavalcanti, A.L.C.: The semantics of Circus. In: Bert, D., Bowen, J.P., Henson, M.C., Robinson, K. (eds.) ZB 2002: formal specification and development in Z and B. Lecture notes in computer science, vol. 2272, pp. 184–203. Springer, Berlin (2002)

    Chapter  Google Scholar 

Download references

Acknowledgements

We would like to thank Cliff Jones, Kim Solin, Andrius Velykis and the anonymous referees for feedback on this research. This work was supported by Australian Research Council (ARC) Discovery Project DP130102901.

Author information

Authors and Affiliations

  1. School of Information Technology and Electrical Engineering, The University of Queensland, Brisbane, 4072, Australia

    Ian J. Hayes, Larissa A. Meinicke, Kirsten Winter & Robert J. Colvin

Authors
  1. Ian J. Hayes
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Larissa A. Meinicke
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kirsten Winter
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Robert J. Colvin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ian J. Hayes.

Additional information

by Connie Heitmeyer, Ana Cavalcanti, John Fitzgerald, Stefaniia Gnesi and Jim Woodcock

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hayes, I.J., Meinicke, L.A., Winter, K. et al. A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency. Form Asp Comp 31, 133–163 (2019). https://doi.org/10.1007/s00165-018-0464-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00165-018-0464-4

Keywords

Search

Navigation