498 search results - page 97 / 100 » Term Rewriting |
154
Voted
ICCAD
2007
IEEE
16 years 15 days ago
2007
IEEE
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...
146
Voted
PLDI
2009
ACM
15 years 10 months ago
2009
ACM
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...
166
Voted
HASKELL
2009
ACM
15 years 10 months ago
2009
ACM
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...
111
Voted
EDBT
2010
ACM
15 years 10 months ago
2010
ACM
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...
131
Voted
IPSN
2007
Springer
15 years 9 months ago
2007
Springer
Many sensor nodes contain resource constrained microcontrollers where user level applications, operating system components, and device drivers share a single address space with no...