145 search results - page 20 / 29 » Extended Whole Program Paths |
CC
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Partial redundancy elimination (PRE) is a program transformation that identifies and eliminates expressions that are redundant on at least one (but not necessarily all) ...
100
click to vote
ICALP
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...
ICFP
2007
ACM
15 years 9 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
PADS
1996
ACM
15 years 1 months ago
1996
ACM
We investigate conservative parallel discrete event simulations for logical circuits on shared-memory multiprocessors. For a first estimation of the possible speedup, we extend th...
CSCWD
2008
Springer
14 years 11 months ago
2008
Springer
In the domain of collaborative diagnosis which joined with multi-resource, on account of equipment's complexity and diagnosis resource's heterogeneous, diagnosis task all...