Undecidable verification problems for programs with unreliable channels
From MaRDI portal
Publication:675223
DOI10.1006/INCO.1996.0083zbMATH Open0872.68112DBLPjournals/iandc/AbdullaJ96aOpenAlexW2017872109WikidataQ62638448 ScholiaQ62638448MaRDI QIDQ675223FDOQ675223
Bengt Jonsson, Parosh A. Abdulla
Publication date: 6 March 1997
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1996.0083
Recommendations
Cited In (33)
- A classification of the expressive power of well-structured transition systems
- Reachability problems on reliable and lossy queue automata
- Deciding properties of integral relational automata
- Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness
- Undecidability of accordance for open systems with unbounded message queues
- Communication errors in the \(\pi\)-calculus are undecidable
- Undecidable verification problems for programs with unreliable channels
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Simulating perfect channels with probabilistic lossy channels
- Ensuring completeness of symbolic verification methods for infinite-state systems
- Undecidable problems in unreliable computations.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Verifying lossy channel systems has nonprimitive recursive complexity.
- Title not available (Why is that?)
- Algorithmic analysis of programs with well quasi-ordered domains.
- Decidability of liveness for concurrent objects on the TSO memory model
- Verification of programs with half-duplex communication
- Quantitative analysis of probabilistic lossy channel systems
- Verification of probabilistic systems with faulty communication
- Computable fixpoints in well-structured symbolic model checking
- Model checking of systems with many identical timed processes
- Value-passing CCS with noisy channels
- Forward Analysis and Model Checking for Trace Bounded WSTS
- The ω-Regular Post Embedding Problem
- Title not available (Why is that?)
- On termination and invariance for faulty channel machines
- Title not available (Why is that?)
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)
