1096 search results - page 198 / 220 » Computation Slicing: Techniques and Theory |
119
click to vote
CADE
2005
Springer
16 years 23 days ago
2005
Springer
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
114
Voted
STOC
2003
ACM
16 years 22 days ago
2003
ACM
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quant...
186
click to vote
SIGMOD
2009
ACM
16 years 20 days ago
2009
ACM
Conditional functional dependencies (CFDs) have recently been proposed as extensions of classical functional dependencies that apply to a certain subset of the relation, as specif...
POPL
2010
ACM
15 years 9 months ago
2010
ACM
In functional programming, monadic characterizations of computational effects are normally understood denotationally: they describe how an effectful program can be systematically ...
87
Voted
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
— We prove the following strong hardness result for learning: Given a distribution on labeled examples from the hypercube such that there exists a monomial (or conjunction) consi...