Sciweavers

180 search results - page 5 / 36
» Precise interprocedural analysis using random interpretation
Sort
View
ICSE
2008
IEEE-ACM
15 years 10 months ago
Calysto: scalable and precise extended static checking
Automatically detecting bugs in programs has been a long-held goal in software engineering. Many techniques exist, trading-off varying levels of automation, thoroughness of covera...
Domagoj Babic, Alan J. Hu
IEEEPACT
2006
IEEE
15 years 3 months ago
A two-phase escape analysis for parallel java programs
Thread escape analysis conservatively determines which objects may be accessed in more than one thread. Thread escape analysis is useful for a variety of purposes – finding rac...
Kyungwoo Lee, Samuel P. Midkiff
JSA
2006
131views more  JSA 2006»
14 years 9 months ago
Bidirectional liveness analysis, or how less than half of the Alpha's registers are used
Interprocedural data flow analyses of executable programs suffer from the conservative assumptions that need to be made because no precise control flow graph is available and beca...
Bjorn De Sutter, Bruno De Bus, Koen De Bosschere
POPL
2008
ACM
15 years 10 months ago
Generating precise and concise procedure summaries
We present a framework for generating procedure summaries that are precise -- applying the summary in a given context yields the same result as re-analyzing the procedure in that ...
Greta Yorsh, Eran Yahav, Satish Chandra
POPL
2003
ACM
15 years 10 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula