Advertisement

A new class of high level programs for distributed computing systems

  • S. Ramesh
  • S. L. Mehndiratta
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 206)

Keywords

Auxiliary Variable Operational Semantic Process Code Local Component Verification Condition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Apt, K. R., Formal justification of a proof system for communicating sequential processes, Journal of the ACM, Vol. 30, No. 1 (1983).Google Scholar
  2. 2.
    Apt, K. R., Francez, N. and de Rover, W. P., A proof system for communicating sequential processes, ACM TOPLAS, Vol. 2, No. 3 (1980).Google Scholar
  3. 3.
    Back, R. J. R. and Kurki-Suonio, R., Decentralization of process nets with centralized control, Proc. of 2nd ACM Conf. on PODC, Montreal, August 1983.Google Scholar
  4. 4.
    Back, R. J. R. and Kurki-Suonio, R., Cooperation in Distributed Systems Using Symmetric Multi-Process Handshaking, Technical Report, Ser. A, No. 34, Abo Akademi, Finland, 1984.Google Scholar
  5. 5.
    Back, R. J. R., Ekulund, P. and Kurki-Suonio, R., A Fair and Efficient Implementation of CSP with Output Guards, Technical Report, Ser. A, No. 38, Abo Akademi, Finland, 1984.Google Scholar
  6. 6.
    Buckley, G. N. and Silberschatz, A., An effective implementation for the generalized input-output construct of CSP, ACM TOPLAS, Vol. 5, No. 2 (1983).Google Scholar
  7. 7.
    Chandy, K. M., Misra, J. and Hass, L. M., Distributed deadlock detection, ACM TOPLAS, Vol. 1, No. 2 (1983).Google Scholar
  8. 8.
    Chandy, K. M., Paradigm for distributed computing, Rec. of 3rd Conf. on FST-TCS, Bangalore, December 1983.Google Scholar
  9. 9.
    Chang, E. J. H., Echo algorithms: Depth parallel operations on general graphs, IEEE-TSE, Vol. SE-8, No. 4 (1980).Google Scholar
  10. 10.
    Dijkstra, E. W. D., A Discipline of Programming, Prentice-Hall, Englewood Cliffs, 1976.Google Scholar
  11. 11.
    Donahue, J. E., Complementary Definition of Programming Language Semantics — LNCS 42, Springer-Verlag, Berlin, 1976.Google Scholar
  12. 12.
    Elrad, Tz. and Francez, N., Decomposition of distributed programs into communication closed layers, Science of Computer Programming, Vol. 2 (1982).Google Scholar
  13. 13.
    Francez, N. and Hailpern, B., Script: A communication abstraction mechanism, Proc. of 2nd ACM Conf. on PODC, Montreal, August 1983.Google Scholar
  14. 14.
    Hoare, C. A. R., Communicating sequential processes, Communication of the ACM, Vol. 21, No. 8 (1978).Google Scholar
  15. 15.
    Levin, G. and Gries, D. Proof techniques for communicating sequential processes, Acta Informatica, Vol. 15 (1981).Google Scholar
  16. 16.
    Manna, Z., A Mathematical Theory of Computation, McGraw-Hill, Kogakusha Ltd., Tokyo, 1974.Google Scholar
  17. 17.
    Moitra, A., Synthesis of communicating processes, Proc. of 2nd ACM Conf. on PODC, Montreal, August 1983.Google Scholar
  18. 18.
    Plotkin, G. D., An operational semantics of CSP, In: D. Bjorner (Ed.), Proc. of IFIP Conf. on Formal Description of Programming Concepts-II, North Holland Pub. Co., Amsterdam, 1983.Google Scholar
  19. 19.
    Prasad, V. R., Derivation of Distributed Programs from Sequential Programs, Technical Report, TR 87, T.I.F.R., Bombay, August 1983.Google Scholar
  20. 20.
    Ramesh, S. and Mehndiratta, S. L., A methodology for developing distributed programs, Submitted for publication.Google Scholar
  21. 21.
    Ramesh, S., Programming with Shared Actions: A Methodology for Developing Distributed Programs, Ph.D. Thesis to be submitted to I. I. T., Bombay.Google Scholar
  22. 22.
    Schwartz, J. S., Distributed Synchronization of Communicating Sequential Processes, Technical Report, DAI TR 56, Department of A. I., University of Edinburgh.Google Scholar
  23. 23.
    Taubenfeld, G. and Francez, N., Proof rules for communication abstraction, Proc. of 4th Conf. on FST-TCS, LNCS 181, Springer-Verlag, Berlin, 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • S. Ramesh
    • 1
  • S. L. Mehndiratta
    • 1
  1. 1.Department of Computer Science and EngineeringIndian Institute of Technology PowaiBombayIndia

Personalised recommendations