Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with automated-theorem-proving
Search options answers only
not deleted
user 898
Automated theorem proving is the proving of mathematical theorems by a computer program.
8
votes
What is the significance of nominal techniques?
Short answer. Formal reasoning about binding and $\alpha$-conversion with nominal approaches is closer to intuitive reasoning than alternative approaches.
Longer answer. Binders arise everywhere in …
- 11.6k
19
votes
Accepted
Why is Proof Checker required in Proof Carrying Code
The purpose of the proof checker is to minimise the trusted computing base.
By having a proof checker, neither the compiler nor the theorem prover need to be correct. The paper makes this point on P …
- 11.6k