Synthesis of Fault-Tolerant Concurrent Programs

ACM Transactions on Programming Languages and Systems

Volumn 26, Issue 1, 2004, Pages 125-185

  Attie, Paul C ^a   Arora, Anish ^b,d   Emerson, E Allen ^c,e  

^a NORTHEASTERN UNIVERSITY   (United States)

^b OHIO STATE UNIVERSITY   (United States)

^c UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^d The Ohio State University   (United States)

^e University of Texas at Austin   (United States)

Author keywords

Concurrent programs; Fault tolerance; Program synthesis; Specification; Temporal logic

Indexed keywords

PROGRAM SYNTHESIS; TEMPORAL LOGIC;

ARTIFICIAL INTELLIGENCE; CONCURRENT ENGINEERING; FAULT TOLERANT COMPUTER SYSTEMS; FORMAL LOGIC; PROBLEM SOLVING; SOFTWARE ENGINEERING;

COMPUTER PROGRAMMING;

EID: 1242287765     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/963778.963782     Document Type: Article

References (49)

1. ANUCHITANUKUL, A. AND MANNA, Z. 1994. Readability 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, Germany, 156-169.
2. AHORA, A. AND GOUDA, M. 1993. Closure and convergence: A foundation of fault-tolerant computing. IEEE Trans. Softw. Eng. 19, 11, 1015-1027.
3. ARORA, A. AND KULKARNI, S. 1998. Component based design of multitolerant systems. IEEE Trans. Softw. Eng. 24, 1, 63-78.
4. ATTIE, P. 2000. Wait-free Byzantine agreement. Tech. Rep. NU-CCS-00-02. College of Computer Science, Northeastern University, Boston, MA. Available on-line at http://www.ccs.neu.edu/home/attie/pubs.html.
5. ATTIE, P. 2002. Wait-free byzantine consensus. Inf. Process. Lett. 83, 4 (Aug.), 221-227.
6. ATTIE, P. C. 1999. Synthesis of large concurrent programs via pairwise composition. In CONCUR'99: 10th International Conference on Concurrency Theory (Aalborg, Denmark). Lacture Notes in Computer Science, vol. 1664. Springer-Verlag, Berlin, Germany.
7. ATTIE, P. C. AND EMERSON, E. A. 1996. Synthesis of concurrent systems for an atomic read/atomic write model of computation (extended abstract). In Fifteenth Annual ACM Symposium on Principles of Distributed Computing (Philadelphia, PA). ACM Press, New York, NY, 111-120.
8. 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.
9. ATTIE, P. C. AND EMERSON, E. A. 2001, Synthesis of concurrent systems for an atomic read/write model of computation. ACM Trans. Program. Lang. Syst. 23, 2 (Mar.), 187-242. Extended abstract appears in Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), 1996.
10. CHANDRA, T. AND TOUEG, S. 1996. Unreliable failure detectors for reliable distributed systems. J. ACM 43, 2 (Mar.), 225-267.
11. CHANDY, K. M. AND MISRA, J. 1988. Parallel Program Design. Addison-Wesley, Reading, MA.
12. DIJKSTRA, E. W. 1976. A Discipline of Programming. Prentice-Hall Inc., Englewood Cliffs, NJ.
13. EMERSON, E. 1981. Branching time temporal logic and the design of correct concurrent programs. Ph.D. dessertation. Division of Applied Sciences, Harvard University, Cambridge, MA.
14. 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, MA.
15. EMERSON, E. A. AND CLAHKE, E. M. 1982. Using branching time temporal logic to synthesize synchronization skeletons. Sci. Comput. Program. 2, 241-266.
16. EMERSON, E. A. AND LEI, C. 1985. Modalities for model checking: Branching time logic strikes back. In 12'th Annual ACM Symposium on Principles of Programming Languages (New Orleans, LA). ACM Press, New York, NY, 84-96.
17. EMERSON, E. A., MOK, A. K., SISTLA, A. P., AND SRINIVASAN, J. 1993. Quantitative temporal reasoning. Real Time Syst. J. 2, 331-352.
18. EMERSON, E. A., SADLER, T. H., AND SRINIVASAN, J. 1992. Efficient temporal satisfiability. J. Logic Comput. 2, 2, 173-210. Extended abstract appears in Proceedings of the 16th Annual ACM Symposium on Principles of Programming Languages, 1989, pp. 166-178.
19. EMERSON, E. A., SADLER, T. H., AND SRINIVASAN, J. 1992. Efficient temporal satisfiability. J. Logic Comput. 2, 2, 173-210. Extended abstract appears in Proceedings of the 16th Annual ACM Symposium on Principles of Programming Languages, 1989, pp. 166-178.
20. FEKETE, A., GUPTA, D., LUCHANGCO, V., LYNCH, N., AND SHVARTSMAN, A. 1999. Eventually-serializable data service. Theor. Comput. Sci. 220, 1 (June), 113-156. Special Issue on Distributed Algorithms.
21. FEKETE, A., LYNCH, N., AND SHVARTSMAN, A. 2001. Specifying and using a partitionable group communication service. ACM Trans. Comput. Syst. 19, 2 (May), 171-216.
22. FISCHER, M. J., LYNCH, N. A., AND PATERSON, M. S. 1985. Impossibility of distributed consensus with one faulty process. J. ACM 32, 2 (April), 374-382.
23. JAYARAM, M. AND VARGHESE, G. 1996. Crash failures can drive protocols to arbitrary states. In Proceedings of the 15th ACM Symposium on Principles of Distributed Computing (Philadelphia, PA). ACM Press, New York, NY.
24. KULKARNI, S. AND ARORA, A. 2000. Automating the addition of fault-tolerance. In Formal Techniques in Real-Time and Fault-Tolerant Systems, 6th International Symposium, FTRT FT 2000, Pune, India, September 20-22, 2000. Lecture Notes in Computer Science, vol. 1926. Springer-Verlag, Berlin, Germany.
25. KUPFERMAN, O., MADHUSUDAN, P., THIAGARAJAN, P., AND VARDI, M. 2000. Open systems in reactive environments: Control and synthesis. In Proceedings 11th International Conference on Concurrency Theory (College Park, PA). Lecture Notes in Computer Science, vol. 1877. Springer-Verlag, Berlin, Germany, 92-107.
26. KUPFERMAN, O. AND VAKDI, M. 1997. Synthesis with incomplete information. In 2nd International Conference on Temporal Logic. Kluwer Academic Publishers, Manchester, U.K., 91-106.
27. LAMPORT, L. 1994. The temporal logic of actions. ACM Trans. Program. Lang. Syst. 16, 3 (May), 872-923.
28. LIU, Z. AND JOSEPH, M. 1992. Transformation of programs for fault-tolerance. Form. Aspects Cornput. 4, 5, 442-469.
29. LIU, Z. AND JOSEPH, M. 1999. Specification and verification of fault-tolerance, timing, and scheduling. ACM Trans. Program. Lang. Syst. 21, 1 (Jan.), 46-89.
30. LIVADAS, C. AND LYNCH, N. A. 2002. A formal venture into reliable multicast territory. In Formal Techniques for Networked and Distributed Systems - FORTE 2002 (Proceedings of the 22nd IFIP WG 6.1 International Conference (Houston, TX)), M. Y. V. Doron Peled, Ed. Lecture Notes in Computer Science, vol. 2529. Springer, Berlin, Germany, 146-161. Also, full version in Tech. Memo MIT-LCS-TR-868, MIT Laboratory for Computer Science, Cambridge, MA, November 2002.
31. LIVADAS, C. AND LYNCH, N. A. 2002. A formal venture into reliable multicast territory. In Formal Techniques for Networked and Distributed Systems - FORTE 2002 (Proceedings of the 22nd IFIP WG 6.1 International Conference (Houston, TX)), M. Y. V. Doron Peled, Ed. Lecture Notes in Computer Science, vol. 2529. Springer, Berlin, Germany, 146-161. Also, full version in Tech. Memo MIT-LCS-TR-868, MIT Laboratory for Computer Science, Cambridge, MA, November 2002.
32. LUCHANGCO, V. 2001. Memory consistency models for high performance distributed computing. Ph.D. dessertation. Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA.
33. LYNCH, N. AND SHVARTSMAN, A. 2002. RAMBO: A reconfigurable atomic memory service for dynamic networks. In Distributed Computing (Proceedings of the 16th International Symposium on DIStributed Computing (DISC) (Toulouse, France)), D. Malkhi, Ed. Lecture Notes in Computer Science, vol. 2508. Springer-Verlag, Berlin, Germany, 173-190. Also, Tech. Rep. MIT-LCS-TR-856, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA.
34. LYNCH, N. AND SHVARTSMAN, A. 2002. RAMBO: A reconfigurable atomic memory service for dynamic networks. In Distributed Computing (Proceedings of the 16th International Symposium on DIStributed Computing (DISC) (Toulouse, France)), D. Malkhi, Ed. Lecture Notes in Computer Science, vol. 2508. Springer-Verlag, Berlin, Germany, 173-190. Also, Tech. Rep. MIT-LCS-TR-856, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA.
35. LYNCH, N. A. 1996. Distributed Algorithms. Morgan-Kaufmann, San Francisco, CA.
36. LYNCH, N. A. AND TUTTLE, M. R. 1989. An introduction to input/output automata. CWI-Quart. 2, 3 (Sept.), 219-246. Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands. Tech. Memo MIT/LCS/TM-373. Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, November 1988. Also: Hierarchical correctness proofs for distributed algorithms. In Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing (Vancouver, B.C., Canada, Aug. 1987). ACM Press, New York, NY, 137-151.
37. LYNCH, N. A. AND TUTTLE, M. R. 1989. An introduction to input/output automata. CWI-Quart. 2, 3 (Sept.), 219-246. Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands. Tech. Memo MIT/LCS/TM-373. Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, November 1988. Also: Hierarchical correctness proofs for distributed algorithms. In Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing (Vancouver, B.C., Canada, Aug. 1987). ACM Press, New York, NY, 137-151.
38. 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. Lecture Notes in Computer Science vol. 131. Springer-Verlag, Berlin, Germany (1981).
39. 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. Lecture Notes in Computer Science vol. 131. Springer-Verlag, Berlin, Germany (1981).
40. MANOLIOS, P. AND TREFLER, R. 2001. Safety and liveness in branching time. In Proceedings of the IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, CA. (Boston, MA).
41. PFLEEGER, C. 1989. Security in Computing. Prentice-Hall, Englewood Cliffs, NJ. USA.
42. 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 Press, New York, NY, 179-190.
43. 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, Germany, 652-671.
44. SCHNEIDER, F. 1984. Byzantine generals in action: Implementing fail-stop processors. ACM Trans. Comput. Syst. 2, 2 (May), 145-154.
45. SCHNEIDER, F. 1990. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Comput. Surv. 22, 4 (Dec.), 299-319.
46. SILBERSCHATZ, A. AND GALVIN, P. 1994. Operating System Concepts. Addison-Wesley, Reading, MA.
47. TANENBAUM, A. S. 1987. Operating Systems, Design and Implementation. Prentice-Hall, Englewood Cliffs, NJ.
48. WELCH, J. AND LYNCH, N. 1993. A modular Drinking Philosophers algorithm. Distrib. Comput. 6, 4 (July), 233-244.
49. WONG-TOI, H. AND DILL, D. 1990. Synthesizing processes and schedulers from temporal specifications. In Computer Aided Verification. Lecture Notes in Computer Science, vol. 531. Springer-Verlag, Berlin, Germany, 272-281.