The following pages link to Ynot (Q24263):
Displaying 9 items.
- Specification patterns for reasoning about recursion through the store (Q393092) (← links)
- Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control (Q444460) (← links)
- Trace-based verification of imperative programs with I/O (Q617977) (← links)
- Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits (Q670699) (← links)
- A shape graph logic and a shape system (Q744329) (← links)
- Dijkstra and Hoare monads in monadic computation (Q890377) (← links)
- Refinement to imperative HOL (Q1739909) (← links)
- Type-specialized staged programming with process separation (Q1929349) (← links)
- Toward a verified relational database management system (Q5255077) (← links)
