Full Abstraction for Linda

DOI10.1007/978-3-540-78739-6_6zbMath1133.68307OpenAlexW1855927527MaRDI QIDQ5458387

Cinzia Di Giusto, Maurizio Gabbrielli

Publication date: 11 April 2008

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78739-6_6

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• A process algebraic view of Linda coordination primitives
• On bisimulations for the asynchronous \(\pi\)-calculus
• Fully abstract denotational models for nonuniform concurrent languages
• Trace and testing equivalence on asynchronous processes
• Full abstraction for a shared-variable parallel language
• Full abstraction for polymorphic \(\pi \)-calculus
• Generative communication in Linda
• Programming Languages and Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Full Abstraction for Linda