{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:54:19Z","timestamp":1762458859208},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642182747"},{"type":"electronic","value":"9783642182754"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18275-4_18","type":"book-chapter","created":{"date-parts":[[2011,1,17]],"date-time":"2011-01-17T00:06:38Z","timestamp":1295222798000},"page":"248-262","source":"Crossref","is-referenced-by-count":31,"title":["An Evaluation of Automata Algorithms for String Analysis"],"prefix":"10.1007","author":[{"given":"Pieter","family":"Hooimeijer","sequence":"first","affiliation":[]},{"given":"Margus","family":"Veanes","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1007\/978-3-540-24749-4_52","volume-title":"STACS 2004","author":"S. Bala","year":"2004","unstructured":"Bala, S.: Regular language matching and other decidable cases of the satisfiability problem for constraints between regular open terms. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 596\u2013607. Springer, Heidelberg (2004)"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-642-00768-2_27","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"N. Bj\u00f8rner","year":"2009","unstructured":"Bj\u00f8rner, N., Tillmann, N., Voronkov, A.: Path feasibility analysis for string-manipulating programs. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol.\u00a05505, pp. 307\u2013321. Springer, Heidelberg (2009)"},{"issue":"3","key":"18_CR3","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/s10009-004-0185-2","volume":"7","author":"S. Blom","year":"2005","unstructured":"Blom, S., Orzan, S.: Distributed state space minimization. J. Software Tools for Technology Transfer\u00a07(3), 280\u2013291 (2005)","journal-title":"J. Software Tools for Technology Transfer"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45619-8_1","volume-title":"Logic Programming","author":"B. Boigelot","year":"2002","unstructured":"Boigelot, B., Wolper, P.: Representing arithmetic constraints with finite automata: An overview. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol.\u00a02401, pp. 1\u201319. Springer, Heidelberg (2002)"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44898-5_1","volume-title":"Static Analysis","author":"A.S. Christensen","year":"2003","unstructured":"Christensen, A.S., M\u00f8ller, A., Schwartzbach, M.I.: Precise Analysis of String Expressions. In: Cousot, R. (ed.) SAS 2003. LNCS, vol.\u00a02694, pp. 1\u201318. Springer, Heidelberg (2003)"},{"issue":"2\/3","key":"18_CR6","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0890-5401(88)90005-3","volume":"76","author":"T. Coquand","year":"1988","unstructured":"Coquand, T., Huet, G.P.: The calculus of constructions. Information and Computation\u00a076(2\/3), 95\u2013120 (1988)","journal-title":"Information and Computation"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L. Moura de","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.S.: Z3: An Efficient SMT Solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol.\u00a04963, pp. 337\u2013340. Springer, Heidelberg (2008)"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Godefroid, P., Kie\u017cun, A., Levin, M.Y.: Grammar-based whitebox fuzzing. In: PLDI 2008, Tucson, AZ, USA, June 9-11 (2008)","DOI":"10.1145\/1375581.1375607"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Godefroid, P., Klarlund, N., Sen, K.: DART: directed automated random testing. In: PLDI 2005, pp. 213\u2013223 (2005)","DOI":"10.1145\/1065010.1065036"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60630-0_5","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J.G. Henriksen","year":"1995","unstructured":"Henriksen, J.G., Jensen, J., J\u00f8rgensen, M., Klarlund, N., Paige, B., Rauhe, T., Sandholm, A.: Mona: Monadic second-order logic in practice. In: Brinksma, E., Steffen, B., Cleaveland, W.R., Larsen, K.G., Margaria, T. (eds.) TACAS 1995. LNCS, vol.\u00a01019. Springer, Heidelberg (1995)"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Hooimeijer, P., Weimer, W.: A decision procedure for subset constraints over regular languages. In: PLDI, pp. 188\u2013198 (2009)","DOI":"10.1145\/1542476.1542498"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Hooimeijer, P., Weimer, W.: Solving string constraints lazily. In: ASE 2010 (2010)","DOI":"10.1145\/1858996.1859080"},{"key":"18_CR13","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)"},{"issue":"1","key":"18_CR14","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/S0890-5401(03)00090-7","volume":"186","author":"L. Ilie","year":"2003","unstructured":"Ilie, L., Yu, S.: Follow automata. Information and Computation\u00a0186(1), 140\u2013162 (2003)","journal-title":"Information and Computation"},{"key":"18_CR15","first-page":"105","volume-title":"ISSTA 2009","author":"A. Kie\u017cun","year":"2009","unstructured":"Kie\u017cun, A., Ganesh, V., Guo, P.J., Hooimeijer, P., Ernst, M.D.: HAMPI: a solver for string constraints. In: ISSTA 2009, pp. 105\u2013116. ACM, New York (2009)"},{"issue":"4","key":"18_CR16","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1142\/S012905410200128X","volume":"13","author":"N. Klarlund","year":"2002","unstructured":"Klarlund, N., M\u00f8ller, A., Schwartzbach, M.I.: MONA implementation secrets. International Journal of Foundations of Computer Science\u00a013(4), 571\u2013586 (2002)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-540-73208-2_3","volume-title":"Developments in Language Theory","author":"M. Kunc","year":"2007","unstructured":"Kunc, M.: What do we know about language equations? In: Harju, T., Karhum\u00e4ki, J., Lepist\u00f6, A. (eds.) DLT 2007. LNCS, vol.\u00a04588, pp. 23\u201327. Springer, Heidelberg (2007)"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Li, N., Xie, T., Tillmann, N., de Halleux, P., Schulte, W.: Reggae: Automated test generation for programs using complex regular expressions. In: ASE 2009 (2009)","DOI":"10.1109\/ASE.2009.67"},{"key":"18_CR19","unstructured":"MSDN Library. System.text namespace, http:\/\/msdn.microsoft.com\/en-us\/library\/system.text.aspx"},{"key":"18_CR20","unstructured":"PHP Manual. Pcre; posix regex; strings, http:\/\/php.net\/manual\/en\/book.strings.php"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Minamide, Y.: Static approximation of dynamically generated web pages. In: WWW 2005, pp. 432\u2013441 (2005)","DOI":"10.1145\/1060745.1060809"},{"key":"18_CR22","doi-asserted-by":"crossref","first-page":"2001","DOI":"10.1023\/A:1012291501330","volume":"4","author":"G. Noord Van","year":"2001","unstructured":"Van Noord, G., Gerdemann, D.: Finite state transducers with predicates and identities. Grammars\u00a04 (2001)","journal-title":"Grammars"},{"key":"18_CR23","unstructured":"Pex, http:\/\/research.microsoft.com\/projects\/pex"},{"key":"18_CR24","volume-title":"SP 2010","author":"P. Saxena","year":"2010","unstructured":"Saxena, P., Akhawe, D., Hanna, S., Mao, F., McCamant, S., Song, D.: A symbolic execution framework for javascript. In: SP 2010. IEEE Computer Society, Los Alamitos (2010)"},{"key":"18_CR25","unstructured":"Siek, J.G., Lee, L.-Q., Lumsdaine, A.: The Boost Graph Library: User Guide and Reference Manual. Addison-Wesley Professional, Reading (2001)"},{"key":"18_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1007\/978-3-642-16242-8_45","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"M. Veanes","year":"2010","unstructured":"Veanes, M., Bj\u00f8rner, N., de Moura, L.: Symbolic automata constraint solving. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol.\u00a06397, pp. 640\u2013654. Springer, Heidelberg (2010)"},{"key":"18_CR27","volume-title":"ICST 2010","author":"M. Veanes","year":"2010","unstructured":"Veanes, M., de Halleux, P., Tillmann, N.: Rex: Symbolic Regular Expression Explorer. In: ICST 2010. IEEE, Los Alamitos (2010)"},{"key":"18_CR28","first-page":"32","volume-title":"PLDI 2007","author":"G. Wassermann","year":"2007","unstructured":"Wassermann, G., Su, Z.: Sound and precise analysis of web applications for injection vulnerabilities. In: PLDI 2007, pp. 32\u201341. ACM, New York (2007)"},{"key":"18_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-642-12002-2_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"F. Yu","year":"2010","unstructured":"Yu, F., Alkhalaf, M., Bultan, T.: An automata-based string analysis tool for PHP. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol.\u00a06015, pp. 154\u2013157. Springer, Heidelberg (2010)"},{"key":"18_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/978-3-642-00768-2_28","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"F. Yu","year":"2009","unstructured":"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.\u00a05505, pp. 322\u2013336. Springer, Heidelberg (2009)"},{"key":"18_CR31","unstructured":"Z3, http:\/\/research.microsoft.com\/projects\/z3"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18275-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T18:39:46Z","timestamp":1559932786000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18275-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642182747","9783642182754"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18275-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}