A fully abstract may testing semantics for concurrent objects
From MaRDI portal
Publication:557787
DOI10.1016/J.TCS.2004.10.012zbMATH Open1078.68107OpenAlexW2167290885MaRDI QIDQ557787FDOQ557787
Authors: Alan Jeffrey, Julian Rathke 
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
Recommendations
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Domain theory in logical form
- LCF considered as a programming language
- On full abstraction for PCF: I, II and III
- Full abstraction for PCF
- Title not available (Why is that?)
- Title not available (Why is that?)
- A calculus of mobile processes. II
- Title not available (Why is that?)
- A Theory of Communicating Sequential Processes
- Barbed bisimulation
- Title not available (Why is that?)
- A fully abstract model for the \(\pi\)-calculus.
- Full abstraction in the lazy lambda calculus
- A theory of weak bisimulation for Core CML
- Fully abstract models of typed \(\lambda\)-calculi
- A fully abstract denotational semantics for the \(\pi\)-calculus
- Trace and testing equivalence on asynchronous processes
- Typed behavioural equivalences for processes in the presence of subtyping
- Title not available (Why is that?)
- First-order axioms for asynchrony
- A calculus for concurrent objects
Cited In (16)
- Higher-order linearisability
- Abstract interface behavior of object-oriented languages with monitors
- Abstract interface behavior of object-oriented languages with monitors
- Complete trace models of state and control
- Fully abstract trace semantics for protected module architectures
- Logical Approaches to Computational Barriers
- Theoretical Aspects of Computing - ICTAC 2004
- Behavioral interface description of an object-oriented language with futures and promises
- Abstraction for concurrent objects
- Locally abstract, globally concrete semantics of concurrent programming languages
- Full abstraction at package boundaries of object-oriented languages
- A theory of bisimulation for a fragment of concurrent ML with local names
- A chart semantics for the pi-calculus
- Formal Methods for Components and Objects
- Higher-order linearisability
- Formal Methods for Components and Objects
This page was built for publication: A fully abstract may testing semantics for concurrent objects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557787)
