Sciweavers

498 search results - page 97 / 100
» Term Rewriting
Sort
View
ICCAD
2007
IEEE
102views Hardware» more  ICCAD 2007»
15 years 6 months ago
Scalable exploration of functional dependency by interpolation and incremental SAT solving
Functional dependency is concerned with rewriting a Boolean function f as a function h over a set of base functions {g1, …, gn}, i.e. f = h(g1, …, gn). It plays an important r...
Chih-Chun Lee, Jie-Hong Roland Jiang, Chung-Yang H...
PLDI
2009
ACM
15 years 4 months ago
Proving optimizations correct using parameterized program equivalence
Translation validation is a technique for checking that, after an optimization has run, the input and output of the optimization are equivalent. Traditionally, translation validat...
Sudipta Kundu, Zachary Tatlock, Sorin Lerner
HASKELL
2009
ACM
15 years 4 months ago
A compositional theory for STM Haskell
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Johannes Borgström, Karthikeyan Bhargavan, An...
EDBT
2010
ACM
188views Database» more  EDBT 2010»
15 years 4 months ago
Subsumption and complementation as data fusion operators
The goal of data fusion is to combine several representations of one real world object into a single, consistent representation, e.g., in data integration. A very popular operator...
Jens Bleiholder, Sascha Szott, Melanie Herschel, F...
IPSN
2007
Springer
15 years 3 months ago
Harbor: software-based memory protection for sensor nodes
Many sensor nodes contain resource constrained microcontrollers where user level applications, operating system components, and device drivers share a single address space with no...
Ram Kumar, Eddie Kohler, Mani B. Srivastava