The following pages link to David Pichardie (Q287368):
Displayed 23 items.
- Verified abstract interpretation techniques for disassembling low-level self-modifying code (Q287369) (← links)
- Verifying a concurrent garbage collector using a rely-guarantee methodology (Q1687774) (← links)
- Verified functional programming of an abstract interpreter (Q2145322) (← links)
- A flow-insensitive-complete program representation (Q2152650) (← links)
- Verifying constant-time implementations by abstract interpretation (Q2167720) (← links)
- System-level non-interference of constant-time cryptography. II: Verified static analysis and stealth memory (Q2228439) (← links)
- Verifying a concurrent garbage collector with a rely-guarantee methodology (Q2319995) (← links)
- Verified Abstract Interpretation Techniques for Disassembling Low-level Self-modifying Code (Q2879248) (← links)
- Plan B (Q2931808) (← links)
- Validating Dominator Trees for a Fast, Verified Dominance Test (Q2945625) (← links)
- An abstract memory functor for verified C static analyzers (Q2985780) (← links)
- Modular SMT Proofs for Fast Reflexive Checking Inside Coq (Q3100210) (← links)
- A Certified Data Race Analysis for a Java-like Language (Q3183531) (← links)
- Defining and Reasoning About Recursive Functions: A Practical Tool for the Coq Proof Assistant (Q3434629) (← links)
- Embedding of Systems of Affine Recurrence Equations in Coq (Q3559765) (← links)
- (Q4790670) (← links)
- A Fast Verified Liveness Analysis in SSA Form (Q5049011) (← links)
- A certified lightweight non-interference Java bytecode verifier (Q5400855) (← links)
- A verified information-flow architecture (Q5408414) (← links)
- Building Certified Static Analysers by Modular Construction of Well-founded Lattices (Q5415621) (← links)
- A Certified Denotational Abstract Interpreter (Q5747638) (← links)
- A Certified Lightweight Non-interference Java Bytecode Verifier (Q5756494) (← links)
- Semantic foundations for cost analysis of pipeline-optimized programs (Q6164437) (← links)