skip to main content
research-article

Abstractions from tests

Published:25 January 2012Publication History
Skip Abstract Section

Abstract

We present a framework for leveraging dynamic analysis to find good abstractions for static analysis. A static analysis in our framework is parametrised. Our main insight is to directly and efficiently compute from a concrete trace, a necessary condition on the parameter configurations to prove a given query, and thereby prune the space of parameter configurations that the static analysis must consider. We provide constructive algorithms for two instance analyses in our framework: a flow- and context-sensitive thread-escape analysis and a flow- and context-insensitive points-to analysis. We show the efficacy of these analyses, and our approach, on six Java programs comprising two million bytecodes: the thread-escape analysis resolves 80% of queries on average, disproving 28% and proving 52%; the points-to analysis resolves 99% of queries on average, disproving 29% and proving 70%.

Skip Supplemental Material Section

Supplemental Material

popl_6a_1.mp4

References

  1. T. Ball and S. Rajamani. The slam project: Debugging system software via static analysis. In POPL, pages 1--3, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. N. E. Beckman, A. V. Nori, S. K. Rajamani, and R. J. Simmons. Proofs from tests. In ISSTA, pages 3--14, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. D. Beyer, T. A. Henzinger, R. Majumdar, and A. Rybalchenko. Path invariants. In PLDI, pages 300--309, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. VanDrunen, von Dincklage, and Wiedermann}dacapoS. M. Blackburn, R. Garner, C. Hoffman, A. M. Khan, K. S. McKinley, R. Bentzur, A. Diwan, D. Feinberg, D. Frampton, S. Z. Guyer, M. Hirzel, A. Hosking, M. Jump, H. Lee, J. E. B. Moss, A. Phansalkar, D. Stefanović, T. VanDrunen, D. von Dincklage, and B. Wiedermann. The DaCapo benchmarks: Java benchmarking development and analysis. In OOPSLA, pages 169--190, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement for symbolic model checking. JACM, 50 (5), 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximation of fixed points. In POPL, pages 238--252, 1977. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. C. Csallner and Y. Smaragdakis. Check 'n' Crash: combining static checking and testing. In ICSE, pages 422--431, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. P. Godefroid, N. Klarlund, and K. Sen. Dart: directed automated random testing. In PLDI, pages 213--223, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. P. Godefroid, A. Nori, S. Rajamani, and S. Tetali. Compositional may-must program analysis: unleashing the power of alternation. In POPL, pages 43--56, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. B. S. Gulavani, T. A. Henzinger, Y. Kannan, A. V. Nori, and S. K. Rajamani. Synergy: a new algorithm for property checking. In SIGSOFT FSE, pages 117--127, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. A. Gupta, R. Majumdar, and A. Rybalchenko. From tests to proofs. In TACAS, pages 262--276, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. S. Guyer and C. Lin. Client-driven pointer analysis. In SAS, pages 214--236, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. T. Henzinger, R. Jhala, R. Majumdar, and K. McMillan. Abstractions from proofs. In POPL, pages 232--244, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. P. Liang and M. Naik. Scaling abstraction refinement via pruning. In PLDI, pages 590--601, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. P. Liang, O. Tripp, and M. Naik. Learning minimal abstractions. In POPL, pages 31--42, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. K. McMillan. Relevance heuristics for program analysis. In POPL, pages 145--146, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. A. V. Nori, S. K. Rajamani, S. Tetali, and A. V. Thakur. The yogi project: Software property checking via static analysis and testing. In TACAS, pages 178--181, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. J. Plevyak and A. Chien. Precise concrete type inference for object-oriented languages. In OOPSLA, pages 324--340, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. J. P. Quielle and J. Sifakis. Specification and verification of concurrent systems in cesar. In Proceedings of the 5th International Symposium on Programming, pages 337--350, 1982. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. N. Rinetzky, J. Bauer, T. Reps, M. Sagiv, and R. Wilhelm. A semantics for procedure local heaps and its abstractions. In POPL, pages 296--309, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. K. Sen, D. Marinov, and G. Agha. Cute: a concolic unit testing engine for c. In FSE, pages 263--272, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. G. Yorsh, T. Ball, and M. Sagiv. Testing, abstraction, theorem proving: Better together! In ISSTA, pages 145--156, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Abstractions from tests

              Recommendations

              Comments

              Login options

              Check if you have access through your login credentials or your institution to get full access on this article.

              Sign in

              Full Access

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader
              About Cookies On This Site

              We use cookies to ensure that we give you the best experience on our website.

              Learn more

              Got it!