Pages that link to "Item:Q1923094"
From MaRDI portal
The following pages link to Verifying programs with unreliable channels (Q1923094):
Displaying 50 items.
- Forward analysis and model checking for trace bounded WSTS (Q290914) (← links)
- On deciding synchronizability for asynchronously communicating systems (Q344799) (← links)
- On selective unboundedness of VASS (Q355513) (← links)
- An extension of lazy abstraction with interpolation for programs with arrays (Q479820) (← links)
- Ordinal recursive complexity of unordered data nets (Q529043) (← links)
- A classification of the expressive power of well-structured transition systems (Q553290) (← links)
- Undecidable verification problems for programs with unreliable channels (Q675223) (← links)
- Conversation protocols: a formalism for specification and verification of reactive electronic services (Q703491) (← links)
- Reachability problems on reliable and lossy queue automata (Q825976) (← links)
- An automatic abstraction technique for verifying featured, parameterised systems (Q947791) (← links)
- Verification of programs that destructively manipulated data (Q1104731) (← links)
- Verification in loosely synchronous queue-connected discrete timed automata. (Q1401187) (← links)
- Undecidable problems in unreliable computations. (Q1401309) (← links)
- Cardinality constraints for arrays (decidability results and applications) (Q1688541) (← links)
- Simulating perfect channels with probabilistic lossy channels (Q1776399) (← links)
- Verifying lossy channel systems has nonprimitive recursive complexity. (Q1853078) (← links)
- Counter machines and verification problems. (Q1853523) (← links)
- Model checking of systems with many identical timed processes (Q1853589) (← links)
- Expired data collection in shared dataspaces. (Q1874282) (← links)
- Eliminating the storage tape in reachability constructions. (Q1874416) (← links)
- Using forward reachability analysis for verification of lossy channel systems (Q1878928) (← links)
- Unreliable channels are easier to verify than perfect channels (Q1908353) (← links)
- Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations (Q1960526) (← links)
- Parameterized verification of coverability in infinite state broadcast networks (Q2029598) (← links)
- On the termination and structural termination problems for counter machines with incrementing errors (Q2037198) (← links)
- Guessing the buffer bound for k-synchronizability (Q2117668) (← links)
- The decidability of verification under PS 2.0 (Q2233444) (← links)
- Data flow analysis of asynchronous systems using infinite abstract domains (Q2233447) (← links)
- Computable fixpoints in well-structured symbolic model checking (Q2248074) (← links)
- Some complexity results for stateful network verification (Q2335903) (← links)
- Non-deterministic transducer models of retransmission protocols over noisy channels (Q2346564) (← links)
- Finite reasons for safety (Q2351397) (← links)
- Generalized Post embedding problems (Q2354596) (← links)
- The transformation monoid of a partially lossy queue (Q2399374) (← links)
- Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes (Q2407982) (← links)
- Quantitative analysis of probabilistic lossy channel systems (Q2495651) (← links)
- A Kleene theorem and model checking algorithms for existentially bounded communicating automata (Q2496297) (← links)
- A general approach to comparing infinite-state systems with their finite-state specifications (Q2503044) (← links)
- \(\pi\)-calculus with noisy channels (Q2570971) (← links)
- Verification of probabilistic systems with faulty communication (Q2573634) (← links)
- Verification of programs with half-duplex communication (Q2573635) (← links)
- Multiparty half-duplex systems and synchronous communications (Q2683034) (← links)
- Complexity hierarchies beyond elementary (Q2828216) (← links)
- Automated termination in model-checking modulo theories (Q2841996) (← links)
- Automated formal analysis and verification: an overview (Q2871577) (← links)
- Ideal Abstractions for Well-Structured Transition Systems (Q2891435) (← links)
- Forward Analysis and Model Checking for Trace Bounded WSTS (Q3011881) (← links)
- Well (and Better) Quasi-Ordered Transition Systems (Q3067860) (← links)
- Rational, recognizable, and aperiodic sets in the partially lossy queue monoid (Q3304144) (← links)
- Forward analysis for WSTS, part I: completions (Q3386750) (← links)
