2540 search results - page 343 / 508 » Abstract Logics as Dialgebras |
108
click to vote
SIGMOD
2001
ACM
16 years 1 months ago
2001
ACM
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...
126
Voted
EWSN
2007
Springer
16 years 18 days ago
2007
Springer
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...
116
Voted
POPL
2010
ACM
15 years 10 months ago
2010
ACM
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...
105
Voted
POPL
2010
ACM
15 years 10 months ago
2010
ACM
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...
107
Voted
CPAIOR
2009
Springer
15 years 7 months ago
2009
Springer
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...