3552 search results - page 270 / 711 » Proof theory in the abstract |
302
click to vote
PLDI
2009
ACM
16 years 7 months ago
2009
ACM
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...
172
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
151
click to vote
ALT
2004
Springer
16 years 3 months ago
2004
Springer
Rademacher and Gaussian complexities are successfully used in learning theory for measuring the capacity of the class of functions to be learned. One of the most important propert...
182
click to vote
ICCV
2007
IEEE
16 years 29 days ago
2007
IEEE
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
178
click to vote
ACL2
2006
ACM
16 years 18 days ago
2006
ACM
We describe a new procedure for verifying ACL2 properties about finite state machines (FSMs) using satisfiability (SAT) solving. We present an algorithm for converting ACL2 conj...