Sciweavers

5499 search results - page 47 / 1100
» Generalized Rewrite Theories
Sort
View
DAC
2007
ACM
14 years 8 months ago
On Resolution Proofs for Combinational Equivalence
Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to pr...
Satrajit Chatterjee, Alan Mishchenko, Robert K. Br...
LCTRTS
2005
Springer
14 years 1 months ago
System-wide compaction and specialization of the linux kernel
The limited built-in configurability of Linux can lead to expensive code size overhead when it is used in the embedded market. To overcome this problem, we propose the applicatio...
Dominique Chanet, Bjorn De Sutter, Bruno De Bus, L...
DOLAP
2004
ACM
14 years 1 months ago
Aggregate queries in peer-to-peer OLAP
A peer-to-peer (P2P) data management system consists essentially of a network of peer systems, each maintaining full autonomy over its own data resources. Data exchange between pe...
Mauricio Minuto Espil, Alejandro A. Vaisman
PODS
2010
ACM
249views Database» more  PODS 2010»
14 years 23 days ago
Semantic query optimization in the presence of types
Both semantic and type-based query optimization rely on the idea that queries often exhibit non-trivial rewritings if the state space of the database is restricted. Despite their ...
Michael Meier 0002, Michael Schmidt, Fang Wei, Geo...
GG
2008
Springer
13 years 8 months ago
Behavior Preservation in Model Refactoring Using DPO Transformations with Borrowed Contexts
Behavior preservation, namely the fact that the behavior of a model is not altered by the transformations, is a crucial property in refactoring. The most common approaches to behav...
Guilherme Rangel, Leen Lambers, Barbara König...