Sciweavers

1452 search results - page 84 / 291
» Algorithmic Analysis of Array-Accessing Programs
Sort
View
200
Voted
POPL
2004
ACM
16 years 20 days ago
Global value numbering using random interpretation
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
Sumit Gulwani, George C. Necula
94
Voted
PEPM
2007
ACM
15 years 6 months ago
Behavioral similarity matching using concrete source code templates in logic queries
Program query languages and pattern-detection techniques are an essential part of program analysis and manipulation systems. Queries and patterns permit the identification of the...
Coen De Roover, Theo D'Hondt, Johan Brichau, Carlo...
185
Voted
POPL
2008
ACM
16 years 20 days ago
Lightweight semiformal time complexity analysis for purely functional data structures
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
Nils Anders Danielsson
94
Voted
ICSE
2005
IEEE-ACM
16 years 13 days ago
Object naming analysis for reverse-engineered sequence diagrams
UML sequence diagrams are commonly used to represent object interactions in software systems. This work considers the problem of extracting UML sequence diagrams from existing cod...
Atanas Rountev, Beth Harkness Connell
PASTE
2010
ACM
14 years 10 months ago
Property-aware program sampling
Monitoring or profiling programs provides us with an understanding for its further improvement and analysis. Typically, for monitoring or profiling, the program is instrumented ...
Harish Narayanappa, Mukul S. Bansal, Hridesh Rajan