Pages that link to "Item:Q2936804"
From MaRDI portal
The following pages link to Effective interactive proofs for higher-order imperative programs (Q2936804):
Displaying 13 items.
- Symbolic execution proofs for higher order store programs (Q287265) (← links)
- Trace-based verification of imperative programs with I/O (Q617977) (← links)
- Reasoning about memory layouts (Q633298) (← links)
- Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits (Q670699) (← links)
- Proof tactics for assertions in separation logic (Q1687747) (← links)
- From Proposition to Program (Q2798255) (← links)
- CoqPIE: An IDE Aimed at Improving Proof Development Productivity (Q2829283) (← links)
- A Program Construction and Verification Tool for Separation Logic (Q2941173) (← links)
- Machine-Checked Verification of the Correctness and Amortized Complexity of an Efficient Union-Find Implementation (Q2945628) (← links)
- Verified Characteristic Formulae for CakeML (Q2988660) (← links)
- Specifying Imperative ML-Like Programs Using Dynamic Logic (Q3067541) (← links)
- Mechanizing the Metatheory of mini-XQuery (Q3100214) (← links)
- Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language (Q6151555) (← links)
