The following pages link to Ynot (Q24263):
Displaying 20 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)
- Program extraction for mutable arrays (Q1648867) (← links)
- Refinement to imperative HOL (Q1739909) (← links)
- Type-specialized staged programming with process separation (Q1929349) (← links)
- From Proposition to Program (Q2798255) (← links)
- Sound, Modular and Compositional Verification of the Input/Output Behavior of Programs (Q2802435) (← links)
- Two for the Price of One: Lifting Separation Logic Assertions (Q2914243) (← links)
- Effective interactive proofs for higher-order imperative programs (Q2936804) (← links)
- Free theorems involving type constructor classes (Q2936814) (← links)
- Dijkstra Monads in Monadic Computation (Q2942780) (← links)
- Correct-by-Construction Concurrency: Using Dependent Types to Verify Implementations of Effectful Resource Usage Protocols (Q3002480) (← links)
- Partiality, State and Dependent Types (Q3007667) (← links)
- A Hoare Logic for the State Monad (Q3183544) (← links)
- Nested Hoare Triples and Frame Rules for Higher-order Store (Q3224687) (← links)
- A Deadlock-Free Semantics for Shared Memory Concurrency (Q3393404) (← links)
