Verifying programs with unreliable channels
From MaRDI portal
Recommendations
Cited in
(92)- A classification of the expressive power of well-structured transition systems
- A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations
- Reachability problems on reliable and lossy queue automata
- Mixing Lossy and Perfect Fifo Channels
- Conversation protocols: a formalism for specification and verification of reactive electronic services
- Deciding properties of integral relational automata
- Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness
- Verification of Communication Protocols Using Abstract Interpretation of FIFO Queues
- Counter machines and verification problems.
- The Parametric Complexity of Lossy Counter Machines
- Undecidable verification problems for programs with unreliable channels
- Expired data collection in shared dataspaces.
- Eliminating the storage tape in reachability constructions.
- Ideal abstractions for well-structured transition systems
- Guessing the buffer bound for k-synchronizability
- On the Reachability Analysis of Acyclic Networks of Pushdown Systems
- Reachability as derivability, finite countermodels and verification
- Forward analysis and model checking for trace bounded WSTS
- Well (and better) quasi-ordered transition systems
- Verification in loosely synchronous queue-connected discrete timed automata.
- The decidability of verification under PS 2.0
- Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
- Non-deterministic transducer models of retransmission protocols over noisy channels
- Rational, recognizable, and aperiodic sets in the partially lossy queue monoid
- A Sound Algorithm for Asynchronous Session Subtyping
- Verification of a multidestination selective repeat procedure
- \(\pi\)-calculus with noisy channels
- Verification of flat FIFO systems
- Unreliable channels are easier to verify than perfect channels
- Forward analysis and model checking for trace bounded WSTS
- An extension of lazy abstraction with interpolation for programs with arrays
- Forward analysis for WSTS, part I: completions
- scientific article; zbMATH DE number 1863156 (Why is no real title available?)
- Stochastic Games with Lossy Channels
- Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols
- scientific article; zbMATH DE number 2086244 (Why is no real title available?)
- Automated formal analysis and verification: an overview
- Tutorial on parameterized model checking of fault-tolerant distributed algorithms
- Parameterized verification of coverability in infinite state broadcast networks
- Refinement-Based Verification of Communicating Unstructured Code
- Existential Definability over the Subword Ordering
- Well-structured transition systems everywhere!
- Simulating perfect channels with probabilistic lossy channels
- Parameterized Verification of Communicating Automata under Context Bounds
- Undecidable problems in unreliable computations.
- Ensuring completeness of symbolic verification methods for infinite-state systems
- Guessing the Buffer Bound for k-Synchronizability
- The two-phase commitment protocol in an extended \(\pi\)-calculus
- Monotonic Abstraction in Action
- Cardinality constraints for arrays (decidability results and applications)
- Multiparty half-duplex systems and synchronous communications
- A Kleene theorem and model checking algorithms for existentially bounded communicating automata
- Verifying lossy channel systems has nonprimitive recursive complexity.
- Parameterized broadcast networks with registers: from NP to the frontiers of decidability
- Some complexity results for stateful network verification
- Finite reasons for safety. Parameterized verification by finite model finding
- Monotonic abstraction in parameterized verification
- scientific article; zbMATH DE number 7561314 (Why is no real title available?)
- Verification of programs that destructively manipulated data
- scientific article; zbMATH DE number 1929967 (Why is no real title available?)
- Using forward reachability analysis for verification of lossy channel systems
- On deciding synchronizability for asynchronously communicating systems
- Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
- Verification of programs with half-duplex communication
- Quantitative analysis of probabilistic lossy channel systems
- On the termination and structural termination problems for counter machines with incrementing errors
- Monotonic Abstraction for Programs with Dynamic Memory Heaps
- An automatic abstraction technique for verifying featured, parameterised systems
- On the satisfiability of context-free string constraints with subword-ordering
- Towards generalised half-duplex systems
- Data communicating processes with unreliable channels
- The transformation monoid of a partially lossy queue
- Verification of probabilistic systems with faulty communication
- Computable fixpoints in well-structured symbolic model checking
- On selective unboundedness of VASS
- Automated termination in model-checking modulo theories
- The inclusion structure of partially lossy queue monoids and their trace submonoids
- Model checking of systems with many identical timed processes
- A normalized form for FIFO protocols traces, application to the replay of mode-based protocols
- Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes
- Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems
- Data flow analysis of asynchronous systems using infinite abstract domains
- scientific article; zbMATH DE number 7121861 (Why is no real title available?)
- A general approach to comparing infinite-state systems with their finite-state specifications
- On the complexity of the linear-time μ-calculus for Petri Nets
- Complexity hierarchies beyond elementary
- Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication
- Formal verification for event stream processing: model checking of BeepBeep stream processing pipelines
- The ω-Regular Post Embedding Problem
- Rational, recognizable, and aperiodic partially lossy queue languages
- scientific article; zbMATH DE number 7327953 (Why is no real title available?)
- Ordinal recursive complexity of unordered data nets
This page was built for publication: Verifying programs with unreliable channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1923094)
