A fully abstract may testing semantics for concurrent objects

DOI10.1016/J.TCS.2004.10.012zbMath1078.68107OpenAlexW2167290885MaRDI QIDQ557787

Julian Rathke, Alan Jeffrey

Publication date: 30 June 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.10.012

zbMATH Keywords

Full abstractionConcurrencyObject calculus

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (9)

A theory of bisimulation for a fragment of concurrent ML with local names ⋮ Behavioral interface description of an object-oriented language with futures and promises ⋮ Abstraction for concurrent objects ⋮ Higher-order linearisability ⋮ Complete trace models of state and control ⋮ Fully abstract trace semantics for protected module architectures ⋮ Unnamed Item ⋮ Abstract interface behavior of object-oriented languages with monitors ⋮ A Chart Semantics for the Pi-Calculus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Domain theory in logical form
• A calculus of mobile processes. II
• LCF considered as a programming language
• Fully abstract models of typed \(\lambda\)-calculi
• Full abstraction in the lazy lambda calculus
• A fully abstract model for the \(\pi\)-calculus.
• A fully abstract denotational semantics for the \(\pi\)-calculus
• On full abstraction for PCF: I, II and III
• Full abstraction for PCF
• Trace and testing equivalence on asynchronous processes
• Typed behavioural equivalences for processes in the presence of subtyping
• A Theory of Communicating Sequential Processes
• A theory of weak bisimulation for Core CML
• Barbed bisimulation
• First-order axioms for asynchrony
• A calculus for concurrent objects

This page was built for publication: A fully abstract may testing semantics for concurrent objects