Sciweavers

2715 search results - page 262 / 543
» An Implementation of Narrowing Strategies
Sort
View
DAC
2002
ACM
16 years 7 months ago
A comparison of three verification techniques: directed testing, pseudo-random testing and property checking
This paper describes the verification of two versions of a bridge between two on-chip buses. The verification was performed just as the Infineon Technologies Design Centre in Bris...
Mike Bartley, Darren Galpin, Tim Blackmore
ICML
2008
IEEE
16 years 7 months ago
Fast estimation of first-order clause coverage through randomization and maximum likelihood
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
Filip Zelezný, Ondrej Kuzelka
WWW
2001
ACM
16 years 7 months ago
Building a distributed full-text index for the Web
We identify crucial design issues in building a distributed inverted index for a large collection of web pages. We introduce a novel pipelining technique for structuring the core ...
Sergey Melnik, Sriram Raghavan, Beverly Yang, Hect...
ICFP
2009
ACM
16 years 7 months ago
Purely functional lazy non-deterministic programming
Functional logic programming and probabilistic programming have demonstrated the broad benefits of combining laziness (non-strict evaluation with sharing of the results) with non-...
Sebastian Fischer, Oleg Kiselyov, Chung-chieh Shan
CADE
2009
Springer
16 years 7 months ago
Ground Interpolation for Combined Theories
Abstract. We give a method for modular generation of ground interpolants in modern SMT solvers supporting multiple theories. Our method uses a novel algorithm to modify the proof t...
Amit Goel, Sava Krstic, Cesare Tinelli