Pages that link to "Item:Q3698284"
From MaRDI portal
The following pages link to A proof rule for fair termination of guarded commands (Q3698284):
Displaying 17 items.
- Complete proof rules for strong fairness and strong extreme fairness (Q685427) (← links)
- Fair derivations in E0L systems (Q1062767) (← links)
- A complete rule for equifair termination (Q1088401) (← links)
- Infinite trees, markings, and well-foundedness (Q1112586) (← links)
- Appraising fairness in languages for distributed programming (Q1112589) (← links)
- The \(\mu\)-calculus as an assertion-language for fairness arguments (Q1124314) (← links)
- Completing the temporal picture (Q1176248) (← links)
- Verification of distributed programs using representative interleaving sequences (Q1200917) (← links)
- Convergence of iteration systems (Q1310569) (← links)
- Proving partial order properties (Q1322161) (← links)
- A methodology for designing proof rules for fair parallel programs (Q1377299) (← links)
- Probabilistic termination versus fair termination (Q1822937) (← links)
- Verification of concurrent programs: The automata-theoretic framework (Q2277249) (← links)
- Fifty years of Hoare's logic (Q2280214) (← links)
- A Bibliography of Willem-Paul de Roever (Q5187816) (← links)
- Explicit Fair Scheduling for Dynamic Control (Q5187822) (← links)
- First order Büchi automata and their application to verification of LTL specifications (Q6643476) (← links)
