1111 search results - page 64 / 223 » Program Analysis as Model Checking of Abstract Interpretatio... |
160
click to vote
CORR
2009
Springer
15 years 11 days ago
2009
Springer
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
130
Voted
IFM
2009
Springer
15 years 9 months ago
2009
Springer
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...
135
click to vote
ESOP
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
131
click to vote
SIGSOFT
2006
ACM
16 years 3 months ago
2006
ACM
We consider the problem if a given program satisfies a specified safety property. Interesting programs have infinite state spaces, with inputs ranging over infinite domains, and f...
111
Voted
CONCUR
2006
Springer
15 years 6 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...