Sciweavers

183 search results - page 11 / 37
» Automated theorem proving by resolution in non-classical log...
Sort
View
ATVA
2004
Springer
138views Hardware» more  ATVA 2004»
13 years 11 months ago
Providing Automated Verification in HOL Using MDGs
While model checking suffers from the state space explosion problem, theorem proving is quite tedious and impractical for verifying complex designs. In this work, we present a veri...
Tarek Mhamdi, Sofiène Tahar
CADE
2004
Springer
14 years 7 months ago
The CADE ATP System Competition
The CADE ATP System Competition (CASC) is an annual evaluation of fully automatic, first-order Automated Theorem Proving systems. CASC-18 was the seventh competition in the CASC se...
Geoff Sutcliffe, Christian B. Suttner
LORI
2009
Springer
14 years 2 months ago
First-Order Logic Formalisation of Arrow's Theorem
Arrow’s Theorem is a central result in social choice theory. It states that, under certain natural conditions, it is impossible to aggregate the preferences of a finite set of i...
Umberto Grandi, Ulle Endriss
CADE
1990
Springer
13 years 11 months ago
Presenting Intuitive Deductions via Symmetric Simplification
In automated deduction systems that are intended for human use, the presentation of a proof is no less important than its discovery. For most of today's automated theorem pro...
Frank Pfenning, Dan Nesmith
PLDI
2003
ACM
14 years 24 days ago
Automatically proving the correctness of compiler optimizations
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
Sorin Lerner, Todd D. Millstein, Craig Chambers