• 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

Certifiable program generation (2005)

Cached

  • Download as a PDF

Download Links

  • [ti.arc.nasa.gov]
  • [www.ic.arc.nasa.gov]
  • [ti.arc.nasa.gov]
  • [ic.arc.nasa.gov]
  • [ti.arc.nasa.gov]
  • [ase.arc.nasa.gov]
  • [www.ic.arc.nasa.gov]
  • [ti.arc.nasa.gov]
  • [ic.arc.nasa.gov]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Ewen Denney , Bernd Fischer
Venue:GPCE 2005, LNCS
Citations:12 - 7 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@ARTICLE{Denney05certifiableprogram,
    author = {Ewen Denney and Bernd Fischer},
    title = {Certifiable program generation},
    journal = {GPCE 2005, LNCS},
    year = {2005},
    volume = {3676},
    pages = {17--28}
}

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

Abstract. Code generators based on template expansion techniques are easier to build than purely deductive systems but do not guarantee the same level of assurance: instead of providing “correctness-by-construction”, the correctness of the generated code depends on the correctness of the generator itself. We present an alternative assurance approach, in which the generator is extended to enable Hoare-style safety proofs for each individual generated program. The proofs ensure that the generated code does not “go wrong”, i.e., does not violate certain conditions during its execution. The crucial step in this approach is to extend the generator in such way that it produces all required annotations (i.e., pre-/postconditions and loop invariants) without compromising the assurance provided by the subsequent verification phase. This is achieved by embedding annotation templates into the code templates, which are then instantiated in parallel by the generator. This is feasible because the structure of the generated code and the possible safety properties are known when the generator is developed. It does not compromise the provided assurance because the annotations only serve as auxiliary lemmas and errors in the annotation templates ultimately lead to unprovable safety obligations. We have implemented this approach and integrated it into the AUTOBAYES and AUTOFILTER program generators. We have then used it to fully automatically prove that code generated by the two systems satisfies both language-specific properties such as array-bounds safety or proper variable initialization-before-use and domain-specific properties such as vector normalization, matrix symmetry, or correct sensor input usage. 1

Citations

1016 Proof-carrying code - Necula - 1997
455 Extended static checking for Java - Flanagan, Leino, et al.
295 Concepts in Programming Languages - Mitchell - 2003
245 The Design and Implementation of a Certifying Compiler - Necula, Lee - 2004
224 Kids: A semiautomatic program development system - Smith - 1990
120 A Certifying Compiler for Java - Colby, Lee, et al. - 2000
69 Deductive composition of astronomical software from subroutine libraries - ME, Waldinger, et al. - 1995
52 AutoBayes: A System for Generating Data Analysis Programs from Statistical Models - Fischer, Schumann - 2003
31 Correctness of source-level safety policies - Denney, Fischer - 2003
28 Automating the Implementation of Kalman Filter Algorithms - Whittle, Schumann - 2005
28 Synthesizing Certified Code - Whalen, Schumann, et al. - 2002
18 Certifying domain-specific policies - Lowry, Pressburger, et al. - 2001
15 Westfold: Planware – Domain-Specific Synthesis of High-Performance Schedulers - Blaine, Gilham, et al. - 1998
10 On the Requirements of HighIntegrity Code Generation - Whalen, Heimdhal - 1999
9 Program synthesis - Kreitz - 1998
8 Proving refinement transformations for deriving high-assurance software - Winter, Boyle - 1996
7 Automatic derivation of statistical data analysis algorithms: Planetary nebulae and beyond - Fischer, Hajian, et al. - 2003
5 An Empirical Evaluation of Automated Theorem - Denney, Fischer, et al. - 2004
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