Abstract
Formal verification of large computer-generated proofs often relies on certified checkers based on oracles. We propose a methodology for such proofs, advocating a separation of concerns between formalizing the underlying theory and optimizing the algorithm implemented in the checker, based on the observation that such optimizations can benefit significantly from adequately adapting the oracle.
Original language | English |
---|---|
Title of host publication | Proceedings of the 8th International Conference on Interactive Theorem Proving |
Editors | Mauricio Ayala-Rincón, César A. Muñoz |
Publisher | Springer |
Publication date | 2017 |
Pages | 164-170 |
ISBN (Print) | 978-3-319-66106-3 |
ISBN (Electronic) | 978-3-319-66107-0 |
DOIs | |
Publication status | Published - 2017 |
Event | 8th International Conference on Interactive Theorem Proving - Brasília, Brazil Duration: 26. Sept 2017 → 29. Sept 2017 Conference number: 8 |
Conference
Conference | 8th International Conference on Interactive Theorem Proving |
---|---|
Number | 8 |
Country/Territory | Brazil |
City | Brasília |
Period | 26/09/2017 → 29/09/2017 |
Series | Lecture Notes in Computer Science |
---|---|
Volume | 10499 |
ISSN | 0302-9743 |