134 search results - page 7 / 27 » Meronymy Extraction Using An Automated Theorem Prover |
TPHOL
2000
IEEE
15 years 1 months ago
2000
IEEE
This paper outlines a formal model of the Intel IA-64 architecture, and explains how this model can be used to verify the correctness of assembly-level code optimizations. The form...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Abstract. Automated theorem provers are used in extended static checking, where they are the performance bottleneck. Extended static checkers are run typically after incremental ch...
TPHOL
1997
IEEE
15 years 1 months ago
1997
IEEE
This note lists references which address –in some way or another– the problems relating to formal manipulation of logical expressions where terms can fail to denote. Reference...
178
click to vote
CADE
2011
Springer
13 years 9 months ago
2011
Springer
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
KI
2009
Springer
15 years 4 months ago
2009
Springer
When mathematicians present proofs they usually adapt their explanations to their didactic goals and to the (assumed) knowledge of their addressees. Modern automated theorem prover...