• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Compiling with Proofs (1998)

Cached

  • Download as a PDF

Download Links

  • [www.cs.purdue.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by George Ciprian Necula
Citations:128 - 9 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@TECHREPORT{Necula98compilingwith,
    author = {George Ciprian Necula},
    title = {Compiling with Proofs},
    institution = {},
    year = {1998}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

One of the major challenges of building software systems is to ensure that the various components fit together in a well-defined manner. This problem is exacerbated by the recent advent of software components whose origin is unknown or inherently untrusted, such as mobile code or user extensions for operatingsystem kernels or database servers. Such extensions are useful for implementing an e#cient interaction model between a client and a server because several data exchanges between them can be saved at the cost of a single code exchange. In this dissertation, I propose to tackle such system integrity and security problems with techniques from mathematical logic and programming-language semantics. I propose a framework, called proof-carrying code, in which the extension provider sends along with the extension code a representation of a formal proof that the code meets certain safety and correctness requirements. Then, the code receiver can ensure the safety of executing the...

Citations

1635 Abstract Interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints - COUSOT, COUSOT - 1977
470 Automatic discovery of linear restraints among the variables of a program - COUSOT, HALBWACHS - 1978
392 safety and performance in the SPIN operating system - BERSHAD, SAVAGE, et al. - 1995
205 Abstract interpretation frameworks - Cousot, Cousot - 1992
126 A type-based approach to program security - Volpano, Smith - 1997
125 R.: Static determination of dynamic properties of programs - Cousot, Cousot - 1976
72 Automated proofs of object code for a widely used microprocessor - Boyer, Yu - 1996
71 An overview of the Extended Static Checking system - Detlefs - 1996
64 An approach to systems verification - Bevier, Hunt, et al. - 1989
37 The Scheme 311 Compiler: An Exercise in Denotational Semantics - Clinger - 1984
25 Programs and their Proofs: An Algebraic Approach - Landin, Burstall - 1972
24 More on advice on structuring compilers and proving them correct - Thatcher, Wagner, et al. - 1980
8 Using domain algebras to prove the correctness of a compiler - Dybjer - 1986
7 Semantics-directed code generation - Appel - 1985
4 The Sup-Inf method in Presurger arithmetic - Bledsoe - 1974
1 An algorithm for checking PL/CV arithmetic - Chan - 1977
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University