Abstract
Assertional methods tend to be useable for abstract, coarse-grained versions of concurrent algorithms, but quickly become intractable for more realistic, finer-grained implementations. Various trace-reduction methods have been proposed to transfer properties of coarse-grained versions to finer-grained versions. We show that a more direct approach, involving the explicit construction of an (inductive) invariant for the finer-grained version, is theoretically more powerful, and also more appropriate for computer-aided verification.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
B. Alpern and F. Schneider, Recognizing safety and liveness, Distributed Computing 2 (1987) 117–126.
R.-J. Back, A Method for Refining Atomicity in Parallel Algorithms, Lect. Notes in Comput. Sci. 366 (1989) 199–216.
R.-J. Back and R. Kurki-Suonio, Decentralization of Process Nets with Centralized Control, Distributed Computing 3 (1989) 73–87.
R.-J. Back and R. Sere, Stepwise Refinement of Parallel Algorithms, Sci. Comput. Programming 13 (1990) 133–180.
E. Best, A Note on the Proof of a Concurrent Program, Inform. Processing lett. 9, pp. 103–104, 1979
K.M. Chandy and J. Misra, Parallel Program Design: A Foundation (Addison-Wesley, Reading, MA, 1988).
E.M. Clarke, Synthesis of Resource Invariants for Concurrent Programs, ACM Trans. Programming Languages Syst. 2 (1980) 338–358.
P. Cousot and R. Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, Proc. 4th ACM Symp. on Principles of Progr. Languages (1977) 238–252.
J.W. De Bakker and L.G.L.T. Meertens, On the Completeness of the Inductive Assertion Method, Jl. of Computer and Syst. Sci. (1975) 323–357.
E.W. Dijkstra and al., On-the-Fly Garbage Collection: An Exercise in Cooperation, Comm. ACM 21 (1978) 966–975.
E.W. Dijkstra, Finding the Correctness Proof of a Concurrent Program, Lect. Notes in Comput. Sci. 69 (1979) 24–34.
T.W. Doeppner, Parallel Program Correctness Through Refinement, Proc. 4th ACM Symp. on Principles of Progr. Languages (1977) 155–169.
E.P. Gribomont, Synthesis of parallel programs invariants, Lect. Notes in Comput. Sci. 186 (1985) 325–338.
E.P. Gribomont, Stepwise refinement and concurrency: the finite-state case, Sci. Comput. Programming 14 (1990) 185–228.
E.P. Gribomont, Concurrency without toil; a systematic method for parallel program design, Sci. Comput. Programming 21 (1993) 1–56.
E.P. Gribomont and D. Rossetto, CAVEAT: technique and tool for Computer Aided VErification And Transformation, Lect. Notes in Comp. Sci. 939 (1995) 70–83.
E.P. Gribomont, Preprocessing for invariant validation, submitted to AMAST'96.
R.M. Keller, Formal Verification of Parallel Programs, C. ACM 19 (1976) 371–384.
Y.S. Kwong, On reduction of asynchronous systems, Th. Comp. Sci. 15 (1977) 25–50.
L. Lamport, An Assertional Correctness Proof of a Distributed Algorithm, Sci. Comput. Programming 2 (1983) 175–206.
L. Lamport, Win and sin: Predicate Transformers for Concurrency, ACM Trans. Programming Languages Syst. 12 (1990) 396–428.
L. Lamport, The Temporal Logic of Actions, DEC SRC Report 79, 1989.
L. Lamport and F.B. Schneider, Pretending Atomicity, DEC SRC Report 44, 1989.
L. Lamport and F.B. Schneider, The Reduction Theorem, unpublished TLA note, available on http://www.research.digital.com/SRC/tla/notes.html, 1992.
L. Lamport and al., Introduction, papers and notes about TLA, available on http://www.research.digital.com/SRC/tla/.
R.J. Lipton, Reduction: A method of proving properties of parallel programs, Comm. ACM 18 (1975) 717–721.
G.L. Peterson, Myths about the mutual exclusion problem, Information Proc. Lett. 12 (1981) 115–116.
J. Sifakis, A unified approach for studying the properties of transition systems, Theoret. Comput. Sci. 18 (1982) 227–259.
A. van Lamsweerde and M. Sintzoff, Formal derivation of strongly correct concurrent programs, Acta Inform. 12 (1979) 1–31.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gribomont, E.P. (1996). Atomicity refinement and trace reduction theorems. In: Alur, R., Henzinger, T.A. (eds) Computer Aided Verification. CAV 1996. Lecture Notes in Computer Science, vol 1102. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61474-5_79
Download citation
DOI: https://doi.org/10.1007/3-540-61474-5_79
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61474-6
Online ISBN: 978-3-540-68599-9
eBook Packages: Springer Book Archive