Sciweavers

152 search results - page 11 / 31
» A Self-Applicable Partial Evaluator for Term Rewriting Syste...
Sort
View
CADE
1994
Springer
14 years 16 days ago
Simple Termination Revisited
In this paper we investigate the concept of simple termination. A term rewriting system is called simply terminating if its termination can be proved by means of a simpli cation o...
Aart Middeldorp, Hans Zantema
IS
2006
13 years 8 months ago
Negations and document length in logical retrieval
Abstract. Terms which are not explicitly mentioned in the text of a document receive often a minor role in current retrieval systems. In this work we connect the management of such...
David E. Losada, Alvaro Barreiro
VEE
2006
ACM
150views Virtualization» more  VEE 2006»
14 years 2 months ago
Evaluating fragment construction policies for SDT systems
Software Dynamic Translation (SDT) systems have been used for program instrumentation, dynamic optimization, security policy enforcement, intrusion detection, and many other uses....
Jason Hiser, Daniel Williams, Adrian Filipi, Jack ...
ENTCS
2006
113views more  ENTCS 2006»
13 years 8 months ago
Mining Propositional Simplification Proofs for Small Validating Clauses
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
Ian Wehrman, Aaron Stump
IDEAS
2009
IEEE
142views Database» more  IDEAS 2009»
14 years 3 months ago
A magic approach to optimizing incremental relational expressions
This paper is concerned with a transformation-based approach to update propagation in an extended version of Codd’s relational algebra which allows for defining derived relatio...
Andreas Behrend