A compositional approach to superimposition

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn Part F130193, Issue , 1988, Pages 240-249

  Bougé, Luc ^a,b   Frances, Nissim ^c  

^a LIENS   (France)

^b UNIVERSITÉ D'ORLÉANS   (France)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Compositionality; Concurrent programming; Distributed programming; Semantics; Superimposition

Indexed keywords

COMPUTER PROGRAMMING; SEMANTICS;

COMPOSITIONALITY; CONCURRENT PROGRAMMING; CONCURRENT PROGRAMMING STRUCTURES; DISTRIBUTED PROGRAMMING; LANGUAGE CONSTRUCTS; PROCESS MANAGEMENT; SUPERIMPOSITION; SYNTACTIC REPRESENTATION;

CONCURRENCY CONTROL;

EID: 84976842405     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/73560.73581     Document Type: Conference Paper

References (31)

1. K. Apt, "Correctness proofs of distributed termination algorithms", Logics and models of concurrent systems, (K.R. Apt, ed.), Nato ASI series F, Vol. 13, Springer Verlag, pp. 147-168, 1985.
2. K.R. Apt, L. Bougć, Ph. Clermont, "Two normal form theorems for CSP programs", to appear in IPL.
3. K.R. Apt, Ph. Clermont, "Two normal forme theorems for CSP programs", Rept. No. RC 10975, IBM Research Center, Yorktown Heights, N.Y., Febr. 1985.
4. K.R. Apt, N. Francez, "Modeling the distributed termination convention of CSP", ACM-TOPLAS 6, 3, pp. 370-379, July 1984.
5. R. Back, R. Kurki-Suonio, "Decentralization of process nets with centralized control", 2nd ACM-PODC, Montreal, Canada, August 1983.
6. R. Back, R. Kurki-Suonio, "Serializability in distributed systems with handshaking", Rept. No. CMU-CS-85-109, Dept. Comp. Science, CMU, Pittsburgh, 1985.
7. L. Boug6, "Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP", TCS 49, pp. 145-169, 1987.
8. L. Bouge "Symmetry and genericity for CSP distributed systems", Rept. No. 85-32, LITP, Univ. Paris 7, May 1985.
9. G.N. Buckley, A. Silberschatz, "An effective implementation for the generalized input/output construct of CSP", ACM-TOPLAS 5, 2, pp. 112-235, April 1983.
10. A. Charles worth, "The multiway rendezvous", ACM-TOPLAS 9, 2, pp. 350-366, July 1987.
11. K.M. Chandy, L. Lamport, "Distributed snapshots determining global states of distributed systems", ACM-TOCS 3, 1, pp. 63-75, 1985.
12. K.M. Chandy, J. Misra, "A paradigm for detecting quiescent properties in distributed computations", Logics and models of concurrent systems, (K.R. Apt, ed.), Nato ASI series F, Vol. 13, Springer Verlag, 1985.
13. K.M. Chandy, J. Misra, "How processes learn", Distributed Computing 1, pp. 40-52, 1986.
14. E.W. Dijkstra, W.H.J. Feijen, A.J.M. van Gasteren, "Derivation of a termination detection algorithm for distributed computations", IPL 16, pp. 217-219, 1983.
15. E.W. Dijkstra, C.S. Scholten, "Termination detection for diffusing computations", IPL 11, 1, pp. 1-4, 1980.
16. Tz. Elrad, N. Francez, "Decomposition of distributed programs into communication closed layers", SCP 2, pp. 155-173, December 1982.
17. N. Francez, "Distributed termination", ACM-TOPLAS 2, 1, pp. 42-55, January 1980.
18. I.R. Forman, "On the design of large distributed systems", Rept. No. MCC/STP-098-86 (rev. l), MCC, Austin, Tx., Jan. 1987. Also in Proc. l" int. conf. on computer languages, Miami, FL, Oct. 1986.
19. N. Francez, B. Hailp ern, G. Taubenfeld, "Script, a communication abstraction mechanism and its verification", Logics and models of concurrent systems, (K.R. Apt, ed.), Nato ASI series F, Vol. 13, Springer Verlag, 1985.
20. N. Francez, M. Rodeh, "A distributed abstract data type implemented by a probabilistic communication scheme", Proc. 21" FOCS, Syracuse, N.Y., October 1980.
21. N. Francez, M. Rodeh, "Achieving distributed termination without freezing", IEEE-TSE 8, 3, pp. 287-292, May 1982.
22. E. Gafni, "Perspectives on distributed networks protocols: A case for building blocks", Proc. MLLCOM 86, Monterey, Ca., October 1986.
23. R.G. Gallager, R.A. Humblet, P.M. Spira, "A distributed algorithm for minimum-weight spanning trees," IEEE Trans, on Communications 31, 6, pp. 756-762, 1983.
24. C.A.R. Hoare, "Communicating sequential processes", CACM21, 8, pp. 666-678, August 1978.
25. S. Katz, "A superimposition control construct for distributed systems", Techn. Rept., MCC-STP, MCC, Austin, Tx., August 1987.
26. E. Korach, S. Kutten, S. Moran, "A modular technique for the design of efficient distributed leader finding algorithms", Proc. 4th ACM-PODC Symp., Minaki, Ontario, Canada, August 1985.
27. J.S. Schwarz, "Distributed synchronisation of communicating sequential processes", Techn. Rept., Dept. Artificial Intelligence, Univ. Edinburgh, July 1978.
28. L. Shrira, N. Francez, "A program transformation regarded as a proof transformation", submitted for publication, 1985.
29. F.A. Stomp, W.P. de Roever, "A correctness proof of a distributed minimum-weight spanning tree algorithm", Rept. No. 87-4, Dept. Informatics, Nimegen Univ., April 1987. Submitted for publication, January 1987.
30. N. Shavit, N. Francez, "A new approach to detection of totally indicative stability", Proc. 13th ICALP, Rennes, France, July 1986, Lect. Notes Comp. Science 226, Springer-Verlag, 1986.
31. G. Tel, R.B. Tan, J. van Leeuwen, "The derivation of graph marking algorithms form distributed termination detection algorithms", Rept. No. RUU-CS-86-11, Univ. Utrecht, August 1986.