1 / 19

Typed Assembly Language and Proof-Carrying Code

Typed Assembly Language and Proof-Carrying Code. Nicholas Moore Bianca Curutan Pooya Samizadeh. McMaster University March 30, 2012. Part I: Typed Assembly Language. Introduction TAL and PCC TAL-0 Real World Application. Introduction.

gyan
Télécharger la présentation

Typed Assembly Language and Proof-Carrying Code

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Typed Assembly Language and Proof-Carrying Code Nicholas Moore Bianca Curutan Pooya Samizadeh McMaster University March 30, 2012

  2. Part I:Typed Assembly Language Introduction TAL and PCC TAL-0 Real World Application

  3. Introduction • Typed Assembly Language (TAL) extends traditional untyped assembly languages with typing annotations, memory management primitives, and a sound set of typing rules • These typing rules guarantee the memory safety, control flow safety, and type safety of TAL programs

  4. TAL and PCC • Principle of Proof-Carrying Code (PCC): Eliminate the need to trust code by requiring a formal, machine-checkable proof that the code has some desired properties • What properties should we require of the code? • How do code producers construct a formal proof that their code has the desired properties?

  5. TAL-0 • Control-flow Safety: Ensure that a program jumps only to a well-defined subset of possible entry points • A focus on control-flow safety allows us to develop a simple abstract machine and demonstrate the key ideas of adapting a type system to machine code

  6. TAL-0 (cont’d) • Instructions and Operands

  7. TAL-0 (cont’d) • Abstract Machine Syntax

  8. Real World Application • Limitations: • Only supports simple tuple or record-like data structures • Insufficient for compiling real-world high-level languages which provide data abstraction mechanisms • Can only allocate objects whose size is known at compile time

  9. Real World Application (cont’d) • Examples to make type system more useful: • Annotate primitive memory type components with flags to control whether that component supports read-only, write-only, or read-write access • Add support for subtyping • Consider a read-write component to be a subtype of a read-only or a write-only component

  10. Part II:Proof-Carrying Code Introduction Touchstone PCC Architecture Advantages Over Related Techniques Technical Difficulties to Overcome

  11. Introduction • Proof-Carrying Code (PCC): General framework that allows the host to verify properties about an agent via a formal proof that accompanies the executable code • The host system can quickly verify the validity of the proof and compare the conclusions to its own security policy to determine if the agent has certain safety properties

  12. Touchstone PCC Architecture

  13. Advantages Over Related Techniques • Operates at load time before the agent code is installed in the host system • Trusted computing base is small • Can operate even on agents expressed in native-code form • General – all PCC has to do is verify safety explanations and match them with the code and safety policy

  14. Technical Difficulties to Overcome • How to encode the formal proof? • How to check the proof? • How to relate the proof with the program?

  15. Part III:Project Introduction Recall TAL-0 Description and Demo

  16. Introduction • Task • Build an interpreter for the TAL-0 abstract machine in Haskell, i.e., (lazy) functional programming language

  17. Recall TAL-0 • Instructions and Operands • Abstract Machine Syntax

  18. Description and Demo

  19. References • Jones, Mark. Functional Programming with Overloading and Higher-Order Polymorphism. Diss. University of Nottingham. Nottingham. Print. • Liang, Sheng, Paul Hudak, and Mark Jones. Monad Transformers and Modular Interpreters. Diss. Yale University. New Haven. Print. • Necula, George. "Proof-Carrying Code." Computer Science Division, EECS at UC Berkeley. 22 July 2002. Web. 21 Mar. 2012. <http://www.cs.berkeley.edu/~necula/pcc.html>. • Pierce, Benjamin C. Advanced Topics in Types and Programming Languages. Cambridge, MA: MIT, 2005. Print. • "Typed Assembly Language Compiler." Cornell University Department of Computer Science. Web. 21 Mar. 2012. <http://www.cs.cornell.edu/talc/>.

More Related