A Superimposition Control Construct for Distributed Systems

ACM Transactions on Programming Languages and Systems (TOPLAS)

Volumn 15, Issue 2, 1993, Pages 337-356

  Katz, Shmuel ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

control construct; distributed programming; formal and actual processes; modularity; roletype; superimposition

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTER PROGRAMMING LANGUAGES; CONTROL; DISTRIBUTED COMPUTER SYSTEMS;

CONCURRENT PROGRAMMING; CONTROL CONSTRUCT; DISTRIBUTED PROGRAMMING; FORMAL AND ACTUAL PROCESSES; MODULARITY; ROLETYPES; SUPERIMPOSITION;

COMPUTER PROGRAMMING;

EID: 0027577162     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/169701.169682     Document Type: Article

References (24)

1. APT. K. R., AND CLERMONT, PH. TWO normal form theorems for CSP programs. RC 10975, IBM, T. J. Watson Research Center, Yorktown Heights, N.Y., Feb. 1985.
2. BACK, R. J. R., AND KURKI-SUONIO, R. Decentralization of process nets with centralized control. Dist. Comput., 3, Springer-Verlag, Berlin, Germany (1989), 73-87.
3. BOUGE, L., AND FRANCEZ, N. A compositional approach to superimposition. In Proceedings of ACM POPL88 Symposium (Jan. 1988).
4. CHANDY, K. M., AND LAMPORT, L. Distributed snapshots: Determining global states of distributed systems. ACM Trans. Comput. Syst., 3, 1 (Feb. 1985), 63-75.
5. CHANDY, K. M., AND MISRA, J. An example of stepwise refinement of distributed algorithms: Quiescence detection. ACM 8, 3 (July 1986), 326-343.
6. CHANDY, K. M., AND MISRA, J. Parallel Program Design: A Foundation. Addison-Wesley, Reading, Mass., 1988.
7. CHANDY, K. M., MISRA, J., AND HAAS, L. Distributed deadlock detection. ACM Trans. Comput. Syst., 1, 2, (May 1983), 144-156.
8. DIJKSTRA, E. W., AND SCHOLTEN, C. S. Termination detection for diffusing computations. Inf. Process. Lett., 11, 1, North-Holland, New York (Aug. 1980), 1-4.
9. DOLEV, D., AND SHAVIT, N. Bounded concurrent time-stamp systems are constructible. Proceedings of 21st ACM Symposium on Theory of Computing (May 1989), 454-466.
10. DONAHUE, J. E. Complementary definitions of programming language semantics. LNCS 42, Springer-Verlag, New York, 1976.
11. ELRAD, T., AND FRANCEZ, N. Decomposition of distributed programs into communication closed layers. Sci. Comput. Program. 2, 2 (1982), 155-173.
12. FORMAN, I. On the design of large distributed systems. MCC Tech. Rep. STP-098-86 (rev. 1.0), Jan. 1987. Preliminary version in Proceedings of International Conference on Computer Languages, (Miami Beach, Fla., Oct. 1986).
13. FRANCEZ, N. Distributed termination. ACM Trans. Program. Lang. Syst., 2, 1 (Jan. 1980), 42-55.
14. FRANCEZ, N., HALPERN, B., AND TAUBENFELD, G. Script: A communication abstraction mechanism and its verification. Sci. Comput. Program., 6 (1986), 35-88.
15. GERTH, R., AND SHRIRA, L. On proving communication closedness of distributed layers. In Proceedings of the 6th Conference on Foundations of Software Technology and Theoretical Computer Science (New Delhi, 1986), LNCS 241, K. V. Nori, Ed., 330-343.
16. HAREL, D., AND PNUELI, A. On the development of reactive systems. In Proceedings of Advanced Institute on Logics and Models for Verification and Specification of Concurrent Systems (La Colle Sur Loupe, Oct. 1984).
17. ISRAELI, A., AND LI, M. Bounded time stamps. In Proceedings of 18th IEEE FOCS Symposium, 1987, 371-382.
18. KATZ, S., AND PELED, D. Interleaving set temporal logic. Theor. Comput. Sci., 75 (1990), 263-287.
19. KATZ, S., AND SHMUELI, O. Cooperative distributed algorithms for dynamic cycle prevention. IEEE Trans. Softw. Eng. SE-13, 5 (May 1987), 540-552.
20. LAMPORT, L. Solved problems, unsolved problems, and non-problems in concurrency. In Proceedings of 3rd ACM PODC Symposium (Vancouver, 1984), 1-11.
21. LEHMANN, D., PNUELI, A., AND STAVI, J. Impartiality, justice, fairness: The ethics of concurrent termination. In The Proceedings of 8th ICALP (Acco, Israel, July 1981). LNCS 115, O. Kariv and S. Even, Eds., Springer-Verlag, 1981, 264-277.
22. LICHTENSTEIN, O., PNUELI, A., AND ZUCK, L. The glory of the past. In Logics of Programs Symposium, LNCS 193, Springer-Verlag, (New York, 1985), 196-218.
23. LISKOV, B., AND SCHEIFLER, R. Guardians and actions: Linguistic support for robust, distributed programs. ACM Trans. Program. Lang. Syst., 5, 3 (July 1983).
24. TOPOR, R. Termination detection for distributed computations. Inf. Process. Lett., 18 (Jan. 1984), 33-36.