Atomicity refinement and trace reduction theorems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1102, Issue , 1996, Pages 311-322

  Gribomont, E Pascal ^a  

^a UNIVERSITY OF LIÈGE   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

COARSE-GRAINED; COMPUTER AIDED VERIFICATIONS; CONCURRENT ALGORITHMS; DIRECT APPROACH; EXPLICIT CONSTRUCTIONS; REDUCTION METHOD; TRANSFER PROPERTIES;

COMPUTER AIDED ANALYSIS;

EID: 84957356403     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61474-5_79     Document Type: Conference Paper

References (29)

1. B. Alpern and F. Schneider, Recognizing safety and liveness, Distributed Computing 2 (1987) 117-126.
2. R.-J. Back, A Method for Refining Atomicity in Parallel Algorithms, Lect. Notes in Comput. Sci. 366 (1989) 199-216.
3. R.-J. Back and R. Kurki-Suonio, Decentralization of Process Nets with Centralized Control, Distributed Computing 3 (1989) 73-87.
4. R.-J. Back and R. Sere, Stepwise Refinement of Parallel Algorithms, Set. Comput. Programming 13 (1990) 133-180.
5. E. Best, A Note on the Proof of a Concurrent Program, Inform. Processing lett. 9, pp. 103-104, 1979
6. K.M. Chandy and J. Misra, Parallel Program Design: A Foundation (Addison-Wesley, Reading, MA, 1988).
7. E.M. Clarke, Synthesis of Resource Invariants for Concurrent Programs, A CM Trans. Programming Languages Syst. 2 (1980) 338-358.
8. 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 Syrup. on Principles of Pragr. Languages (1977) 238-252.
9. J.W. De Bakker and L.G.L.T. Meertens, On the Completeness of the Inductive Assertion Method, J. of Computer and Syst Sci. (1975) 323-357.
10. E.W. Dijkstra and et al., On-the-Fly Garbage Collection: An Exercise in Cooperation, Comm. ACM 21 (1978) 966-975
11. E.W. Dijkstra, Finding the Correctness Proof of a Concurrent Program, Loci. Notes in Comput. Set. 69 (1979) 24-34.
12. T.W. Doeppner, Parallel Program Correctness Through Refinement, Proc. 4th ACM Syrup. on Principles of Progr. Languages (1977) 155-169.
13. E.P. Gribomont, Synthesis of parallel programs invariants, Leer. Notes in Comput. Sci. 186 (1985) 325-338.
14. E.P. Gribomont, Stepwise refinement and concurrency: the finite-state case, Sci. Cornput. Programming 14 (1990) 185-228.
15. E.P. Gribomont, Concurrency without toil: a systematic method for parallel program design, Sci. Comput. Programming 21 (1993) 1-56.
16. 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.
17. E.P. Gribomont, Preprocessing for invariant Validation, submitted to AMAST’96.
18. R.M. Keller, Formal Verification of Parallel Programs, C. ACM 19 (1976) 371-384.
19. Y.S. Kwong, On reduction of asynchronous systems, Th. Comp. Sci. 15 (1977) 25-50.
20. L. Lamport, An Assertional Correctness Proof of a Distributed Algorithm, Sci. Cornput. Programming 2 (1983) 175-206.
21. L. Lamport, w/n and sin: Predicate Transformers for Concurrency, ACM Trans. Programming Languages Syst. 12 (1990) 396-428.
22. L. Lamport, The Temporal Logic of Actions, DEC SRC Report 79, 1989.
23. L. Lamport and F.B. Schneider, Pretending Atomicity, DEC SRC Report 44, 1989.
24. L. Lamport and F.B. Schneider, The Reduction Theorem, unpublished TLA note, available on http://www.research.digital.com/SRC/tla/notes.html, 1992.
25. L. Lamport and et al., Introduction, papers and notes about TLA, available on http://www.research.digital.com/SRC/tla/.
26. R.J. Lipton, Reduction: A method of proving properties of parallel programs, Comm. ACM 18 (1975) 717-721.
27. G.L. Peterson, Myths about the mutual exclusion problem, Information Proc. Left. 12 (1981) 115-110.
28. J. Sifakis, A unified approach for studying the properties Of transition systems, The. oret. Comput. Sci. 18 (1982) 227-259.
29. A. van Lamsweerde and M. Sintzoff, Formal derivation of strongly correct concurrent programs, Acta Inform. 12 (1979) 1-31.