Precise Analysis of String Expressions Export

@incollection{citeulike:1864441, abstract = {We perform static analysis of Java programs to answer a simple question: which values may occur as results of string expressions? The answers are summarized for each expression by a regular language that is guaranteed to contain all possible values. We present several applications of this analysis, including statically checking the syntax of dynamically generated expressions, such as SQL queries. Our analysis constructs flow graphs from class files and generates a context-free grammar with a nonterminal for each string expression. The language of this grammar is then widened into a regular language through a variant of an algorithm previously used for speech recognition. The collection of resulting regular languages is compactly represented as a special kind of multi-level automaton from which individual answers may be extracted. If a program error is detected, examples of invalid strings are automatically produced. We present extensive benchmarks demonstrating that the analysis is effic ient and produces results of useful precision.}, author = {Christensen, Aske S. and M{\o}ller, Anders and Schwartzbach, Michael I.}, citeulike-article-id = {1864441}, citeulike-linkout-0 = {http://www.springerlink.com/content/u0hlt5rf8nr6rnvl}, journal = {Static Analysis: 10th International Symposium, SAS 2003, San Diego, CA, USA, June 11-13, 2003. Proceedings}, keywords = {parsing, staticanalysis}, pages = {1076}, posted-at = {2008-03-04 18:48:09}, priority = {2}, title = {Precise Analysis of String Expressions}, url = {http://www.springerlink.com/content/u0hlt5rf8nr6rnvl}, year = {2003} }

TY - CHAP ID - citeulike:1864441 L3 - citeulike-article-id:1864441 N2 - We perform static analysis of Java programs to answer a simple question: which values may occur as results of string expressions? The answers are summarized for each expression by a regular language that is guaranteed to contain all possible values. We present several applications of this analysis, including statically checking the syntax of dynamically generated expressions, such as SQL queries. Our analysis constructs flow graphs from class files and generates a context-free grammar with a nonterminal for each string expression. The language of this grammar is then widened into a regular language through a variant of an algorithm previously used for speech recognition. The collection of resulting regular languages is compactly represented as a special kind of multi-level automaton from which individual answers may be extracted. If a program error is detected, examples of invalid strings are automatically produced. We present extensive benchmarks demonstrating that the analysis is effic ient and produces results of useful precision. JF - Static Analysis: 10th International Symposium, SAS 2003, San Diego, CA, USA, June 11-13, 2003. Proceedings EP - 1076 TI - Precise Analysis of String Expressions SP - 1076 KW - parsing KW - staticanalysis AU - Christensen, Aske AU - Møller, Anders AU - Schwartzbach, Michael PY - 2003/// UR - http://www.springerlink.com/content/u0hlt5rf8nr6rnvl ER -