The following pages link to Smallfoot (Q21766):
Displaying 13 items.
- Completeness for recursive procedures in separation logic (Q278747) (← links)
- Symbolic execution proofs for higher order store programs (Q287265) (← links)
- Specification patterns for reasoning about recursion through the store (Q393092) (← links)
- Automated verification of shape, size and bag properties via user-defined predicates in separation logic (Q436400) (← links)
- Reasoning about memory layouts (Q633298) (← links)
- Reasoning about sequences of memory states (Q636268) (← links)
- A shape graph logic and a shape system (Q744329) (← links)
- Juggrnaut: using graph grammars for abstracting unbounded heap structures (Q746781) (← links)
- Certifying low-level programs with hardware interrupts and preemptive threads (Q835764) (← links)
- Compositional entailment checking for a fragment of separation logic (Q1688543) (← links)
- Compositional Shape Analysis by Means of Bi-Abduction (Q5395670) (← links)
- A proof system for separation logic with magic wand (Q5408443) (← links)
- Static Analysis (Q5466564) (← links)
