A modular framework for verifying versatile distributed systems
From MaRDI portal
Publication:2011199
Recommendations
Cites work
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 4001464 (Why is no real title available?)
- scientific article; zbMATH DE number 1390334 (Why is no real title available?)
- A generic framework for \(n\)-protocol compatibility checking
- A hierarchy of communication models for message sequence charts
- A modular framework for verifying versatile distributed systems
- Active and Concurrent Topology Maintenance
- CCS with priority choice
- Deciding choreography realizability
- Distributed Computing
- Distributed network protocols
- Formalizing web service choreographies
- Introduction to Distributed Algorithms
- Occam—A programming language for multiprocessor systems
- On Communicating Finite-State Machines
- On the diversity of asynchronous communication
- Priorities in process algebras
- Synchronous, asynchronous, and causally ordered communication
- The Heard-Of model: computing in distributed systems with benign faults
- The PlusCal Algorithm Language
- Time, clocks, and the ordering of events in a distributed system
- \textsc{PSync}: a partially synchronous language for fault-tolerant distributed algorithms
Cited in
(5)- Preface to the special issue on formal approaches to parallel and distributed systems 2018
- Theorem Proving in Higher Order Logics
- scientific article; zbMATH DE number 1533829 (Why is no real title available?)
- A modular framework for verifying versatile distributed systems
- Protocol combinators for modeling, testing, and execution of distributed systems
This page was built for publication: A modular framework for verifying versatile distributed systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011199)
