Joining dataflow with predicates

ESEC/FSE'05 - Proceedings of the Joint 10th European Software Engineering Conference (ESEC) and 13th ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE-13)

Volumn , Issue , 2005, Pages 227-236

  Fischer, Jeffrey ^a   Jhala, Ranjit ^b   Majumdar, Rupak ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Counterexample analysis; Dataflow analysis; Model checking; Predicate abstraction

Indexed keywords

CODES (SYMBOLS); COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; INFORMATION ANALYSIS; ITERATIVE METHODS;

COUNTEREXAMPLE ANALYSIS; MODEL CHECKING; PREDICATE ABSTRACTION;

DATA FLOW ANALYSIS;

EID: 32344451326     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1081706.1081742     Document Type: Conference Paper

References (31)

1. T. Agerwala and J. Misra. Assertion graphs for verifying and synthesizing programs. Technical Report 83, University of Texas, Austin, 1978.
2. A. Aiken, J.S. Foster, J. Kodumal, and T. Terauchi. Checking and inferring local non-aliasing. In PLDI 03: Programming Language Design and Implementation, pages 129-140. ACM, 2003.
3. R. Alur, A. Itai, R.P. Kurshan, and M. Yannakakis. Timing verification by successive approximation. Information and Computation, 118(1):142-157, 1995.
4. T. Ball and S.K. Rajamani. Personal communication.
5. 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.
6. R. Bodik, R. Gupta, and M.L. Soffa. Refining dataflow information using infeasible paths. In FSE 97: Foundations of Software Engineering, LNCS 1301, pages 361-377. Springer, 1997.
7. W.R. Bush, J.D. Pincus, and D.J. Sielaff. A static analyzer for finding dynamic programming errors. Software Practice and Experience, 30:775-802, 2000.
8. S. Chaki, E.M. Clarke, A. Groce, and O. Strichman. Predicate abstraction with minimum predicates. In CHARME 03: Correct Hardware Design and Verification, LNCS 2860, pages 19-34. Springer, 2003.
9. E.M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In CAV 00: Computer-Aided Verification, LNCS 1855, pages 154-169. Springer, 2000.
10. E.M. Clarke, D. Kroening, and F. Lerda. A tool for checking ANSI-C programs. In TACAS 04: Tools and Algorithms for the Construction and Analysis of Systems, LNCS 2988, pages 168-176. Springer, 2004.
11. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for the static analysis of programs by construction or approximation of fixpoints. In POPL 77: Principles of Programming Languages, pages 238-252. ACM, 1977.
12. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In POPL 79: Principles of Programming Languages, pages 269-282. ACM, 1979.
13. M. Das, S. Lerner, and M. Seigle. ESP: path-sensitive program verification in polynomial time. In PLDI 02: Programming Language Design and Implementation, pages 57-68. ACM, 2002.
14. E.W. Dijkstra. A Discipline of Programming. Prentice-Hall, 1976.
15. M. Dwyer and L. Clarke. A flexible architecture for building dataflow analyzers. In ICSE 96: International Conference on Software Engineering, pages 554-564. ACM, 1996.
16. M.B. Dwyer, L.A. Clarke, J.M. Cobleigh, and G. Naumovich. Flow analysis for verifying properties of concurrent software systems. ACM Transactions on Software Engineering Methodology, 13(4):359-430, 2004.
17. J.S. Foster, T. Terauchi, and A. Aiken. Flow-sensitive type qualifiers. In PLDI 02: Programming Language Design and Implementation, pages 1-12. ACM, 2002.
18. S. Graf and H. Saïdi. Construction of abstract state graphs with PVS. In CAV 97: Computer-aided Verification, LNCS 1254, pages 72-83. Springer, 1997.
19. T.A. Henzinger, R. Jhala, R. Majumdar, and K.L. MoMillan. Abstractions from proofs. In POPL 04: Principles of Programming Languages, pages 232-244. ACM, 2004.
20. T.A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In POPL 02: Principles of Programming Languages, pages 58-70. ACM Press, 2002.
21. L.H. Holley and B.K. Rosen. Qualified data flow problems. IEEE Transactions on Software Engineering, SE-7:60-78, 1981.
22. Gary Kildall. A unified approach to global program optimization. In POPL 73: Principles of Programming Languages, pages 194-206. ACM, 1973.
23. B. Murphy. Frameworks for precise program analysis. PhD thesis, Stanford University, 2001.
24. M. Musuvathi, D.Y.W. Park, A. Chou, D.R. Engler, and D.L. Dill. CMC: A pragmatic approach to model checking real code. In OSDI 02: Operating Systems Design and Implementation. ACM, 2002.
25. F. Nielson. Expected forms of data flow analyses. In Programs as Data Objects, LNCS 217, pages 172-191. Springer, 1985.
26. T. Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In POPL 95: Principles of Programming Languages, pages 49-61. ACM, 1995.
27. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. In POPL 99: Principles of Programming Languages, pages 105-118, ACM, 1999.
28. R.E. Strom and S. Yemini. Typestate: A programming language concept for enhancing software reliability. IEEE Trans. Software Eng., 12(1):157-171, 1986.
29. P. Tu and D. Padua. Automatic array privatization. In Compiler Optimizations for Scalable Parallel Systems Languages, pages 247-284, 2001.
30. M.N. Wegman and K. Zadek. Constant propagation with conditional branches. A CM Transactions on Programming Languages and Systems, 13:181-210, 1991.
31. Y. Xie and A. Aiken. Scalable error detection using boolean satisfiability. In POPL 05: Principles of Programming Languages, pages 351-363. ACM, 2005.