Sciweavers

341 search results - page 30 / 69
» Redundancy elimination revisited
Sort
View
POPL
2004
ACM
14 years 9 months ago
Simple relational correctness proofs for static analyses and program transformations
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
Nick Benton
ICCD
2005
IEEE
159views Hardware» more  ICCD 2005»
14 years 2 months ago
Architectural-Level Fault Tolerant Computation in Nanoelectronic Processors
Nanoelectronic devices are expected to have extremely high and variable fault rates; thus future processor architectures based on these unreliable devices need to be built with fa...
Wenjing Rao, Alex Orailoglu, Ramesh Karri
DEBS
2009
ACM
13 years 10 months ago
Towards efficient event aggregation in a decentralized publish-subscribe system
Recently, decentralized publish-subscribe (pub-sub) systems have gained popularity as a scalable asynchronous messaging paradigm over wide-area networks. Most existing pub-sub sys...
Jianxia Chen, Lakshmish Ramaswamy, David Lowenthal
ICDE
2009
IEEE
165views Database» more  ICDE 2009»
14 years 10 months ago
Expressive Location-Based Continuous Query Evaluation with Binary Decision Diagrams
Many location-based services require rich and expressive query language support for filtering large amounts of information. In prominent location-based services thousands of conti...
Zhengdao Xu, Hans-Arno Jacobsen
POPL
2005
ACM
14 years 9 months ago
Automated soundness proofs for dataflow analyses and transformations via local rules
We present Rhodium, a new language for writing compiler optimizations that can be automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses optimizations u...
Sorin Lerner, Todd D. Millstein, Erika Rice, Craig...