Pages that link to "Item:Q5176951"
From MaRDI portal
The following pages link to Program verification through characteristic formulae (Q5176951):
Displayed 13 items.
- CFML (Q25202) (← links)
- A formalization of programs in first-order logic with a discrete linear order (Q274400) (← links)
- An observationally complete program logic for imperative higher-order functions (Q387994) (← links)
- Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits (Q670699) (← links)
- Loop verification with invariants and contracts (Q2152642) (← links)
- A Coq Library for Internal Verification of Running-Times (Q2798271) (← links)
- Machine-Checked Verification of the Correctness and Amortized Complexity of an Efficient Union-Find Implementation (Q2945628) (← links)
- Temporary Read-Only Permissions for Separation Logic (Q2988642) (← links)
- Verified Characteristic Formulae for CakeML (Q2988660) (← links)
- Ready,<tt>Set</tt>, Verify! Applying<tt>hs-to-coq</tt>to real-world Haskell code (Q5018778) (← links)
- Cogent: uniqueness types and certifying compilation (Q5019022) (← links)
- Characteristic formulae for liveness properties of non-terminating CakeML programs (Q5875446) (← links)
- (Q6060675) (← links)