Using Automated Theorem Provers to Certify Auto-Generated Aerospace Software
Using Automated Theorem Provers to Certify Auto-Generated Aerospace Software
We describe a system for the automated certification of safety properties of NASA software. The system uses Hoare-style program verification technology to generate proof obligations which are then processed by an automated first-order theorem prover (ATP). For full automation, however, the obligations must be aggressively preprocessed and simplified.We discuss the unique requirements this application places on the ATPs and demonstrate how the individual simplification stages, which are implemented by rewriting, influence the ability of the ATPs to solve the proof tasks. Our results are based on 13 certification experiments that lead to more than 25,000 proof tasks which have each been attempted by Vampire, Spass, and e-setheo.
software certification, automated theorem proving, formal methods
3-540-22345-2
198-212
Denney, Ewen
cce9ba14-a1fd-4a7b-8e90-fcb234b53e1d
Fischer, Bernd
0c9575e6-d099-47f1-b3a2-2dbc93c53d18
Schumann, Johann
03135c8b-0f6e-4a20-9453-6a4e2d8a1e23
Basin, David
e8fee91b-5803-45f2-ba29-7d48b23ba485
Rusinowitch, Michael
954470ce-c4b2-4f95-8e14-07f59fa458c5
2004
Denney, Ewen
cce9ba14-a1fd-4a7b-8e90-fcb234b53e1d
Fischer, Bernd
0c9575e6-d099-47f1-b3a2-2dbc93c53d18
Schumann, Johann
03135c8b-0f6e-4a20-9453-6a4e2d8a1e23
Basin, David
e8fee91b-5803-45f2-ba29-7d48b23ba485
Rusinowitch, Michael
954470ce-c4b2-4f95-8e14-07f59fa458c5
Denney, Ewen, Fischer, Bernd and Schumann, Johann
(2004)
Using Automated Theorem Provers to Certify Auto-Generated Aerospace Software.
Basin, David and Rusinowitch, Michael
(eds.)
Second International Joint Conference on Automated Reasoning (IJCAR 2004), Cork.
.
Record type:
Conference or Workshop Item
(Paper)
Abstract
We describe a system for the automated certification of safety properties of NASA software. The system uses Hoare-style program verification technology to generate proof obligations which are then processed by an automated first-order theorem prover (ATP). For full automation, however, the obligations must be aggressively preprocessed and simplified.We discuss the unique requirements this application places on the ATPs and demonstrate how the individual simplification stages, which are implemented by rewriting, influence the ability of the ATPs to solve the proof tasks. Our results are based on 13 certification experiments that lead to more than 25,000 proof tasks which have each been attempted by Vampire, Spass, and e-setheo.
Text
cade2004.pdf
- Other
More information
Published date: 2004
Additional Information:
Event Dates: July 2004
Venue - Dates:
Second International Joint Conference on Automated Reasoning (IJCAR 2004), Cork, 2004-07-01
Keywords:
software certification, automated theorem proving, formal methods
Organisations:
Electronic & Software Systems
Identifiers
Local EPrints ID: 262910
URI: http://eprints.soton.ac.uk/id/eprint/262910
ISBN: 3-540-22345-2
PURE UUID: f35d6b7b-e657-4a32-8332-c0cf65939e76
Catalogue record
Date deposited: 17 Aug 2006
Last modified: 14 Mar 2024 07:20
Export record
Contributors
Author:
Ewen Denney
Author:
Bernd Fischer
Author:
Johann Schumann
Editor:
David Basin
Editor:
Michael Rusinowitch
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics