Type-dependence analysis and program transformation for symbolic execution

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4424 LNCS, Issue , 2007, Pages 117-133

  Anand, Saswat ^a   Orso, Alessandro ^a   Harrold, Mary Jean ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED SOFTWARE ENGINEERING; CONSTRAINT THEORY; CRYPTOGRAPHY; PROBLEM SOLVING; STATIC ANALYSIS; MODEL CHECKING;

PROGRAM TRANSFORMATION; SYMBOLIC EXECUTION; TRANSFORMATION TECHNIQUE; TYPE-DEPENDENCE ANALYSIS; DECISION PROCEDURE; DEPENDENCE ANALYSIS; EMPIRICAL EVALUATIONS; INTER-PROCEDURAL; PROGRAM TRANSFORMATIONS; REAL APPLICATIONS; TRANSFORMATION TECHNIQUES;

CODES (SYMBOLS); APPLICATION PROGRAMS;

EID: 37149022691     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71209-1_11     Document Type: Conference Paper

References (28)

1. M. Berndl, O. Lhoták, F. Qian, L. Hendren, and N. Umanee. Points-to analysis using BDDs. In PLDI, pages 103-114, 2003.
2. C. Cadar, V. Ganesh, P. M. Pawlowski, D. L. Dill, and D. R. Engler. EXE: Automatically generating inputs of death. In CCS, pages 322-335, 2006.
3. C. Cadar, P. Twohey, V. Ganesh, and D. R. Engler. EXE: A system for automatically generating inputs of death using symbolic execution. Technical Report CSTR 2006-01, Stanford University., 2006.
4. D. Dams, W. Hesse, and G. J. Holzmann. Abstracting C with abC. In CAV, pages 515-520, 2002.
5. X. Deng, J. Lee, and Robby. Bogor/Kiasan: A k-bounded symbolic execution for checking strong heap properties of open systems. In ASE, pages 157-166, 2006.
6. B. Dutertre and L. de Moura. A Fast Linear-Arithmetic Solver for DPLL(T). In CAV, pages 81-94, 2006.
7. M. B. Dwyer, J. Hatcliff, R. Joehanes, S. Laubach, C. S. Pasareanu, Robby, H. Zheng, and W. Visser. Tool-supported program abstraction for finite-state verification. In ICSE, pages 177-187, 2001.
8. C. Flanagan, K. R. M. Leino, M. Lillibridge, G. Nelson, J. B. Saxe, and R. Stata. Extended static checking for Java. In PLDI, pages 234-245, 2002.
9. V. Ganesh and D. Dill. System Description of STP. http://www.csl.sri.com/ users/demoura/smt-comp/descriptions/stp.ps.
10. P. Godefroid, N. Klarlund, and K. Sen. DART: directed automated random testing. In PLDI, pages 213-223, 2005.
11. W. Grieskamp, N. Tillmann, and W. Schulte. XRT-exploring runtime for .NET architecture and applications. Electr. Notes Theor. Comp. Sci., 144(3):3-26, 2006.
12. S. Horwitz, T. W. Reps, and S. Sagiv. Demand interprocedural dataflow analysis. In FSE, pages 104-115, 1995.
13. Java PathFinder. http://javapathfinder.sourceforge.net.
14. S. Khurshid, C. Pasareanu, and W. Visser. Generalized symbolic execution for model checking and testing. In TACAS, pages 553-568, 2003.
15. J. C. King. Symbolic execution and program testing. CACM, 19(7):385-394, 1976.
16. O. Lhoták and L. J. Hendren. Jedd: a BDD-based relational extension of Java. In PLDI, pages 158-169, 2004.
17. W. Pugh. The Omega test: a fast and practical integer programming algorithm for dependence analysis. In SC, pages 4-13, 1991.
18. T. W. Reps. Program analysis via graph reachability. In ILPS, pages 5-19, 1997.
19. K. Sen, D. Marinov, and G. Agha. CUTE: a concolic unit testing engine for C. In FSE, pages 263-272, 2005.
20. U. Shankar, K. Talwar, J. S. Foster, and D. Wagner. Detecting format-string vulnerabilities with type qualifiers. In USENIX Security Symposium, pages 201-218, 2001.
21. O. Shivers. Control-flow analysis in Scheme. In PLDI, pages 164-174, 1988.
22. M. Sridharan, D. Gopan, L. Shan, and R. Bodík. Demand-driven points-to analysis for Java. In OOPSLA, pages 59-76, 2005.
23. E. Tilevich and Y. Smaragdakis. Transparent program transformations in the presence of opaque code. In GPCE, pages 89-94, 2006.
24. R. Vallée-Rai, L. Hendren, V. Sundaresan, P. Lam, E. Gagnon, and P. Co. Soot a Java optimization framework. In CASCON, pages 125-135, 1999.
25. W. Visser, C. S. Pasareanu, and S. Khurshid. Test input generation with Java PathFinder. In ISSTA, pages 97-107, 2004.
26. D. M. Volpano, C. E. Irvine, and G. Smith. A sound type system for secure flow analysis. Journal of Computer Security, 4(2/3):167-188, 1996.
27. J. Whaley and M. S. Lam. Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. In PLDI, pages 131-144, June 2004.
28. T. Xie, D. Marinov, W. Schulte, and D. Notkin. Symstra: A framework for generating object-oriented unit tests using symbolic execution. In TACAS, pages 365-381, 2005.