The following pages link to Fiat (Q33165):
Displaying 15 items.
- Mechanical synthesis of sorting algorithms for binary trees by logic and combinatorial techniques (Q1640636) (← links)
- Refinement to imperative HOL (Q1739909) (← links)
- A Coq formalisation of SQL's execution engines (Q1791148) (← links)
- Software verification with ITPs should use binary code extraction to reduce the TCB (short paper) (Q1791178) (← links)
- Fast machine words in Isabelle/HOL (Q1791180) (← links)
- Relational parametricity and quotient preservation for modular (co)datatypes (Q1791181) (← links)
- Automatic refinement to efficient data structures: a comparison of two approaches (Q2417948) (← links)
- From Sets to Bits in Coq (Q2798253) (← links)
- Proof–Based Synthesis of Sorting Algorithms for Trees (Q2798749) (← links)
- Extensible and Efficient Automation Through Reflective Tactics (Q2802496) (← links)
- Verified Characteristic Formulae for CakeML (Q2988660) (← links)
- Foundations of dependent interoperability (Q4577812) (← links)
- Constructive Galois Connections (Q4972068) (← links)
- Concise Read-Only Specifications for Better Synthesis of Programs with Pointers (Q5041091) (← links)
- Extensible Extraction of Efficient Imperative Programs with Foreign Functions, Manually Managed Memory, and Proofs (Q5048997) (← links)