Pages that link to "Item:Q2819827"
From MaRDI portal
The following pages link to Proof spaces for unbounded parallelism (Q2819827):
Displaying 8 items.
- A dynamic logic for deductive verification of multi-threaded programs (Q470007) (← links)
- \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms (Q1696580) (← links)
- Verifying the correctness of distributed systems via mergeable parallelism (Q2154028) (← links)
- Automated Program Verification (Q2799160) (← links)
- Domains for Higher-Order Games (Q5111275) (← links)
- What’s Decidable About Program Verification Modulo Axioms? (Q5164172) (← links)
- Regression verification for multi-threaded programs (with extensions to locks and dynamic thread creation) (Q5962972) (← links)
- Thread-modular counter abstraction: automated safety and termination proofs of parameterized software by reduction to sequential program verification (Q6661749) (← links)