Pages that link to "Item:Q1056221"

The following pages link to An approach to automating the verification of compact parallel coordination programs. I (Q1056221):

Displaying 10 items.

• On the completeness of bounded model checking for threshold-based distributed algorithms: reachability (Q729813) (← links)
• Two algorithms for barrier synchronization (Q1114381) (← 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)
• Compositionality Entails Sequentializability (Q3000634) (← links)
• Quicker Convergence for Iterative Numerical Solutions to Stochastic Problems: Probabilistic Interpretations, Ordering Heuristics, and Parallel Processing (Q3415988) (← links)
• Mind the Shapes: Abstraction Refinement Via Topology Invariants (Q3510783) (← links)
• Verifying Parameterized taDOM+ Lock Managers (Q5448673) (← links)
• The Spotlight Principle (Q5452606) (← links)