Pages that link to "Item:Q4461768"
From MaRDI portal
The following pages link to Verification of non-functional programs using interpretations in type theory (Q4461768):
Displaying 11 items.
- Function extraction (Q436372) (← links)
- Modular inference of subprogram contracts for safety checking (Q604392) (← links)
- Proofs of randomized algorithms in Coq (Q923886) (← links)
- Tilting at windmills with Coq: Formal verification of a compilation algorithm for parallel moves (Q928671) (← links)
- Typing termination in a higher-order concurrent imperative language (Q979082) (← links)
- Adapting functional programs to higher order logic (Q1029815) (← links)
- The KRAKATOA tool for certification of JAVA/JAVACARD programs annotated in JML (Q1881670) (← links)
- Generalized arrays for Stainless frames (Q2152661) (← links)
- Interfaces as functors, programs as coalgebras -- a final coalgebra theorem in intensional type theory (Q2503336) (← links)
- Transforming Programs into Recursive Functions (Q5179363) (← links)
- Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language (Q6151555) (← links)
