Synthesis of Concurrent Programs for an Atomic Read/Write Model of Computation

ACM Transactions on Programming Languages and Systems

Volumn 23, Issue 2, 2001, Pages 187-242

  Attie, Paul C ^a   Emerson, E Allen ^b,c  

^a NORTHEASTERN UNIVERSITY   (United States)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^c University of Texas at Austin   (United States)

Author keywords

C.2.4 Computer Communication Networks : Distributed Systems; D.1.2 Programming Techniques : Automatic Programming; D.1.3 Programming Techniques : Concurrent Programming; D.2.1 Software Engineering : Requirements Specifications

Indexed keywords

ATOMIC REGISTERS; CONCURRENT PROGRAMMING; MUTUAL EXCLUSION PROBLEMS;

COMPUTATIONAL METHODS; COMPUTER ARCHITECTURE; COMPUTER PROGRAMMING LANGUAGES; LOGIC PROGRAMMING; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; SEMANTICS; SHIFT REGISTERS; SYNCHRONIZATION; SYSTEMS ANALYSIS;

CONCURRENT ENGINEERING;

EID: 0010342818     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/383043.383044     Document Type: Article

References (31)

1. ANUCHITANUKUL, A. AND MANNA, Z. 1994. Realizability and synthesis of reactive modules. In Proceedings of the 6th International Conference on Computer Aided Verification. Lecture Notes in Computer Science, vol. 818. Springer-Verlag, Berlin, 156-169.
2. ARORA, A. 1992. A foundation of fault-tolerant computing. Ph.D. thesis, Department of Computer Sciences, The University of Texas at Austin.
3. ARORA, A., ATTIE, P. C., AND EMERSON, E. A. 1998. Synthesis of fault-tolerant concurrent systems. In Seventeenth Annual ACM Symposium on Principles of Distributed Computing. ACM Press, 1515 Broadway, New York, NY 10036, 173-182.
4. ATTIE, P. C. 1995. Formal methods for the synthesis of concurrent programs from temporal logic specifications. Ph.D. thesis, Dept. of Computer Sciences, The Univ. of Texas at Austin.
5. ATTIE, P.C. 1999. Synthesis of large concurrent programs via pairwise composition. In CONCUR'99: 10th International Conference on Concurrency Theory. Lecture Notes in Computer Science 1664. Springer-Verlag, Heidelberg, Germany.
6. ATTIE, P. C. AND EMERSON, E. A. 1998. Synthesis of concurrent systems with many similar processes. ACM Trans. Program. Lang. Syst. 20, 1 (Jan.), 51-115. Preliminary version appears in Sixteenth ACM Symposium on Principles of Programming Languages, 1989.
7. ATTIE, P. C. AND EMERSON, E. A. 1998. Synthesis of concurrent systems with many similar processes. ACM Trans. Program. Lang. Syst. 20, 1 (Jan.), 51-115. Preliminary version appears in Sixteenth ACM Symposium on Principles of Programming Languages, 1989.
8. BACK, R. 1989. Refinement calculus, part ii: parallel and reactive programs. In Stepwise refinement of distributed systems, J. de Bakker, W. de Roever, and G. Rozenberg, Eds. Lecture Notes in Computer Science 430. Springer-Verlag, Heidelberg, Germany, 67-93.
9. BACK, R. AND VON WRIGHT, J. 1994. Trace refinement of action systems. In CONCUR '94-Concurrency theory, B. Johnsson and J. Parrow, Eds. Lecture Notes in Computer Science 836. Springer-Verlag, Heidelberg, Germany, 367-384.
10. BROWNE, M., CLARKE, E. M., AND GRUMBERG, O. 1988. Characterizing finite kripke structures in propositional temporal logic. Theoretical Computer Science 59, 115-131.
11. CHANDY, K. M. AND MISRA, J. 1988. Parallel Program Design. Addison-Wesley, Reading, Mass.
12. CLARKE, E. M., GRUMBERG, O., AND BROWNE, M. C. 1986. Reasoning about networks with many identical finite-state processes. In Proceedings of the 5th Annual ACM Symposium on Principles of Distributed Computing. ACM, New York, 240-248.
13. DIJKSTRA, E. W. 1976. A Discipline of Programming. Prentice-Hall Inc., Englewood Cliffs, N.J.
14. DILL, D. AND WONG-TOI, H. 1990. Synthesizing processes and schedulers from temporal specifications. In International Conference on Computer-Aided Verification. Number 531 in LNCS. Springer-Verlag, Heidelberg, Germany, 272-281.
15. EMERSON, E. A. 1990. Temporal and modal logic. In Handbook of Theoretical Computer Science, J. V. Leeuwen, Ed. Vol. B, Formal Models and Semantics. The MIT Press/Elsevier, Cambridge, Mass.
16. EMERSON, E. A. AND CLARKE, E. M. 1982. Using branching time temporal logic to synthesize synchronization skeletons. Sci. Comput. Program. 2, 241-266.
17. FRANCEZ, N. 1986. Fairness. Springer-Verlag, New York.
18. GRIBOMONT, E. 1990. Stepwise refinement and concurrency: the finite-state case. Sci. Comput. Program. 14, 2-3 (Oct.), 185-228.
19. GRIBOMONT, E. 1993. Concurrency without toil: a systematic method for paralel program design. Sci. Comput. Program. 21, 1 (Aug.), 1-56.
20. HERLIHY, M. 1991. Wait-free synchronization. ACM Trans. Program. Lang. Syst. 11, 1 (Jan.), 124-149.
21. HOARE, C. A. R. 1969. An axiomatic basis for computer programming. Commun. ACM 12, 10, 576-580, 583.
22. LAMPORT, L. 1990. A theorem on atomicity in distributed algorithms. Distributed Computing 4, 2, 59-68.
23. LYNCH, N. AND TUTTLE, M. 1987. Hierarchical correctness proofs for distributed algorithms. In Proceedings of the 6'th Annual ACM Symposium on Principles of Distributed Computing. ACM Press, 1515 Broadway, New York, NY 10036, 137-151.
24. LYNCH, N. AND VAANDRAGER, F. 1995. Forward and backward simulations - part I: Untimed systems. Inform, and Comput. 121, 2 (Sept.), 214-233.
25. MANNA, Z. AND PNUELI, A. 1995. Temporal verification of reactive systems: safety. Springer-verlag, New York.
26. MANNA, Z. AND WOLPER, P. 1984. Synthesis of communicating processes from temporal logic specifications. ACM Trans. Program. Lang. Syst. 6, 1 (Jan.), 68-93. Also appears in Proceedings of the Workshop on Logics of Programs, Yorktown-Heights, N. Y., Springer-Verlag Lecture Notes in Computer Science (1981).
27. MANNA, Z. AND WOLPER, P. 1984. Synthesis of communicating processes from temporal logic specifications. ACM Trans. Program. Lang. Syst. 6, 1 (Jan.), 68-93. Also appears in Proceedings of the Workshop on Logics of Programs, Yorktown-Heights, N. Y., Springer-Verlag Lecture Notes in Computer Science (1981).
28. PETERSON, G. 1981. Myths about the mutual exclusion problem. IPL 12, 3 (June), 115-116.
29. PNUELI, A. AND ROSNER, R. 1989a. On the synthesis of a reactive module. In Proceedings of the 16th ACM Symposium on Principles of Programming Languages. ACM, New York, 179-190.
30. PNUELI, A. AND ROSNER, R. 1989b. On the synthesis of asynchronous reactive modules. In Proceedings of the 16th ICALP. Lecture Notes in Computer Science, vol. 372. Springer-Verlag, Berlin, 652-671.
31. SINGH, A., ANDERSON, J., AND GOUDA, M. 1994. The elusive atomic register. J. ACM 41, 2 (Mar.), 311-339.