Path feasibility analysis for string-manipulating programs

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

Volumn 5505 LNCS, Issue , 2009, Pages 307-321

  Bjørner, Nikolaj ^a   Tillmann, Nikolai ^a   Voronkov, Andrei ^b  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FEASIBILITY ANALYSIS; FINITE DOMAINS; FINITE MODEL; LIBRARY FUNCTIONS; SATISFIABILITY MODULO THEORIES; SECOND PHASE; SYMBOLIC EXECUTION; TEST CASE GENERATION; UNDECIDABILITY;

ABSTRACTING; COMPUTABILITY AND DECIDABILITY;

COMPUTER SOFTWARE; FORMAL LOGIC;

EID: 70350490611     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00768-2_27     Document Type: Conference Paper

References (17)

1. Bradley, A.R., Manna, Z., Sipma, H.B.: What's decidable about arrays? In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol. 3855, pp. 427-442. Springer, Heidelberg (2005
2. Büchi, J.R., Senger, S.: Definability in the existential theory of concatenation. Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik (1988
3. Cadar, C., Ganesh, V., Pawlowski, P.M., Dill, D.L., Engler, D.R.: Exe: automatically generating inputs of death. In: CCS, pp. 322-335. ACM Press, New York (2006
4. Christensen, A.S.,Møller, A., Schwartzbach, M.I.: Precise analysis of string expressions. In: Cousot, R. (ed.) SAS 2003. LNCS, vol. 2694, pp. 1-18. Springer, Heidelberg (2003
5. Dong, Y., Quan, Q., Zhang, J.: Priority-based energy aware and coverage preserving routing for wireless sensor network. In: VTC Spring, pp. 138-142. IEEE, Los Alamitos (2008
6. Fu, X., Lu, X., Peltsverger, B., Chen, S., Qian, K., Tao, L.: A Static Analysis Framework For Detecting SQL Injection Vulnerabilities. In: COMPSAC, pp. 87-96 (2007
7. Godefroid, P.: Compositional dynamic test generation. In: Proc. of POPL 2007, pp. 47-54. ACM Press, New York (2007
8. Godefroid, P., Klarlund, N., Sen, K.: DART: directed automated random testing. SIGPLAN Notices 40(6), 213-223 (2005
9. Habermehl, P., Iosif, R., Vojnar, T.: What else is decidable about integer arrays? In: Amadio, R. (ed.) FOSSACS 2008. LNCS, vol. 4962, pp. 474-489. Springer, Heidelberg (2008
10. Khoussainov, B., Nies, A., Rubin, S., Stephan, F.: Automatic structures: Richness and limitations. In: LICS, pp. 44-53 (2004
11. King, J.C.: Symbolic execution and program testing. Commun. ACM 19(7), 385-394 (1976
12. Matiyasevich, Y.: Word Equations, Fibonacci Numbers, and Hilbert's Tenth problem. In: Workshop on Fibonacci Words, vol. 43, pp. 36-39 (2007
13. Ruan, H., Zhang, J., Yan, J.: Test Data Generation for C Programs with String-Handling Functions. Theoretical Aspects of Software Engineering 0, 219-226 (2008
14. Sen, K., Agha, G.A.: CUTE and jCUTE: Concolic unit testing and explicit path modelchecking tools. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 419-423. Springer, Heidelberg (2006
15. Shannon, D., Hajra, S., Lee, A., Zhan, D., Khurshid, S.: Abstracting symbolic execution with string analysis. In: Taicpart-Mutation, Washington, DC, USA, pp. 13-22 (2007
16. Tillmann, N., de Halleux, J.: Pex - white box test generation for .NET. In: Beckert, B., Hähnle, R. (eds.) TAP 2008. LNCS, vol. 4966, pp. 134-153. Springer, Heidelberg (2008
17. Xie, T., Tillmann, N., de Halleux, P., Schulte,W.: Fitness-guided path exploration in dynamic symbolic execution. Technical Report MSR-TR-2008-123, Microsoft (2008)