899 search results - page 63 / 180 » Cost Analysis of Games, Using Program Logic |
140
click to vote
JSC
2010
15 years 1 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...
146
click to vote
ATAL
2010
Springer
15 years 4 months 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...
140
click to vote
FORMATS
2003
Springer
15 years 8 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...
227
click to vote
POPL
2009
ACM
16 years 3 months 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...
203
click to vote
SIGSOFT
2010
ACM
15 years 1 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...