1882 search results - page 269 / 377 » Transformational Programming and Forests |
126
Voted
KR
1998
Springer
15 years 9 months ago
1998
Springer
We study the problem of probabilistic deduction with conditional constraints over basic events. We show that globallycomplete probabilistic deduction with conditional constraints ...
164
click to vote
CGO
2009
IEEE
15 years 9 months ago
2009
IEEE
Effectively migrating sequential applications to take advantage of parallelism available on multicore platforms is a well-recognized challenge. This paper addresses important aspec...
137
click to vote
EMSOFT
2004
Springer
15 years 8 months ago
2004
Springer
High-level programming languages offer significant expressivity but provide little or no guarantees about resource use. Resourcebounded languages -- such as hardware-description l...
136
click to vote
CONCUR
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
182
click to vote
FOSSACS
2006
Springer
15 years 8 months ago
2006
Springer
Chaitin proved that register allocation is equivalent to graph coloring and hence NP-complete. Recently, Bouchez, Brisk, and Hack have proved independently that the interference gr...