A fully abstract may testing semantics for concurrent objects

DOI10.1016/J.TCS.2004.10.012MaRDI QIDQ557787zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

ConcurrencyFull abstractionObject 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)

Recommendations

• Formal Methods for Components and Objects
• Locally abstract, globally concrete semantics of concurrent programming languages
• scientific article; zbMATH DE number 1479607
• Full abstraction at package boundaries of object-oriented languages
• scientific article; zbMATH DE number 1231464

Cites work

• scientific article; zbMATH DE number 3780545 (Why is no real title available?)
• scientific article; zbMATH DE number 48630 (Why is no real title available?)
• scientific article; zbMATH DE number 1231693 (Why is no real title available?)
• scientific article; zbMATH DE number 1296290 (Why is no real title available?)
• scientific article; zbMATH DE number 944097 (Why is no real title available?)
• A Theory of Communicating Sequential Processes
• A calculus for concurrent objects
• A calculus of mobile processes. II
• A fully abstract denotational semantics for the \(\pi\)-calculus
• A fully abstract model for the \(\pi\)-calculus.
• A theory of weak bisimulation for Core CML
• Barbed bisimulation
• Domain theory in logical form
• First-order axioms for asynchrony
• Full abstraction for PCF
• Full abstraction in the lazy lambda calculus
• Fully abstract models of typed \(\lambda\)-calculi
• LCF considered as a programming language
• On full abstraction for PCF: I, II and III
• Trace and testing equivalence on asynchronous processes
• Typed behavioural equivalences for processes in the presence of subtyping

Cited in

(17)

• Complete trace models of state and control
• A chart semantics for the pi-calculus
• Behavioral interface description of an object-oriented language with futures and promises
• Theoretical Aspects of Computing - ICTAC 2004
• Formal Methods for Components and Objects
• A theory of bisimulation for a fragment of concurrent ML with local names
• Fully abstract trace semantics for protected module architectures
• Abstraction for concurrent objects
• Higher-order linearisability
• Locally abstract, globally concrete semantics of concurrent programming languages
• Axiomatic characterization of trace reachability for concurrent objects
• Logical Approaches to Computational Barriers
• Formal Methods for Components and Objects
• Full abstraction at package boundaries of object-oriented languages
• Abstract interface behavior of object-oriented languages with monitors
• Higher-order linearisability
• Abstract interface behavior of object-oriented languages with monitors

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)