COMP 426 Automated Reasoning
Lecture 17: Theorem proving using recipes
In this lecture we discuss a guided theorem prover which outputs proof terms. These proof terms can then be checked using a bi-directional proof checker. We then refine this implementation, to only provide hints to the prover to resolve the non-deterministic choice.
This concept of providing hints during theorem proving has been exploited most recently in work on proof-carrying code, namely in Necula's and Rahul's work on oracle-based checking of untrusted software.
[ Home
| Schedule
| Assignments
| Projects
| Handouts
| Software
| Overview
]
bp@cs.mcgill.ca
Brigitte Pientka
|