Sciweavers

234 search results - page 15 / 47
» Deduction, Strategies, and Rewriting
Sort
View
FLOPS
2004
Springer
15 years 3 months ago
Implementing Natural Rewriting and Narrowing Efficiently
Abstract. Outermost-needed rewriting/narrowing is a sound and complete optimal demand-driven strategy for the class of inductively sequential constructor systems. Its parallel exte...
Santiago Escobar
POPL
1997
ACM
15 years 3 months ago
Call by Need Computations to Root-Stable Form
The following theorem of Huet and L
Aart Middeldorp
VLDB
2004
ACM
97views Database» more  VLDB 2004»
15 years 5 months ago
CHICAGO: A Test and Evaluation Environment for Coarse-Grained Optimization
Relational OLAP tools and other database applications generate sequences of SQL statements that are sent to the database server as result of a single information request issued by...
Tobias Kraft, Holger Schwarz
CAV
2006
Springer
125views Hardware» more  CAV 2006»
15 years 3 months ago
cascade: C Assertion Checker and Deductive Engine
We present a tool, called CAsCaDE, to check assertions in C programs as part of a multi-stage verification strategy. CAsCaDE takes as input a C program and a control file (the outp...
Nikhil Sethi, Clark Barrett
JAPLL
2010
179views more  JAPLL 2010»
14 years 10 months ago
Tractable query answering and rewriting under description logic constraints
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...
Héctor Pérez-Urbina, Boris Motik, Ia...