1452 search results - page 145 / 291 » Algorithmic Analysis of Array-Accessing Programs |
101
click to vote
SSS
2009
Springer
15 years 7 months ago
2009
Springer
We consider setting up sleep scheduling in sensor networks. We formulate the problem as an instance of the fractional domatic partition problem and obtain a distributed approximati...
112
click to vote
ISSRE
2006
IEEE
15 years 6 months ago
2006
IEEE
Forward computation of dynamic slices is necessary to support interactive debugging and online analysis of long running programs. However, the overhead of existing forward computi...
128
Voted
ESORICS
2010
Springer
15 years 24 days ago
2010
Springer
Abstract We propose an approach to certify the information flow security of multi-threaded programs independently from the scheduling algorithm. A scheduler-independent verificatio...
130
Voted
ITP
2010
15 years 2 months ago
2010
Recent advances in termination analysis have yielded new methods and tools that are highly automatic. However, when they fail, even experts have difficulty understanding why and de...
119
click to vote
POPL
1993
ACM
15 years 4 months ago
1993
ACM
We study the type inference problem for a system with type classes as in the functional programminglanguage Haskell. Type classes are an extension of ML-style polymorphismwith ove...