The following pages link to (Q4540967):
Displaying 10 items.
- MONA (Q18304) (← links)
- Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Complexity of fixed-size bit-vector logics (Q504997) (← links)
- Juggrnaut: using graph grammars for abstracting unbounded heap structures (Q746781) (← links)
- Specification and optimal reactive synthesis of run-time enforcement shields (Q2672248) (← links)
- A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings (Q2964458) (← links)
- Verifying Heap-Manipulating Programs in an SMT Framework (Q3510799) (← links)
- A Practical Approach to Courcelle's Theorem (Q5170276) (← links)
- An Inference-Rule-Based Decision Procedure for Verification of Heap-Manipulating Programs with Mutable Data and Cyclic Data Structures (Q5452601) (← links)
