23 search results - page 5 / 5 » fossacs 2006 |
FOSSACS
2006
Springer
14 years 6 days 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...
FOSSACS
2006
Springer
14 years 6 days ago
2006
Springer
We define a new decidable logic for expressing and checking invariants of programs that manipulate dynamically-allocated objects via pointers and destructive pointer updates. The ...
FOSSACS
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. This paper considers the probabilistic may/must testing theory for processes having external, internal, and probabilistic choices. We observe that the underlying testing ...