Undecidable verification problems for programs with unreliable channels
From MaRDI portal
Recommendations
Cited in
(37)- A classification of the expressive power of well-structured transition systems
- Reachability problems on reliable and lossy queue automata
- Mixing Lossy and Perfect Fifo Channels
- Deciding properties of integral relational automata
- Undecidability of accordance for open systems with unbounded message queues
- Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness
- Communication errors in the \(\pi\)-calculus are undecidable
- Undecidable verification problems for programs with unreliable channels
- Unidirectional channel systems can be tested
- Forward analysis and model checking for trace bounded WSTS
- Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties
- \(\pi\)-calculus with noisy channels
- Unreliable channels are easier to verify than perfect channels
- Forward analysis and model checking for trace bounded WSTS
- scientific article; zbMATH DE number 1512704 (Why is no real title available?)
- scientific article; zbMATH DE number 2086244 (Why is no real title available?)
- Forward analysis for WSTS. III: Karp-Miller trees
- Simulating perfect channels with probabilistic lossy channels
- On reachability for unidirectional channel systems extended with regular tests
- Undecidable problems in unreliable computations.
- scientific article; zbMATH DE number 7440191 (Why is no real title available?)
- Ensuring completeness of symbolic verification methods for infinite-state systems
- scientific article; zbMATH DE number 2242597 (Why is no real title available?)
- Verifying lossy channel systems has nonprimitive recursive complexity.
- Algorithmic analysis of programs with well quasi-ordered domains.
- scientific article; zbMATH DE number 1929967 (Why is no real title available?)
- Verification of programs with half-duplex communication
- Quantitative analysis of probabilistic lossy channel systems
- Decidability of liveness for concurrent objects on the TSO memory model
- Data communicating processes with unreliable channels
- Verification of probabilistic systems with faulty communication
- Computable fixpoints in well-structured symbolic model checking
- Value-passing CCS with noisy channels
- Model checking of systems with many identical timed processes
- The ω-Regular Post Embedding Problem
- scientific article; zbMATH DE number 1564050 (Why is no real title available?)
- On termination and invariance for faulty channel machines
This page was built for publication: Undecidable verification problems for programs with unreliable channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675223)
