Path slicing

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

Volumn , Issue , 2005, Pages 38-47

  Jhala, Ranjit ^a   Majumdar, Rupak ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Counterexample analysis; Program slicing

Indexed keywords

COUNTEREXAMPLE ANALYSIS; PATH SLICING; PROGRAM SLICING;

MATHEMATICAL MODELS;

COMPUTER PROGRAMMING;

EID: 31844452965     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. A.V. Aho, R. Sethi, and J.D. Ullman. Compilers: Principles, Techniques, and Tools. Addison-Wesley, 1986.
2. T. Ball, M. Naik, and S.K. Rajamani. From symptom to cause: Localizing errors in counterexample traces. In POPL 03: Principles of Programming Languages, pages 97-105. ACM, 2003.
3. T. Ball and S.K. Rajamani. The SLAM project: debugging system software via static analysis. In POPL 02: Principles of Programming Languages, pages 1-3. ACM, 2002.
4. S. Basu, D. Saha, and S.A. Smolka. Localizing program errors for Cimple debugging. In FORTE 04: Formal Techniques for Networked and Distributed Systems, LNCS 3235, pages 79-96. Springer, 2004.
5. D. Beyer, A. Noack, and C. Lewerentz. Simple and efficient relational querying of software structures. In Proc. WCRE, pages 216-225. IEEE, 2003.
6. R.E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers. C-35(8):677-691, 1986.
7. S. Chaki, J. Ouaknine, K. Yorav, and E.M. Clarke. Automated compositional abstraction refinement for concurrent C programs: A two-level approach. In SoftMC 03: Software Model Checking, 2003.
8. H. Chen and D. Wagner. MOPS: An infrastructure for examining security properties of software. In Proceedings of the 9th ACM Conference on Computer and Communications Security (CCS'02, Washington, DC), pages 235-244. ACM Press, 2002.
9. M. Das, S. Lerner, and M. Seigle. ESP: Path-sensitive program verification in polynomial time. In PLDl 02: Programming Language Design and Implementation, pages 57-68. ACM, 2002.
10. E.W. Dijkstra. A Discipline of Programming. Prentice-Hall, 1976.
11. J. Field, G. Ramalingam, and F. Tip. Parametric program slicing. In POPL 95: Principles of Programming Languages, pages 379-392. ACM, 1995.
12. C. Flanagan, R. Joshi, X. Ou, and J.B. Saxe. Theorem proving using lazy proof explication. In CAV 03, LNCS, pages 355-367, 2003.
13. C. Flanagan and J.B. Saxe. Avoiding exponential explosion: generating compact verification conditions. In POPL 00: Principles of Programming Languages, pages 193-205. ACM, 2000.
14. J.S. Foster, T. Terauchi, and A. Aiken. How-sensitive type qualifiers. In PLDI 02: Programming Language Design and Implementation, pages 1-12. ACM, 2002.
15. Grammatech. Codesurfer 1.9. Technical report, 2004.
16. A. Groce and W. Visser. What went wrong: Explaining counterexamples. In SPIN 03: SPIN Workshop, LNCS 2648, pages 121-135. Springer, 2003.
17. T.A. Henzinger, R. Jhala, R. Majumdar, and K.L. McMillan. Abstractions from proofs. In POPL 04: Principles of Programming Languages, pages 232-244. ACM, 2004.
18. T.A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In POPL 02: Principles of Programming Languages, pages 58-70. ACM, 2002.
19. S. Horwitz, T. Reps, and D. Binkley. Interprocedural slicing using dependence graphs. ACM TOPLAS, 12:26-61, 1990.
20. B. Korel and J. Laski. Dynamic program slicing. Information Processing Letters, 29:155-163, 1988.
21. O. Lhotak and L.J. Hendren. Jedd: a BDD-based relational extension of Java. In PLDI2004, pages 158-169, 2004.
22. M. Mock, D.C. Atkinson, C. Chambers, and S.J. Eggers. Improving program slicing with dynamic points-to data. In FSE 02: Foundations of Software Engineering, pages 71-80. ACM, 2002.
23. S. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. ACM TOPLAS, 24:217-298, 2002.
24. F. Tip. A survey of program slicing techniques. Journal of Programming Languages, 3:121-189, 1995.
25. M. Weiser. Program slices: formal, psychological, and practical investigations of an automatic program abstraction method. PhD thesis, 1979.
26. J. Whaley and M.S. Lam. Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. In PLDI 2004, pages 131-144. ACM, 2004.
27. X. Zhang and R. Gupta. Cost effective dynamic program slicing. In PLDI 04: Programming Language Design and Implementation, pages 94-106. ACM, 2004.