Relational string verification using multi-track automata

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

Volumn 6482 LNCS, Issue , 2011, Pages 290-299

  Yu, Fang ^a   Bultan, Tevfik ^b   Ibarra, Oscar H ^b  

^a NATIONAL CHENGCHI UNIVERSITY   (Taiwan)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SECURITY; DECIDABILITY/UNDECIDABILITY; REACHABILITY ANALYSIS; STRING ANALYSIS; STRING SYSTEMS; SYMBOLIC ANALYSIS; VERIFICATION PROBLEMS; VERIFICATION TECHNIQUES; WEB APPLICATION;

SECURITY OF DATA;

BENCHMARKING;

EID: 79951655479     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-18098-9_31     Document Type: Conference Paper

References (16)

1. Bartzis, C., Bultan, T.: Widening arithmetic automata. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 321-333. Springer, Heidelberg (2004)
2. Bjørner, N., Tillmann, N., Voronkov, A.: Path feasibility analysis for string-manipulating programs. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol. 5505, pp. 307- 321. Springer, Heidelberg (2009)
3. Bouajjani, A., Habermehl, P.,Vojnar, T.:Abstract regular model checking. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 372-386. Springer, Heidelberg (2004)
4. Bouajjani,A., Jonsson, B.,Nilsson,M.,Touili,T.:Regularmodel checking. In:Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 403-418. Springer, Heidelberg (2000)
5. BRICS. The MONA project, http://www.brics.dk/mona/
6. 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)
7. 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)
8. Gould, C., Su, Z., Devanbu, P.: Static checking of dynamically generated queries in database applications. In: ICSE, pp. 645-654 (2004)
9. Minamide, Y.: Static approximation of dynamically generated web pages. In: WWW 2005, pp. 432-441 (2005)
10. Open Web Application Security Project (OWASP). Top ten project (May 2007), http://www.owasp.org/
11. Shannon, D., Hajra, S., Lee, A., Zhan, D., Khurshid, S.: Abstracting symbolic execution with string analysis. In: TAICPART-MUTATION, DC, USA, pp. 13-22 (2007)
12. Wassermann, G., Su, Z.: Static detection of cross-site scripting vulnerabilities. In: ICSE, pp. 171-180 (2008)
13. Yu, F., Alkhalaf, M., Bultan, T.: Stranger: An automata-based string analysis tool for php. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 154-157. Springer, Heidelberg (2010)
14. Yu, F., Bultan, T., Cova, M., Ibarra, O.H.: Symbolic string verification: An automata-based approach. In: Havelund, K.,Majumdar, R. (eds.) SPIN 2008. LNCS, vol. 5156, pp. 306-324. Springer, Heidelberg (2008)
15. Yu, F., Bultan, T., Ibarra, O.H.: Symbolic string verification: Combining string analysis and size analysis. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol. 5505, pp. 322-336. Springer, Heidelberg (2009)
16. Yu, F., Bultan, T., Ibarra, O.H.: Verification of string manipulating programs using multitrack automata. Technical Report 2009-14, Computer Science Department, University of California, Santa Barbara (August 2009)