Sciweavers

173 search results - page 28 / 35
» Interprocedural analysis of asynchronous programs
Sort
View
IEEEPACT
2002
IEEE
15 years 4 months ago
Increasing and Detecting Memory Address Congruence
A static memory reference exhibits a unique property when its dynamic memory addresses are congruent with respect to some non-trivial modulus. Extraction of this congruence inform...
Samuel Larsen, Emmett Witchel, Saman P. Amarasingh...
STACS
2007
Springer
15 years 5 months ago
On Fixed Point Equations over Commutative Semirings
Fixed point equations x = f(x) over ω-continuous semirings can be seen as the mathematical foundation of interprocedural program analysis. The sequence 0, f(0), f2 (0), . . . conv...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
ICSE
2010
IEEE-ACM
15 years 4 months ago
An empirical study of optimizations in YOGI
Though verification tools are finding industrial use, the utility of engineering optimizations that make them scalable and usable is not widely known. Despite the fact that seve...
Aditya V. Nori, Sriram K. Rajamani
97
Voted
SIGSOFT
2004
ACM
15 years 5 months ago
Correlation exploitation in error ranking
Static program checking tools can find many serious bugs in software, but due to analysis limitations they also frequently emit false error reports. Such false positives can easi...
Ted Kremenek, Ken Ashcraft, Junfeng Yang, Dawson R...
AGP
1995
IEEE
15 years 3 months ago
Constraint Systems for Pattern Analysis of Constraint Logic-Based Languages
Pattern analysis consists in determining the shape of the set of solutions of the constraint store at some program points. Our basic claim is that pattern analyses can all be desc...
Roberto Bagnara