The trace partitioning abstract domain

ACM Transactions on Programming Languages and Systems

Volumn 29, Issue 5, 2007, Pages

  Rival, Xavier ^a   Mauborgne, Laurent ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; THEOREM PROVING;

ABSTRACT DOMAIN; STATIC ANALYZERS; TRACE PARTITIONING;

STATIC ANALYSIS;

EID: 34548461979     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/1275497.1275501     Document Type: Conference Paper

References (36)

1. AMMONS, G. AND LARUS, J. R. 1998. Improving data-flow analysis with path profiles. In Proceedings of the Conference on Programming Languages, Design and Implementation (PLDI) (Montreal, Canada). ACM, New York, 72-84.
2. BALL, T. AND RAJAMANI, S. K. 2001. Automatically validating temporal safety properties of interfaces. In Proceedings of the 8th International SPIN Workshop (Toronto, Canada). Lecture Notes in Computer Science. Springer, 103-122.
3. BALL, T. AND LARUS, J. R. 1996. Efficient path profiling. In Proceedings of the Annual ACMIEEE International Symposium on Microarchitecture (MICRO). IEEE Computer Society, Washington DC, 46-57.
4. BLANCHET, B., COUSOT, P., COUSOT, R., FERET, J., MAUBORGNE, L., MINÉ, A., MONNIAUX, D., AND RIVAL, X. 2003. A static analyzer for large safety critical software. In Proceedings of the Conference on Programming Languages, Design and Implementation (PLDI) (San Diego, CA). ACM Press, New York, 196-207.
5. BLANCHET, B., COUSOT, P., COUSOT, R., FERET, J., MAUBORGNE, L., MINÉ, A., MONNIAUX, D., AND RIVAL, X. 2002. Design and implementation of a special-purpose static program analyzer for safetycritical real-time embedded software. In The Essence of Computation: Complexity, Analysis, Transformation. Essays Dedicated to Neil D. Jones, T. Mogensen et al., eds. Lecture Notes in Computer Science, vol. 2566. Springer, 85-108.
6. BODÍK, R., GUPTA, R., AND SOFFA, M. L. 1997. Refining data flow information using infeasible paths. In Proceedings of the 6th European Software Engineering Conference and 5th ACMISIGSOFT Symposium on Foundations of Software Engineering (Zurich, Switzerland). Springer, 361-377.
7. BOURDONCLE, F. 1993. Efficient chaotic iteration strategies with widenings. In Proceedings of the International Conference on Formal Methods in Programming and Their Applications. Lecture Notes in Computer Science, vol. 735, Springer, 128-142.
8. BRYANT, R. 1986. Graph based algorithms for Boolean function manipulation. IEEE Trans. Comput. C-35, 677-691.
9. COUSOT, R 1981. Semantic foundations of program analysis. In Program Flow Analysis: Theory and Applications, S. Muchnick and N. Jones, eds. Prentice-Hall, Englewood Cliffs, NJ. Chapter 10, 303-342.
10. COUSOT, R AND COUSOT, R. 1979. Systematic design of program analysis frameworks. In Conference Record of the 6th Symposium on Principles of Programming Languages (POPL) (San Antonio, TX). ACM Press, New York, 269-282.
11. COUSOT, R AND COUSOT, R. 1977. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the 4th Symposium on Principles of Programming Languages (POPL) (Los Angeles, CA). ACM Press, New York, 238-252.
12. COUSOT, R AND COUSOT, R. 1992a. Abstract interpretation and application to logic programs. J. Logic Program. 13, 2-3, 103-179.
13. COUSOT, R AND COUSOT, R. 1992b. Abstract interpretation frameworks. J. Logic Comput. 2, 4 (Aug.), 511-547.
14. COUSOT, P., COUSOT, R., FERET, J., MAUBORGNE, L., MINÉ, A., MONNIAUX, D., AND RWAL, X. 2005. The ASTREE analyzer. In Proceedings of the European Symposium On Programming (ESOP) (Edinburgh, UK). Lecture Notes in Computer Science, vol. 3444. Springer.
15. COUSOT, R AND HALBWACHS, N. 1978. Automatic discovery of linear restraints among variables of a program. In Conference Record of the 5th Symposium, on Principles of Programming Languages (POPL) (Tucson, AZ). ACM Press, New York, 84-97.
16. DAS, M., LERNER, S., AND SEIGLE, M. 2002. ESP: Path-Sensitive program verification in polynomial time. In Proceedings of the Conference on Programming Languages, Design and Implementation (PLDI) (Berlin, Germany). ACM Press, New York, 57-68.
17. FERET, J. 2005. The arithmetic-geometric progression abstract domain. In Proceedings of the 6th Conference on Verification, Model-Cecking and Abstract Interpretation (VMCAI) (Paris), R. Cousot, ed. Lecture Notes in Computer Science, vol. 3385. Springer, 2-18.
18. FERET, J. 2004. Static analysis of digital filters. In Proceedings of the European Symposium on Programming (ESOP) (Barcelona, Spain). Lecture Notes in Computer Science, vol. 2986, Springer, 33-48.
19. FLANAGAN, C., LEINO, K. R., LILLIBRIDGE, M., NELSON, G., SAXE, J. B., AND STATA, R. 2002. Extended static checking for Java. In Proceedings of the Conference on Programming Languages, Design and Implementation (PLDI). ACM Press, New York, 234-245.
20. GRANGER, P. 1989. Static analysis of arithmetical congruences. Int. J. Comput. Math. 30, 165-190.
21. HALBWACHS, N., LAGNIER, F., AND RAYMOND, R 1993. Synchronous observers and the verification of reactive systems. In Proceedings of the Workshop on Algebraic Methodology and Software Technology (AMAST) (Twente, The Netherlands). Springer, 83-96.
22. HANDJIEVA, M. AND TZOLOVSKI, S. 1998. Refining static analyses by trace-based partitioning using control flow. In Proceedings of the 5th International Static Analysis Symposium (SAS). Lecture Notes in Computer Science, Springer, 200-214.
23. HOLLEY, L. H. AND ROSEN, B. K. 1980. Qualified data flow problems. In Proceedings of the 7th ACM Symposium on Principles of Programming Languages (POPL) (Las Vegas, NV). ACM Press, New York, 68-82.
24. HORWITZ, S., REPS, T., AND BINKLEY, D. 1988. Interprocedural slicing using dependence graphs. In Proceedings of the Conference on Programming Languages, Design and Implementation (PLDI) (Atlanta, GA). ACM Press, New York, 35-46.
25. JEANNET, B. 2003. Dynamic partitioning in linear relation analysis: Application to the verification of reactive systems. Formal Methods Syst. Des. 23, 1, 5-37.
26. JEANNET, B., HALBWACHS, N., AND RAYMOND, R 1999. Dynamic partitioning in analyses of numerical properties. In Proceedings of the 6th Static Analysis Symposium (SAS) (Venice, Italy). Lecture Notes in Computer Science, vol. 1694. Springer, 39-50.
27. JONES, N. D. AND MUCHNICK, S. S. 1979. Flow analysis and optimization of LISP-like structures. In Proceedings of the 6th ACM Symposium on Principles of Programming Languages (POPL) (San Antonio, TX). ACM Press, New York, 244-256.
28. MAUBORGNE, L. 2004. ASTRÉE: Verification of absence of run-time error. In Building the Information Society. Kluwer Academic, Toulouse, France. Chapter 4, 384-392.
29. MELSKI, D. AND REPS, T. W. 2003. The interprocedural express-lane transformation. In Proceedings of the 12th International Conference on Compiler Construction (CC) (Warsaw, Poland). Lecture Notes in Computer Science. Springer, 200-216.
30. MINÉ, A. 2001. The octagon abstract domain. Higher-Order Symb. Comput. 19, 1, 31-100.
31. MONNIAUX, D. 2005. The parallel implementation of the Astrée static analyzer. In Proceedings of the 6th Asian Symposium on Programming Languages and Systems (APLAS). Lecture Notes in Computer Science, vol. 3780. Springer.
32. PLOTKIN, G. D. 1981. A structural approach to operational semantics. Tech. Rep. DAIMI FN-19, Aarhus University, Denmark. September.
33. REPS, T., HORWITZ, S., AND SAGIV, M. 1995. Precise interprocedural dataflow analysis via graph reachability. In Proceedings of the 22nd ACM Symposium on Principles of Programming Languages (POPL) (San Fransisco, CA). ACM Press, New York, 49-61.
34. RIVAL, X. 2005. Understanding the origin of alarms in ASTRÉE. In Proceedings of the 12th Static Analysis Symposium (SAS) (London). Lecture Notes in Computer Science, vol. 3672. Springer, 303-319.
35. SHARIR, M. AND PNUELI, A. 1981. Two approaches to interprocedural data flow analysis. In Program Flow Analysis: Theory and Applications, S. Muchnick and N. Jones, eds. Prentice-Hall, Englewood Cliffs, NJ. Chapter 7, 189-233.
36. VENET, A. 1996. Abstract cofibered domains: Application to the alias analysis of untyped programs. In Proceedings of the Static Analysis Symposium (SAS) (Aachen, Germany). Lecture Notes in Computer Science, vol. 1145, Springer.