4850 search results - page 241 / 970 » Proof and Computation in Geometry |
182
click to vote
ICCAD
2006
IEEE
16 years 20 days ago
2006
IEEE
This paper addresses SAT-based Unbounded Model Checking based on Craig Interpolants. This recently introduced methodology is often able to outperform BDDs and other SAT-based tech...
201
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus...
160
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Pure, or type-free, Linear Logic proof nets are Turing complete once cut-elimination is5 considered as computation. We introduce modal impredicativity as a new form of impredicati...
170
click to vote
SAC
2006
ACM
15 years 6 months ago
2006
ACM
The implementation of a correctly rounded or interval elementary function needs to be proven carefully in the very last details. The proof requires a tight bound on the overall er...
167
click to vote
CCA
2009
Springer
16 years 1 months ago
2009
Springer
In this note we discuss the information needed to compute the homology groups of a topological space. We argue that the natural class of spaces to consider are the compact absolut...