Sciweavers

2540 search results - page 343 / 508
» Abstract Logics as Dialgebras
Sort
View
SIGMOD
2001
ACM
158views Database» more  SIGMOD 2001»
14 years 11 months ago
Generating Efficient Plans for Queries Using Views
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
Foto N. Afrati, Chen Li, Jeffrey D. Ullman
EWSN
2007
Springer
14 years 10 months ago
RIDA: A Robust Information-Driven Data Compression Architecture for Irregular Wireless Sensor Networks
Abstract. In this paper, we propose and evaluate RIDA, a novel informationdriven architecture for distributed data compression in a sensor network, allowing it to conserve energy a...
Xuan Thanh Dang, Nirupama Bulusu, Wu-chi Feng
POPL
2010
ACM
14 years 8 months ago
A Verified Compiler for an Impure Functional Language
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in th...
Adam J. Chlipala
POPL
2010
ACM
14 years 8 months ago
Counterexample-Guided Focus
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
Andreas Podelski, Thomas Wies
CPAIOR
2009
Springer
14 years 5 months ago
Modelling Search Strategies in Rules2CP
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...
François Fages, Julien Martin