Sciweavers

27 search results - page 3 / 6
» On the Evaluation of Indexing Techniques for Theorem Proving
Sort
View
DEXA
2006
Springer
193views Database» more  DEXA 2006»
13 years 9 months ago
Understanding and Enhancing the Folding-In Method in Latent Semantic Indexing
Abstract. Latent Semantic Indexing(LSI) has been proved to be effective to capture the semantic structure of document collections. It is widely used in content-based text retrieval...
Xiang Wang 0002, Xiaoming Jin
ESOP
2006
Springer
13 years 9 months ago
Step-Indexed Syntactic Logical Relations for Recursive and Quantified Types
We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...
Amal J. Ahmed
SIGIR
2006
ACM
13 years 11 months ago
Hybrid index maintenance for growing text collections
We present a new family of hybrid index maintenance strategies to be used in on-line index construction for monotonically growing text collections. These new strategies improve up...
Stefan Büttcher, Charles L. A. Clarke, Brad L...
POPL
2012
ACM
12 years 27 days ago
Playing in the grey area of proofs
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
Krystof Hoder, Laura Kovács, Andrei Voronko...
KBSE
1997
IEEE
13 years 9 months ago
NORA/HAMMR: Making Deduction-Based Software Component Retrieval Practical
Deduction-based software component retrieval uses preand postconditions as indexes and search keys and an automated theorem prover (ATP) to check whether a component matches. This...
Johann Schumann, Bernd Fischer 0002