Pages that link to "Item:Q2938065"
From MaRDI portal
The following pages link to A Logic-Based Framework for Verifying Consensus Algorithms (Q2938065):
Displaying 14 items.
- Cardinality constraints for arrays (decidability results and applications) (Q1688541) (← links)
- \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms (Q1696580) (← links)
- Higher-order quantifier elimination, counter simulations and fault-tolerant systems (Q2031422) (← links)
- Eliminating message counters in synchronous threshold automata (Q2234072) (← links)
- Automated reasoning with restricted intensional sets (Q2666960) (← links)
- Counting Constraints in Flat Array Fragments (Q2817911) (← links)
- Accuracy of Message Counting Abstraction in Fault-Tolerant Distributed Algorithms (Q2961576) (← links)
- What You Always Wanted to Know About Model Checking of Fault-Tolerant Distributed Algorithms (Q3179167) (← links)
- Synthesis of distributed algorithms with parameterized threshold guards (Q3300835) (← links)
- Reachability in Parameterized Systems: All Flavors of Threshold Automata (Q5009433) (← links)
- Characterizing Consensus in the Heard-Of Model (Q5089273) (← links)
- A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract) (Q5756509) (← links)
- Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker (Q5883751) (← links)
- Synthesis of distributed agreement-based systems with efficiently-decidable verification (Q6536135) (← links)