1422 search results - page 140 / 285 » Complementation in Abstract Interpretation |
176
click to vote
SARA
2009
Springer
16 years 22 days ago
2009
Springer
We present algorithms for testing the satisfiability and finding the tightened transitive closure of conjunctions of addition constraints of the form ±x ± y ≤ d and bound co...
134
click to vote
CAV
2007
Springer
16 years 11 days ago
2007
Springer
Abstract. TVLA is a parametric framework for shape analysis that can be easily instantiated to create different kinds of analyzers for checking properties of programs that use link...
178
click to vote
GI
2007
Springer
16 years 10 days ago
2007
Springer
: In this article we advocate an integrated approach for the automation of module or software integration testing and static analysis. It is illustrated how funmethods of static an...
163
click to vote
SAS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We specify an information flow analysis for a simple imperative language, using a Hoare-like logic. The logic facilitates static checking of a larger class of programs t...
139
click to vote
CAV
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We present a new method for the generation of linear invariants which reduces the problem to a non-linear constraint solving problem. Our method, based on Farkas’ Lemma...