research-article

Open access

The rely-guarantee method for verifying shared variable concurrent programs

Authors:

Willem -Paul de Roever,

Jifeng HeAuthors Info & Claims

Formal Aspects of Computing, Volume 9, Issue 2

Pages 149 - 174

https://doi.org/10.1007/BF01211617

Published: 01 March 1997 Publication History

Abstract

Compositional proof systems for shared variable concurrent programs can be devised by including the interference information in the specifications. The formalism falls into a category calledrely-guarantee (orassumption-commitment), in which a specification is explicitly (syntactically) split into two corresponding parts. This paper summarises existing work on the rely-guarantee method and gives a systematic presentation. A proof system for partial correctness is given first, thereafter it is demonstrated how the relevant rules can be adapted to verify deadlock freedom and convergence. Soundness and completeness, of which the completeness proof is new, are studied with respect to an operational model. We observe that the rely-guarantee method is in a sense a reformulation of the classical non-compositional Owicki & Gries method, and we discuss throughout the paper the connection between these two methods.

References

References

[1]

Apt, K. R.: Recursive assertions and parallel programs.Acta Informatica, Springer-Verlag, 1981.

[2]

Abadi M. and Lamport L. Conjoining specifications ACM Trans. on Program. Lang. Syst. 1995 17 3 507-534

Digital Library

[3]

Back, R. J. R.: Proving total correctness of nondeterministic programs in infinitary logic.Acta Informatica, Springer-Verlag, 1981.

[4]

Brookes, S. D.: Full abstraction for a shared variable parallel language. InProc. 8th IEEE Int. Symp. on Logic in Computer Science, 1993.

[5]

Collette, P.: Application of the composition principle to Unity-like specifications. In M.-C. Gaudel and J.-P. Jouannaud eds.,Proc, of TAPSOFT 93, LNCS 668, Springer-Verlag, 1993.

[6]

Cook S. A. Soundness and completeness of an axiom system for program verification SIAM Journal on Computing 1978 7 70-90

[7]

de Roever, W. P.: The quest for compositionality. inProc:IFIP Working Conf. The Role of Abstract Models in Computer Science. North-Holland, 1985.

[8]

Jones, C. B.:Development methods for computer programs including a notion of interference. DPhil. Thesis, Oxford University Computing Laboratory, 1981.

[9]

Jones C. B. Accommodating interference in the formal design of concurrent objectbased programs Formal Methods in System Design 1996 8 2 105-121

Digital Library

[10]

Jonsson, B. and Tsay, Y.-K.: Reasoning about assumption/guarantee specifications in linear-time temporal logic. InProc, of TAPSOFT 95, LNCS, Springer-Verlag, 1995.

[11]

Lamport L. The temporal logic of actions ACM Trans, on Program. Lang. Syst. 1995 16 3 872-923

[12]

Misra J. and Chandy M. Proofs of networks of processes IEEE SE 1981 7 4 417-426

Digital Library

[13]

Moszkowski, B.: Some very compositional temporal properties, InProgramming Concepts, Methods and Calculi (A-56), E.-R. Olderog (Editor), Elsevier Science B.V. (North-Holland), pp. 307–326, 1994.

[14]

Owicki, S. and Gries, D.: An axiomatic proof technique for parallel programs.Acta Inform. 6, pp. 319–340, Springer-Verlag, 1976.

[15]

Plotkin, G. D.: A structural approach to operational semantics. Computer Science Department, Aarhus University, Technical Report, DAIMI FN-19,1981.

[16]

Stirling C. A generalization of Owicki-Gries's Hoare logic for a concurrent while language Theoretical Computer Science 1988 58 347-359

Digital Library

[17]

Stølen, K.:Development of Parallel Programs on Shared Data-structures. Ph.D Thesis, Computer Science Department, Manchester University, 1990.

[18]

Stølen, K.: An attempt to reason about shared-state concurrency in the style of VDM. in S. Prehn and W. J. Toetenel, editors,Proceedings of VDM 91, LNCS 551, Springer-Verlag, 1991.

[19]

Stø1en, K.: A method for the development of totally correct shared-state parallel programs. In J.C.M. Baeten and J.F. Groote, editors,Proceedings of CONCUR 91, LNCS 527, Springer-Verlag, 1991.

[20]

Stø1en K. Proving total correctness with respect to a fair (share-state) parallel language Proceedings of BCS FACS 5th Refinement Workshop 1992 London Springer-Verlag

[21]

Stø1en K. Shared-state design modulo weak and strong process fairness Proceedings of 5th International Conference on Formal Description Techniques 1992 France Perros-Guirec

[22]

Woodcock J. C. P. and Dickinson B. Using VDM with Rely and Guarantee-conditions, experiences from a real project 2nd VDM-Europe Symposium 1988 Dublin, Ireland Springer-Verlag

[23]

Xu Q.-W., de Roever W.-P., and He J.-R Rely-guarantee method for verifying shared variable concurrent programs, report 9502 1995 Germany Christian-Albrechts-Universität zu Kiel

[24]

Xu Q.-W. and He J.-F. Morris J. and Shaw R. A theory of state-based parallel programming: Part 1 Proceedings of BCS FACS 4th Refinement Workshop 1991 Cambridge Springer-Verlag

[25]

Xu, Q.-W.:A theory of state-based parallel programming. DPhil. Thesis, Oxford University Computing Laboratory, 1992.

[26]

Xu, Q.-W., Cau, A. and Collette, P.: On unifying assumption-commitment style proof rules for concurrency. In B. Jonsson and J. Parrow editors,Proceedings of CONCUR 94, LNCS 836, Springer-Verlag, 1994.

Cited By

Svyatlovskiy MMermelstein SLahav O(2024)Compositional Semantics for Shared-Variable ConcurrencyProceedings of the ACM on Programming Languages10.1145/36563998:PLDI(543-566)Online publication date: 20-Jun-2024
https://dl.acm.org/doi/10.1145/3656399
Bargmann LDongol BWehrheim H(2024)Unifying Weak Memory Verification Using PotentialsFormal Methods10.1007/978-3-031-71162-6_27(519-537)Online publication date: 9-Sep-2024
https://dl.acm.org/doi/10.1007/978-3-031-71162-6_27
Coughlin NLam KSmith GWinter K(2024)Detecting Speculative Execution Vulnerabilities on Weak Memory ModelsFormal Methods10.1007/978-3-031-71162-6_25(482-500)Online publication date: 9-Sep-2024
https://dl.acm.org/doi/10.1007/978-3-031-71162-6_25
Show More Cited By

Index Terms

The rely-guarantee method for verifying shared variable concurrent programs

Index terms have been assigned to the content through auto-classification.

Recommendations

Mechanically Verifying Concurrent Programs with the Boyer-Moore Prove

A proof system suitable for the mechanical verification of concurrent programs is described. This proof system is based on Unity, and may be used to specify and verify both safety and liveness properties. However, it is defined with respect to an ...
Interleaved Programs and Rely-Guarantee Reasoning with ITL
TIME '11: Proceedings of the 2011 Eighteenth International Symposium on Temporal Representation and Reasoning

This paper presents a logic that extends basicITL with explicit, interleaved programs. The calculus is based on symbolic execution, as previously described. We extend this former work here, by integrating the logic with higher-order logic, adding ...
Verifying a Concurrent Garbage Collector with a Rely-Guarantee Methodology

Concurrent garbage collection algorithms are a challenge for program verification. In this paper, we address this problem by proposing a mechanized proof methodology based on the Rely-Guarantee proof technique. We design a compiler intermediate ...

Comments

Information & Contributors

Information

Published In

cover image Formal Aspects of Computing

Formal Aspects of Computing Volume 9, Issue 2

Mar 1997

108 pages

ISSN:0934-5043

EISSN:1433-299X

Issue’s Table of Contents

© BCS 1997.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 March 1997

Accepted: 15 August 1996

Received: 15 February 1993

Published in FAC Volume 9, Issue 2

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

19
Total Citations
View Citations
109
Total Downloads

Downloads (Last 12 months)53
Downloads (Last 6 weeks)7

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Svyatlovskiy MMermelstein SLahav O(2024)Compositional Semantics for Shared-Variable ConcurrencyProceedings of the ACM on Programming Languages10.1145/36563998:PLDI(543-566)Online publication date: 20-Jun-2024
https://dl.acm.org/doi/10.1145/3656399
Bargmann LDongol BWehrheim H(2024)Unifying Weak Memory Verification Using PotentialsFormal Methods10.1007/978-3-031-71162-6_27(519-537)Online publication date: 9-Sep-2024
https://dl.acm.org/doi/10.1007/978-3-031-71162-6_27
Coughlin NLam KSmith GWinter K(2024)Detecting Speculative Execution Vulnerabilities on Weak Memory ModelsFormal Methods10.1007/978-3-031-71162-6_25(482-500)Online publication date: 9-Sep-2024
https://dl.acm.org/doi/10.1007/978-3-031-71162-6_25
Dvir YKammar OLahav O(2024)A Denotational Approach to Release/Acquire ConcurrencyProgramming Languages and Systems10.1007/978-3-031-57267-8_5(121-149)Online publication date: 6-Apr-2024
https://dl.acm.org/doi/10.1007/978-3-031-57267-8_5
Bargmann LWehrheim H(2023)Lifting the Reasoning Level in Generic Weak Memory VerificationiFM 202310.1007/978-3-031-47705-8_10(175-192)Online publication date: 13-Nov-2023
https://dl.acm.org/doi/10.1007/978-3-031-47705-8_10
Brieger MMitsch SPlatzer A(2023)Uniform Substitution for Dynamic Logic with Communicating Hybrid ProgramsAutomated Deduction – CADE 2910.1007/978-3-031-38499-8_6(96-115)Online publication date: 1-Jul-2023
https://dl.acm.org/doi/10.1007/978-3-031-38499-8_6
Lahav ODongol BWehrheim H(2023)Rely-Guarantee Reasoning for Causally Consistent Shared MemoryComputer Aided Verification10.1007/978-3-031-37706-8_11(206-229)Online publication date: 17-Jul-2023
https://dl.acm.org/doi/10.1007/978-3-031-37706-8_11
Coughlin NWinter KSmith G(2022)Compositional Reasoning for Non-multicopy Atomic ArchitecturesFormal Aspects of Computing10.1145/357413735:2(1-30)Online publication date: 14-Dec-2022
https://dl.acm.org/doi/10.1145/3574137
Sanan DZhao YLin SYang L(2021)CSimACM Transactions on Programming Languages and Systems10.1145/343680843:1(1-46)Online publication date: 9-Feb-2021
https://dl.acm.org/doi/10.1145/3436808
Pani TWeissenbacher GZuleger F(2021)Rely-guarantee bound analysis of parameterized concurrent shared-memory programsFormal Methods in System Design10.1007/s10703-021-00370-857:2(270-302)Online publication date: 1-Aug-2021
https://dl.acm.org/doi/10.1007/s10703-021-00370-8
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Media

Figures

Other

Tables

View Issue’s Table of Contents