Towards mechanical metamathematics
Journal of Automated Reasoning
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Implementing mathematics with the Nuprl proof development system
Implementing mathematics with the Nuprl proof development system
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS
IEEE Transactions on Software Engineering
Computer-Aided Reasoning: An Approach
Computer-Aided Reasoning: An Approach
A New Implementation of Automath
Journal of Automated Reasoning
HOL Light: A Tutorial Introduction
FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
A Certified Version of Buchberger's Algorithm
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Handbook of automated reasoning
Handbook of automated reasoning
Formalized Mathematics
DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Harnessing Disruptive Innovation in Formal Verification
SEFM '06 Proceedings of the Fourth IEEE International Conference on Software Engineering and Formal Methods
Backdoors to typical case complexity
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Cooperating Theorem Provers: A Case Study Combining HOL-Light and CVC Lite
Electronic Notes in Theoretical Computer Science (ENTCS)
The reliable algorithmic software challenge RASC
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Verifying propositional unsatisfiability: pitfalls to avoid
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
A tutorial on satisfiability modulo theories
CAV'07 Proceedings of the 19th international conference on Computer aided verification
CAV'07 Proceedings of the 19th international conference on Computer aided verification
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Verifying and reflecting quantifier elimination for presburger arithmetic
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Inference systems for logical algorithms
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Towards self-verification of HOL light
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Industrial-strength certified SAT solving through verified SAT proof checking
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
Rewriting, inference, and proof
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
The Mechanical Verification of a DPLL-Based Satisfiability Solver
Electronic Notes in Theoretical Computer Science (ENTCS)
Advanced Lectures on Software Engineering
A proposal for broad spectrum proof certificates
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
Producing and verifying extremely large propositional refutations
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
On the one hand, we would like verification tools to feature powerful automation, but on the other hand, we also want to be able to trust the results with a high degree of confidence. The question of trust in verification tools has been debated for a long time. One popular way of achieving trust in verification tools is through proof generation. However, proof generation could hamstring both the functionality and the efficiency of the automation that can be built into these tools. We argue that trust need not be achieved at the expense of automation, and outline a lightweight approach where the results of untrusted verifiers are checked by a trusted offline checker. The trusted checker is a verified reference kernel that contains a satisfiability solver to support the robust and efficient checking of untrusted tools.