zbMATH — the first resource for mathematics

A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency. (English) Zbl 1425.68293
Summary: 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.
68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68N30 Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
68T15 Theorem proving (deduction, resolution, etc.) (MSC2010)
Circus; Isabelle/HOL
Full Text: DOI
[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 · Zbl 1405.68314
[3] Back, R-JR, On correct refinement of programs, J Comput Syst Sci, 23, 49-68, (1981) · Zbl 0469.68012
[4] Bergstra, JA; Klop, JW, Process algebra for synchronous communication, Inf Control, 60, 109-137, (1984) · Zbl 0597.68027
[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) · Zbl 0949.68094
[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 · Zbl 1211.68266
[8] Colvin, RJ; Hayes, IJ; Meinicke, LA, Designing a semantic model for a wide-spectrum language with concurrency, Form Asp Comput, 29, 853-875, (2016) · Zbl 1375.68036
[9] Coleman, JW; Jones, CB, A structural proof of the soundness of rely/guarantee rules, J Log Comput, 17, 807-841, (2007) · Zbl 1125.68039
[10] de Roever, W.-P.: Concurrency verification: introduction to compositional and noncompositional methods. Cambridge University Press, Cambridge (2001) · Zbl 1009.68020
[11] Gardiner, PHB; Morgan, C., A single complete rule for data refinement, Form Asp Comput, 5, 367-382, (1993) · Zbl 0774.68081
[12] Hayes, I.J.: Generalised rely-guarantee concurrency: an algebraic foundation. Form Asp Comput 28(6), 1057-1078 (November 2016) · Zbl 1348.68035
[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, CAR; Möller, B.; Struth, G.; Wehrman, I., Concurrent Kleene algebra and its foundations, J Log Algebr Program, 80, 266-296, (2011) · Zbl 1278.68176
[16] Hoare, C.A.R.: Communicating sequential processes. Prentice-Hall, Englewood-Cliffs (1985) · Zbl 0637.68007
[17] Jones CB, Hayes IJ (2016) Possible values: exploring a concept for concurrency. J Log Algebr Methods Program 85(5, Part 2):972-984 · Zbl 1355.68043
[18] Jones, CB; Hayes, IJ; Colvin, RJ, Balancing expressiveness in formal approaches to concurrency, Form Asp Comput, 27, 475-497, (2015) · Zbl 1343.68171
[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, CB, Tentative steps toward a development method for interfering programs, ACM ToPLaS, 5, 596-619, (1983) · Zbl 0517.68032
[22] Kozen, D., Kleene algebra with tests, ACM Trans Prog Lang Syst, 19, 427-443, (1997) · Zbl 0882.03064
[23] Robin, Milner: A calculus of communicating systems. Springer, New York (1982) · Zbl 0452.68027
[24] Milner, R., Calculi for synchrony and asynchrony, Theor Comput Sci, 25, 267-310, (1983) · Zbl 0512.68026
[25] Milner, A.J.R.G.: Communication and concurrency. Prentice-Hall, Englewood-Cliffs (1989) · Zbl 0683.68008
[26] Morris, JM, A theoretical basis for stepwise refinement and the programming calculus, Sci Comput Program, 9, 287-306, (1987) · Zbl 0624.68017
[27] Morgan, CC, The specification statement, ACM Trans Prog Lang Syst, 10, 403-419, (1988) · Zbl 0825.68302
[28] Morgan, C.C.: Programming from specifications, 2nd edn. Prentice Hall, Englewood-Cliffs (1994) · Zbl 0829.68083
[29] Nipkow T, Paulson LC, Wenzel M (2002) Isabelle/HOL: a proof assistant for higher-order logic, volume 2283 of LNCS. Springer, Berlin · Zbl 0994.68131
[30] Owicki, SS; Gries, D., An axiomatic proof technique for parallel programs I, Acta Inform, 6, 319-340, (1976) · Zbl 0312.68011
[31] Prensa Nieto L (2003) The rely-guarantee method in Isabelle/HOL. In: Proceedings of ESOP 2003, volume 2618 of LNCS. Springer · Zbl 1032.68130
[32] Prisacariu, C., Synchronous Kleene algebra, J Log Algebr Program, 79, 608-635, (2010) · Zbl 1204.68123
[33] Roscoe, A.W.: The theory and practice of concurrency. Prentice-Hall, Englewood-Cliffs (1998)
[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] Wright, J., Towards a refinement algebra, Sci Comput Program, 51, 23-45, (2004) · Zbl 1091.68030
[37] Woodcock, JCP; Cavalcanti, ALC; Bert, D. (ed.); Bowen, JP (ed.); Henson, MC (ed.); Robinson, K. (ed.), The semantics of Circus, No. 2272, 184-203, (2002), Berlin
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.