Sound, complete and scalable path-sensitive analysis

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn , Issue , 2008, Pages 270-280

  Dillig, Isil ^a   Dillig, Thomas ^a   Aiken, Alex ^a  

^a Stanford University

Author keywords

Path and context sensitive analysis; Static analysis; Strongest necessary weakest sufficient conditions

Indexed keywords

CLOSED-FORM SOLUTIONS; LINES OF CODES; LINUX KERNELS; ORIGINAL SYSTEMS; PATH- AND CONTEXT-SENSITIVE ANALYSIS; PROGRAM ANALYSIS; PROGRAM PROPERTIES; RECURSIVE CONSTRAINTS; RECURSIVE FORMULAS; SATISFIABILITY; SENSITIVE ANALYSIS; SENSITIVE CONDITIONS; STRONGEST NECESSARY/WEAKEST SUFFICIENT CONDITIONS; UNOBSERVABLE;

C (PROGRAMMING LANGUAGE); COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; COMPUTERS; JAVA PROGRAMMING LANGUAGE; LINGUISTICS; RECURSIVE FUNCTIONS;

CONTEXT SENSITIVE LANGUAGES;

EID: 57349184127     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1375581.1375615     Document Type: Conference Paper

References (23)

1. A. Aiken, S. Bugrara, I. Dillig, T. Dillig, B. Hackett, and P. Hawkins. An overview od the SATURN project. In Proc. Workshop on Program Analysis for Software Tools and Engineering, pages 43-48, 2007.
2. A. Aiken, E.L. Wimmers, and J. Palsberg. Optimal Representations of Polymorphic Types with Subtyping. Higher-Order and Symbolic Computation, 12(3): 237-282, 1999.
3. T. Ball and S. Rajamani. Bebop: A symbolic model checker for boolean programs. In Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification, pages 113-130, London, UK, 2000. Springer-Verlag.
4. T. Ball and S. Rajamani. Automatically validating temporal safety properties of interfaces. LNCS, 2057:103-122, 2001.
5. T. Ball and S. Rajamani. Bebop: a path-sensitive interprocedural dataflow engine. In PASTE '01: Proceedings of the 2001 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering, pages 97-103, New York, NY, USA, 2001. ACM.
6. R. Bloem, I. Moon, K. Ravi, and F. Somenzi. Approximations for fixpoint computations in symbolic model checking.
7. G. Boole. An Investigation of the Laws of Thought. Dover Publications, Incorporated, 1858.
8. S. Bugrara and A. Aiken. Verifying the safety of user pointer dereferences. In IEEE Symposium on Security and Privacy, 2008.
9. 20 states and beyond. In Proc. Symposium on Logic in Computer Science, June 1990.
10. D. Dill and H. Wong-Toi. Verification of real-time systems by successive over and under approximation. In Proc. International Conference On Computer Aided Verification, volume 939, pages 409-422, 1995.
11. M. Das, S. Lemer, and M. Seigle. ESP: Path-sensitive program verification in polynomial time. In Proc. Conference on Programming Language Design and Implementation, pages 57-68, 2002.
12. I. Dillig, T. Dillig, and A. Aiken. Static error detection using semantic inconsistency inference. In Proc. Conference on Programming Language Design and Implementation, pages 335-345, 2007.
13. J. Esparaza and S. Schwoon. A bdd-based model checker for recursive programs. Lecture Notes in Computer Science, 2102/2001: 324-336, 2001.
14. B. Hackett and A. Aiken. How is aliasing used in systems software? In Proc. International Symposium on Foundations of Software Engineering, pages 69-80, 2006.
15. F. Henglein. Type inference and semi-unification. In Proc. Conference on LISP and Functional Programming, pages 184-197, 1988.
16. T. Henzinger, R. Jhala, R. Majumdar, and K. McMillan. Abstractions from proofs. In Proc. 31st Symposium on Principles of Programming Languages, pages 232-244, 2004.
17. F. Ivancic, Z. Yang, M.K. Ganai, A. Gupta, I. Shlyakhter, and P. Ashar. F-soft: software verification platform. Lecture Notes in Computer Science, 3576/2005: 301-306, 2005.
18. F. Lin. On strongest necessary and weakest sufficient conditions. In Proc. International Conference on Principles of Knowledge Representation and Reasoning, pages 143-159, April 2000.
19. A. Mycroft. Polymorphic type schemes and recursive definitions. In Proc. Colloquium on International Symposium on Programming, pages 217-228, 1984.
20. T. Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In POPL '95: Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 49-61, New York, NY, USA, 1995. ACM.
21. D. Schmidt. A calculus of logical relations for over- and underap-proximating static analyses. Science of Computer Programming, 64(1): 29-53, 2007.
22. M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis. Program Flow Analysis: Theory and Applications, pages 189-234, 1981.
23. Y. Xie and A. Aiken. Scalable error detection using boolean satisfiability. SIGPLAN Not, 40(1): 351-363, 2005.