A fully abstract may testing semantics for concurrent objects (Q557787): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Full abstraction in the lazy lambda calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domain theory in logical form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Full abstraction for PCF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trace and testing equivalence on asynchronous processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theory of Communicating Sequential Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4715213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus for concurrent objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of weak bisimulation for Core CML / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully abstract model for the \(\pi\)-calculus. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully abstract denotational semantics for the \(\pi\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Typed behavioural equivalences for processes in the presence of subtyping / rank
 
Normal rank
Property / cites work
 
Property / cites work: On full abstraction for PCF: I, II and III / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully abstract models of typed \(\lambda\)-calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4248252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus of mobile processes. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Barbed bisimulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: LCF considered as a programming language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3959414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order axioms for asynchrony / rank
 
Normal rank

Revision as of 13:07, 10 June 2024

scientific article
Language Label Description Also known as
English
A fully abstract may testing semantics for concurrent objects
scientific article

    Statements

    A fully abstract may testing semantics for concurrent objects (English)
    0 references
    0 references
    0 references
    30 June 2005
    0 references
    Object calculus is a minimal language for modelling object-based programming. Concurrent object calculus is a version of it dealing with concurrent objects. On this base the authors define a may testing preorder for concurrent object components. It is characterised by a trace semantics inspired by UML interaction diagrams and some of its properties are studied. It is shown that the trace semantics is fully abstract for may testing. This is the first result of this kind for a concurrent object language. In addition, the paper contains interesting directions for future research.
    0 references
    Object calculus
    0 references
    Full abstraction
    0 references
    Concurrency
    0 references

    Identifiers