Pages that link to "Item:Q2417849"
From MaRDI portal
The following pages link to Completeness and expressiveness of pointer program verification by separation logic (Q2417849):
Displaying 11 items.
- Completeness for recursive procedures in separation logic (Q278747) (← links)
- Verifying pointer and string analyses with region type systems (Q2014831) (← links)
- An adaptation-complete proof system for local reasoning about cloud storage systems (Q2072067) (← links)
- Automatically proving termination and memory safety for programs with pointer arithmetic (Q2362494) (← links)
- Towards Modular Algebraic Specifications for Pointer Programs: A Case Study (Q3608820) (← links)
- Correctness of Pointer Manipulating Algorithms Illustrated by a Verified BDD Construction (Q4647844) (← links)
- Applying Light-Weight Theorem Proving to Debugging and Verifying Pointer Programs (Q4916225) (← links)
- Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction (Q5277913) (← links)
- Programming Languages and Systems (Q5316560) (← links)
- Computer Science Logic (Q5394591) (← links)
- A proof system for separation logic with magic wand (Q5408443) (← links)