The weird machines in proof-carrying code

Proceedings - IEEE Symposium on Security and Privacy

Volumn 2014-January, Issue , 2014, Pages 209-213

  Vanegue, Julien ^a  

^a Bloomberg LP   (United States)

Author keywords

FPCC; Machines; PCC; Weird

Indexed keywords

MACHINING; SECURITY OF DATA;

DIFFERENT ATTACKS; FORMAL SYSTEMS; FPCC; MEMORY MODELING; PROOF-CARRYING CODE; WEIRD;

COMPUTER PRIVACY;

EID: 84939556806     PISSN: 10816011     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SPW.2014.37     Document Type: Conference Paper

References (9)

1. Andrew W. Appel. Foundational proof-carrying code. 2001
2. Sergey Bratus, Michael E Locasto, Meredith L Patterson, Len Sassaman, and Anna Shubina. Exploit programming: from buffer overflows to weird machines and theory of computation.; login, 2011
3. Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50(1):1-101, 1987
4. J. M. E. Hyland and C.-H. L. Ong. On full abstraction for pcf: I, ii, and {III}. Information and Computation, 163(2):285-408, 2000
5. C. A. R. Hoare. An axiomatic basis for computer programming. Commun. ACM, 12(10):576-580, October 1969
6. Xavier Leroy. Formal certification of a compiler back-end or: Programming a compiler with a proof assistant. SIGPLAN Not., 41(1):42-54, January 2006
7. George C. Necula. Proof-carrying code. 1997
8. Mark Plesko and Frank Pfenning. A formalization of the proofcarrying code architecture in a linear logical framework. 1999
9. Sandrine Blazy Gordon Stewart Xavier Leroy, Andrew Appel. The compcert memory model, version 2. INRIA Research Report 7987, 2012.