Using bisimulation proof techniques for the analysis of distributed abstract machines (Q935472): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2085026104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficiency preorder for processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Methods for Open Object-Based Distributed Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5714432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mobile ambients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4415246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Techniques for Networked and Distributed Systems - FORTE 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4813226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear forwarders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confluence for process verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Distributed Pi-Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding recursion to Dpi / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of bisimulation for a fragment of concurrent ML with local names / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming Languages and Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Bisimulation Proofs for the Analysis of Distributed Abstract Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the bisimulation proof method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2734510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust, distributed references and acyclic garbage collection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of a Good But Not Linear Set Union Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nomadic pict / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confluence by decreasing diagrams / rank
 
Normal rank

Revision as of 13:13, 28 June 2024

scientific article
Language Label Description Also known as
English
Using bisimulation proof techniques for the analysis of distributed abstract machines
scientific article

    Statements

    Using bisimulation proof techniques for the analysis of distributed abstract machines (English)
    0 references
    0 references
    6 August 2008
    0 references
    weak bisimilarity
    0 references
    up-to techniques
    0 references
    process algebras
    0 references
    distributed abstract machines
    0 references
    forwarders
    0 references
    0 references
    0 references

    Identifiers