899 search results - page 63 / 180 » Cost Analysis of Games, Using Program Logic |
100
click to vote
JSC
2010
14 years 10 months ago
2010
We study the automated verification of pointer safety for heap-manipulating imperative programs with unknown procedure calls. Given a Hoare-style partial correctness specificati...
115
click to vote
ATAL
2010
Springer
15 years 29 days ago
2010
Springer
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
113
click to vote
FORMATS
2003
Springer
15 years 5 months ago
2003
Springer
Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a specification formalism suitable for describing both nondeterminis...
189
click to vote
POPL
2009
ACM
16 years 14 days ago
2009
ACM
This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers. The analysis uses an abstract domain based on a restricted frag...
158
click to vote
SIGSOFT
2010
ACM
14 years 9 months ago
2010
ACM
We present an effective dynamic analysis for finding a broad class of deadlocks, including the well-studied lock-only deadlocks as well as the less-studied, but no less widespread...