4716 search results - page 30 / 944 » Iterative-free program analysis |
ICFP
2007
ACM
14 years 9 months ago
2007
ACM
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
TACAS
2009
Springer
14 years 4 months ago
2009
Springer
Context-bounded analysis has been shown to be both efficient and effective at finding bugs in concurrent programs. According to its original definition, context-bounded analysis...
ICSE
2007
IEEE-ACM
14 years 9 months ago
2007
IEEE-ACM
Analyzing a program run can provide important insights about its correctness. Dynamic analysis of complex correctness properties, however, usually results in significant run-time ...
FPCA
1995
14 years 1 months ago
1995
This paper discusses the derivation of functional programs for grammar analysis problems, such as the Empty problem and the Reachable problem. Grammar analysis problems can be div...
CC
2012
Springer
12 years 5 months ago
2012
Springer
The computational cost and precision of a shape style heap analysis is highly dependent on the way method calls are handled. This paper introduces a new approach to analyzing metho...