The following pages link to David Aspinall (Q626930):
Displaying 29 items.
- (Q236768) (redirect page) (← links)
- Tactics for hierarchical proof (Q626933) (← links)
- Heap-bounded assembly language (Q1826469) (← links)
- A program logic for resources (Q2463560) (← links)
- (Q2729065) (← links)
- (Q2753671) (← links)
- What’s in a Theorem Name? (Q2829279) (← links)
- Capturing Hiproofs in HOL Light (Q2843014) (← links)
- A Semantic Basis for Proof Queries and Transformations (Q2870114) (← links)
- Polar: A Framework for Proof Refactoring (Q2870173) (← links)
- Querying Proofs (Q2891442) (← links)
- An Essence of SSReflect (Q2907323) (← links)
- Towards a Type System for Security APIs (Q3184719) (← links)
- Type Inference for ZFH (Q3453108) (← links)
- EviCheck: Digital Evidence for Android (Q3460563) (← links)
- Formalising Java’s Data Race Free Guarantee (Q3523163) (← links)
- Safety Guarantees from Explicit Resource Management (Q3602994) (← links)
- Datatypes in Memory (Q3612487) (← links)
- (Q3657404) (← links)
- (Q4474826) (← links)
- (Q4738344) (← links)
- Towards Formal Proof Script Refactoring (Q5200123) (← links)
- A Framework for Interactive Proof (Q5428268) (← links)
- A type system with usage aspects (Q5451967) (← links)
- Theorem Proving in Higher Order Logics (Q5464660) (← links)
- A Tactic Language for Hiproofs (Q5505516) (← links)
- Mathematical Knowledge Management (Q5898512) (← links)
- Recent Trends in Algebraic Development Techniques (Q5900819) (← links)
- Subtyping dependent types (Q5958760) (← links)
