|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Ewen Denney, Bernd Fischer, "Annotation Inference for Safety Certification of Automatically Generated Code (Extended Abstract)," 2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011), pp. 265-268, 21st IEEE International Conference on Automated Software Engineering (ASE'06), 2006. | |||
| BibTex | x | ||
| @article{ 10.1109/ASE.2006.15, author = {Ewen Denney and Bernd Fischer}, title = {Annotation Inference for Safety Certification of Automatically Generated Code (Extended Abstract)}, journal ={2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011)}, volume = {0}, year = {2006}, issn = {1527-1366}, pages = {265-268}, doi = {http://doi.ieeecomputersociety.org/10.1109/ASE.2006.15}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - 2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011) TI - Annotation Inference for Safety Certification of Automatically Generated Code (Extended Abstract) SN - 1527-1366 SP265 EP268 A1 - Ewen Denney, A1 - Bernd Fischer, PY - 2006 KW - null VL - 0 JA - 2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011) ER - | |||
Automated code generation is an enabling technology for model-based software development and promises many benefits, including higher quality and reduced turn-around times. However, the key to realizing these benefits is generator correctness: nothing is gained from replacing manual coding errors with automatic coding errors.
Since the direct verification of generators is unfeasible with existing techniques, "correct-by-construction" approaches have been explored. However, these remain difficult to implement and to scale up, and have not seen widespread use. Currently, generators are validated primarily by testing [8], though this cannot guarantee correctness and quickly becomes excessive. Here we follow an alternative approach based on the observation that the correctness of the generator is irrelevant if instead the correctness of the generated programs is shown individually. Similar to proof carrying code [7], we focus on the Hoare-style certification of specific safety properties. This simplifies our task but still leaves the problem of constructing the appropriate logical annotations (i.e., pre-/postconditions and loop invariants), due to their central role in Hoare-style techniques.
