957 search results - page 32 / 192 » Modular Static Program Analysis |
CADE
2008
Springer
14 years 11 months ago
2008
Springer
Rely-guarantee (RG) reasoning is useful for modular Hoare-style proofs of concurrent programs. However, RG requires that assertions be proved stable under the actions of the enviro...
ASIAN
2006
Springer
14 years 2 months ago
2006
Springer
Polyhedral analysis [9] is an abstract interpretation used for automatic discovery of invariant linear inequalities among numerical varia program. Convexity of this abstract domain...
RTA
2007
Springer
14 years 5 months ago
2007
Springer
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
CSFW
2010
IEEE
14 years 2 months ago
2010
IEEE
—This paper seeks to answer fundamental questions about trade-offs between static and dynamic security analysis. It has been previously shown that flow-sensitive static informat...
CAV
2009
Springer
14 years 11 months ago
2009
Springer
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...