The following pages link to Computer Science Logic (Q5394591):
Displaying 5 items.
- Efficient bounded model checking of heap-manipulating programs using tight field bounds (Q2044185) (← links)
- Correctness of Pointer Manipulating Algorithms Illustrated by a Verified BDD Construction (Q4647844) (← links)
- Two-Variable Logic with Counting and Trees (Q5278191) (← links)
- Correct Hardware Design and Verification Methods (Q5897078) (← links)
- Complete Decision Procedure for the Theory of Bounded Pointer Arithmetic (Q6486105) (← links)