1302 search results - page 246 / 261 » Free-Style Theorem Proving |
133
Voted
RTA
2005
Springer
15 years 10 months ago
2005
Springer
Proofs of equalities may be built from assumptions using proof rules for reflexivity, symmetry, and transitivity. Reflexivity is an axiom proving x=x for any x; symmetry is a 1-p...
148
click to vote
PPOPP
2003
ACM
15 years 10 months ago
2003
ACM
We present a new method for dynamically detecting potential data races in multithreaded programs. Our method improves on the state of the art in accuracy, in usability, and in ove...
129
Voted
LICS
2002
IEEE
15 years 10 months ago
2002
IEEE
The automated construction of mathematical proof is a basic activity in computing. Since the dawn of the field of automated reasoning, there have been two divergent schools of tho...
169
Voted
ICALP
1997
Springer
15 years 9 months ago
1997
Springer
In the 1980's, Bennett introduced computational depth as a formal measure of the amount of computational history that is evident in an object's structure. In particular,...
187
click to vote
MCMASTER
1993
15 years 9 months ago
1993
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...