Pages that link to "Item:Q5408433"
From MaRDI portal
The following pages link to Modular reasoning about heap paths via effectively propositional formulas (Q5408433):
Displaying 5 items.
- From invariant checking to invariant inference using randomized search (Q518404) (← links)
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates (Q2031420) (← links)
- Property Directed Reachability for Proving Absence of Concurrent Modification Errors (Q2961566) (← links)
- A First-Order Logic with Frames (Q5041109) (← links)
- What’s Decidable About Program Verification Modulo Axioms? (Q5164172) (← links)
