The following pages link to (Q4804890):
Displaying 20 items.
- Context-aware counter abstraction (Q600978) (← links)
- Modeling and efficient verification of wireless ad hoc networks (Q1688557) (← links)
- \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms (Q1696580) (← links)
- Model checking and abstraction to the aid of parameterized systems (a survey) (Q1886449) (← links)
- View abstraction for systems with component identities (Q2024368) (← links)
- Finding cut-offs in leaderless rendez-vous protocols is easy (Q2233393) (← links)
- Chosen-Ciphertext Security from Subset Sum (Q2798769) (← links)
- On Hierarchical Communication Topologies in the $$\pi $$ -calculus (Q2802475) (← links)
- Counter Abstraction in the CSP/FDR setting (Q2810979) (← links)
- What You Always Wanted to Know About Model Checking of Fault-Tolerant Distributed Algorithms (Q3179167) (← links)
- An Abstraction Technique for Parameterized Model Checking of Leader Election Protocols: Application to FTSP (Q3303889) (← links)
- Liveness by Invisible Invariants (Q3613081) (← links)
- Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms (Q5175774) (← links)
- Compositional CSP Traces Refinement Checking (Q5178982) (← links)
- Smaller Abstractions for ∀CTL* without Next (Q5187833) (← links)
- (Q5240148) (← links)
- Proving Ptolemy Right: The Environment Abstraction Framework for Model Checking Concurrent Systems (Q5458319) (← links)
- Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker (Q5883751) (← links)
- Model checking parameterized asynchronous shared-memory systems (Q5892422) (← links)
- Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy (Q6076175) (← links)