Title :
Abstracting Symbolic Execution with String Analysis
Author :
Shannon, Daryl ; Hajra, Sukant ; Lee, Alison ; Zhan, Daiqian ; Khurshid, Sarfraz
Author_Institution :
Univ. of Texas at Austin, Austin
Abstract :
Forward symbolic execution is a technique for program analysis that explores the execution paths of a program by maintaining a symbolic representation of the program state. Traditionally, applications of this technique have focused on symbolically representing only primitive data types, while more recent extensions have expanded to reference types. We demonstrate the ability to symbolically execute a commonly used library class, specifically a string, at an abstract level. By abstracting away the implementation details of strings using finite-state automata, symbolic execution can scale to more complex programs. This technique can be applied to programs which generate complicated strings, such as SQL database queries.
Keywords :
computational linguistics; finite state machines; program diagnostics; finite-state automata; forward symbolic execution; library class; program analysis; program state; string analysis; symbolic representation; Automata; Binary search trees; Databases; Input variables; Java; Libraries; Prototypes; Scalability; Testing; Tree data structures;
Conference_Titel :
Testing: Academic and Industrial Conference Practice and Research Techniques - MUTATION, 2007. TAICPART-MUTATION 2007
Conference_Location :
Windsor
Print_ISBN :
978-0-7695-2984-4
DOI :
10.1109/TAIC.PART.2007.34