An Observational Semantics for Linda | SpringerLink
Skip to main content

An Observational Semantics for Linda

  • Conference paper
Structures in Concurrency Theory

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

  • 54 Accesses

Abstract

Linda has just four primitives, all of which are devoted to coordinating the interactions among programs by sharing information maintained in a common data space. To write programs manipulating data, it is necessary to embed Linda in a (functional, imperative, logic, etc.) programming language; this leads to a family of languages based on Linda. We define syntax and semantics for a member of the Linda family, L, that is obtained by embedding Linda in a “simple” sequential language. The semantics of this concurrent programming language is formalized by applying techniques developed within the framework of process algebras. A two-level semantics for L is provided: an operational one in Plotkin’s style, based on a transition system, and an observational one, based on three behavioural preorders, obtained by applying the testing framework to L.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Gelernter D. Generative Communication in Linda. ACM Transactions on Programming Languages and Systems 1985; 7 (1): 80–112

    Article  MATH  Google Scholar 

  2. Carriero N, Gelernter D. Linda in Context. Communications of the ACM 1989; 32 (4): 444–458

    Article  Google Scholar 

  3. Shapiro E. Concurrent Prolog: Collected Papers. The MIT Press, 1987

    Google Scholar 

  4. Chandy KM, Misra J. Parallel Program Design: a Foundation. Addison Wesley, Massachusetts, 1988

    MATH  Google Scholar 

  5. Brogi A, Ciancarini P. The concurrent language Shared Prolog. ACM Transactions on Programming Languages and Systems 1991; 13 (1): 99–123

    Article  Google Scholar 

  6. Gelernter D, Carriero N, Chandran S, et al. Parallel Programming in Linda. In: proc. of the Internatinal Conference on Parallel Programming (St. Charles, I11., Aug. ). IEEE, 1985, pp 255–263

    Google Scholar 

  7. Carriero N, Gelernter D, Leichter J. Distributed Data Structures in Linda. In: proc. of the ACM Symposium on Principles of Programming Languages (St. Petersburg, Fla., Jan.13-15). ACM, New York, 1986, pp 236–242

    Google Scholar 

  8. Ciancarini P, Yanchelevich D. Inside Linda. Technical Report, Yale University, Department of Computer Science, 1990

    Google Scholar 

  9. Butcher P. A behavioural semantics for Linda-2. Software Engineering Journal 1991; 6 (4): 196–204

    Article  MathSciNet  Google Scholar 

  10. Jensen KK. A Formal Linda Definition. Draft, February 1991

    Google Scholar 

  11. Ciancarini P, Jensen KK, Yankelevich D. The Semantics of a Parallel Language based on a Shared Data Space. Technical Report: TR-26/92, Dipartimento di Informatica, Università di Pisa, 1992

    Google Scholar 

  12. Plotkin GD. A Structural Approach to Operational Semantics. Technical Report DAIMI FN-19, Aarhus University, Dep. of Computer Science, Denmark, 1981

    Google Scholar 

  13. Bergstra J, Klop JW. Process Algebra for Synchronous Communication. Infor-mation and Control 1984; 60: 109–137

    Article  MATH  MathSciNet  Google Scholar 

  14. Hennessy M. Algebraic Theory of Processes. The MIT Press, 1988

    Google Scholar 

  15. Hoare CAR. Communicating Sequential Processes. Prentice-Hall Int., 1985

    Google Scholar 

  16. Milner R. Communication and Concurrency. Prentice Hall International, 1989

    Google Scholar 

  17. De Nicola R, Pugliese R. Testing Linda: an Observational Semantics for an Asynchronous Language. Research Report: SI/RR - 94/06, Dipartimento di Scienze dell’Informazione, Università di Roma “La Sapienza”, 1994

    Google Scholar 

  18. Baeten JCM, Vandrager FM. An Algebra for Process Creation. Acta Informatica 1992; 29 (4): 303–334

    Article  MATH  MathSciNet  Google Scholar 

  19. De Nicola R, Hennessy MCB. Testing Equivalence for Processes. Theoretical Computers Science 1984; 34: 83–133

    Article  MATH  Google Scholar 

  20. de Boer FS, Kok JN, Palamidessi C, et al. The Failure of Failures in a Paradigm for Asynchronous Communication. In: proc. of Concur ’91. Springer-Verlag, 1991, pp 111–126 (Lecture Notes in Computer Science no.527)

    Google Scholar 

  21. Goossens KGW. Reasoning about VHDL Using Operational and Observational Semantics. Research Report: SI/RR - 95/06, Dipartimento di Scienze dell’Informazione, Università di Roma “La Sapienza”, 1995

    Google Scholar 

  22. The Institute of Electrical and Electronics Engineers. IEEE Standard VHDL Language Reference Manual. IEEE std 1076–1993 edition, 1993

    Google Scholar 

  23. Ladner RE, Fisher MJ. Parallel Prefix Computation. Journal of the ACM 1980; 27 (4): 831–838

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1995 British Computer Society

About this paper

Cite this paper

De Nicola, R., Pugliese, R. (1995). An Observational Semantics for Linda. In: Desel, J. (eds) Structures in Concurrency Theory. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3078-9_9

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3078-9_9

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19982-3

  • Online ISBN: 978-1-4471-3078-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics