1901 search results - page 172 / 381 » Predicting Program Properties from |
116
click to vote
PLDI
2010
ACM
16 years 18 days ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
132
Voted
POPL
2009
ACM
15 years 10 months ago
2009
ACM
Speculative execution is an important technique that has historically been used to extract concurrency from sequential programs. While techniques to support speculation work well ...
136
click to vote
SIGSOFT
2003
ACM
15 years 8 months ago
2003
ACM
Model checking is an automated technique for verifying that a system satisfies a set of required properties. Such properties are typically expressed as temporal logic formulas, in...
113
click to vote
MICRO
2007
IEEE
15 years 9 months ago
2007
IEEE
The microarchitectural design space of a new processor is too large for an architect to evaluate in its entirety. Even with the use of statistical simulation, evaluation of a sing...
122
click to vote
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
This paper is concerned with the problem of obtaining predictable interactions between groups of agents in open environments when individual agents do not expose their bdi logic. ...