Sciweavers

143 search results - page 22 / 29
» Data-Flow Analysis of Program Fragments
Sort
View
POPL
2003
ACM
14 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
PEPM
2009
ACM
14 years 2 months ago
Clone detection and removal for Erlang/OTP within a refactoring environment
A well-known bad code smell in refactoring and software maintenance is duplicated code, or code clones. A code clone is a code fragment that is identical or similar to another. Un...
Huiqing Li, Simon Thompson
ICS
1997
Tsinghua U.
14 years 1 months ago
Iteration Space Slicing and Its Application to Communication Optimization
Program slicing is an analysis that answers questions such as \Which statements might a ect the computation of variable v at statement s?" or \Which statements depend on the ...
William Pugh, Evan Rosser
FMCAD
2009
Springer
14 years 4 months ago
Decision diagrams for linear arithmetic
—Boolean manipulation and existential quantification of numeric variables from linear arithmetic (LA) formulas is at the core of many program analysis and software model checkin...
Sagar Chaki, Arie Gurfinkel, Ofer Strichman
CONCUR
2011
Springer
12 years 9 months ago
Reasoning about Threads with Bounded Lock Chains
The problem of model checking threads interacting purely via the standard synchronization primitives is key for many concurrent program analyses, particularly dataflow analysis. U...
Vineet Kahlon