Foundational proof-carrying code

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2001, Pages 247-256

  Appel, A W ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (STANDARDS); FORMAL LANGUAGES; FORMAL LOGIC; LOGIC PROGRAMMING; MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; THEOREM PROVING;

MACHINE LANGUAGE PROGRAMS; MATHEMATICAL PROOF; PROOF CARRYING CODE SYSTEM;

MACHINE ORIENTED LANGUAGES;

EID: 0034865338     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Hints on proving theorems in Twelf
2. Models for security policies in proof-carrying code
3. A semantic model of types and machine instructions for proof-carrying code
4. An indexed model of recursive types for foundational proof-carrying code
5. Efficient substitution in hoare logic expressions
6. Dictionary passing for polytypic polymorphism
7. A certifying compiler for Java
8. Flexible type analysis
9. Avoiding exponential explosion: Generating compact verification conditions
10. A framework for defining logics
11. Compiling polymorphism using intensional type analysis
12. Machine instruction syntax and semantics in higher-order logic
13. Principled scavenging
14. From system F to typed assembly language
15. Proof-carrying code
16. Elf: A meta-language for deductive systems
17. System description: Twelf - A meta-logical framework for deductive systems
18. Specifying representations of machine instructions
19. Implementation of the typed call-by-value λ-calculus using a stack of regions
20. Typed memory management via static capabilities
21. Type-preserving garbage collectors