An axiomatic basis for computer programming
Communications of the ACM
Linear System Theory and Design
Linear System Theory and Design
A Discipline of Programming
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Packaging Mathematical Structures
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Certifying the Floating-Point Implementation of an Elementary Function Using Gappa
IEEE Transactions on Computers
Applying PVS background theories and proof strategies in invariant based programming
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Point-free, set-free concrete linear algebra
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Formal analysis of steady state errors in feedback control systems using HOL-light
Proceedings of the Conference on Design, Automation and Test in Europe
| Hi-index | 0.00 |
The problem of ensuring control software properties hold on their actual implementation is rarely tackled. While stability proofs are widely used on models, they are never carried to the code. Using program verification techniques requires express these properties at the level of the code but also to have theorem provers that can manipulate the proof elements. We propose to address this challenge by following two phases: first we introduce a way to express stability proofs as C code annotations; second, we propose a PVS linear algebra library that is able to manipulate quadratic invariants, i.e., ellipsoids. Our framework achieves the translation of stability properties expressed on the code to the representation of an associated proof obligation (PO) in PVS. Our library allows us to discharge these POs within PVS.