Verification of distributed programs using representative interleaving sequences
From MaRDI portal
Recommendations
- Verification by construction of distributed algorithms
- Formal Verification of Distributed Algorithms
- On a Verification Framework for Certifying Distributed Algorithms: Distributed Checking and Consistency
- Publication:4733386
- Structuring and verifying distributed algorithms
- Verifying the correctness of distributed systems via mergeable parallelism
- Concurrency based transition refinement for the verification of distributed algorithms
- An automata-theoretic approach to the verification of distributed algorithms
Cites work
- scientific article; zbMATH DE number 4153903 (Why is no real title available?)
- scientific article; zbMATH DE number 3911691 (Why is no real title available?)
- scientific article; zbMATH DE number 3963175 (Why is no real title available?)
- scientific article; zbMATH DE number 3982506 (Why is no real title available?)
- scientific article; zbMATH DE number 4085006 (Why is no real title available?)
- scientific article; zbMATH DE number 4108727 (Why is no real title available?)
- scientific article; zbMATH DE number 3735115 (Why is no real title available?)
- scientific article; zbMATH DE number 177237 (Why is no real title available?)
- scientific article; zbMATH DE number 177840 (Why is no real title available?)
- A Proof System for Communicating Sequential Processes
- A proof rule for fair termination of guarded commands
- Alternative semantics for temporal logics
- Appraising fairness in languages for distributed programming
- Communicating sequential processes
- Decomposition of distributed programs into communication-closed layers
- Defining liveness
- Event fairness and non-interleaving concurrency
- Guarded commands, nondeterminacy and formal derivation of programs
- Interleaving set temporal logic
- Proving Liveness Properties of Concurrent Programs
- “Sometimes” and “not never” revisited
Cited in
(19)- A pragmatic approach to stateful partial order reduction
- Formal communication elimination and sequentialization equivalence proofs for distributed system models
- On equivalence-completions of fairness assumptions
- Adding partial orders to linear temporal logic
- On Stubborn Sets in the Verification of Linear Time Temporal Properties
- An application of temporal projection to interleaving concurrency
- scientific article; zbMATH DE number 4119602 (Why is no real title available?)
- Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods
- Detecting causal relationships in distributed computations: In search of the holy grail
- On projective and separable properties
- An input/output semantics for distributed program equivalence reasoning
- A proof system for distributed processes
- Verification of distributed programs of the SPMD-type on the basis of the \(L\)-programs formalism
- On stubborn sets in the verification of linear time temporal properties
- Trace consistency and inevitability
- Combining static analysis and case-based search space partitioning for reducing peak memory in model checking
- An algorithmic approach for checking closure properties of Ω-regular languages
- Proving partial order properties
- An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages
This page was built for publication: Verification of distributed programs using representative interleaving sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1200917)
