Store locally, prove globally

DOI10.1007/978-3-031-47963-2_21MaRDI QIDQ6605367

Nadine Karsten, Uwe Nestmann

Publication date: 13 September 2024

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Revisiting sequential composition in process calculi
• Algebra of communicating processes with abstraction
• A theory of processes with localities
• Mobile ambients
• A Process Algebra for Wireless Mesh Networks
• Formal Verification of Distributed Algorithms
• The Applied Pi Calculus
• A Distributed Pi-Calculus
• Unreliable failure detectors for reliable distributed systems
• From LOTOS to LNT
• CONCUR 2004 - Concurrency Theory
• A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract)
• Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
• CONCUR 2003 - Concurrency Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Store locally, prove globally