{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T04:15:06Z","timestamp":1768968906926,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540403258","type":"print"},{"value":"9783540448983","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44898-5_1","type":"book-chapter","created":{"date-parts":[[2007,11,10]],"date-time":"2007-11-10T22:21:25Z","timestamp":1194733285000},"page":"1-18","source":"Crossref","is-referenced-by-count":134,"title":["Precise Analysis of String Expressions"],"prefix":"10.1007","author":[{"given":"Aske Simon","family":"Christensen","sequence":"first","affiliation":[]},{"given":"Anders","family":"M\u00f8ller","sequence":"additional","affiliation":[]},{"given":"Michael I.","family":"Schwartzbach","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"key":"1_CR1","unstructured":"Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. Compilers \u2014 Principles, Techniques, and Tools. Addison-Wesley, November 1985."},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0167-6423(99)00007-6","volume":"35","author":"A. Aiken","year":"1999","unstructured":"Alex Aiken. Introduction to set constraint-based program analysis. Science of Computer Programming, 35:79\u2013111, 1999.","journal-title":"Science of Computer Programming"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Aske Simon Christensen, Anders M\u00f8ller, and Michael I. Schwartzbach. Static analysis for dynamic XML. Technical Report RS-02-24, BRICS, May 2002. Presented at Programming Language Technologies for XML, PLAN-X, October 2002.","DOI":"10.7146\/brics.v9i24.21740"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Aske Simon Christensen, Anders M\u00f8ller, and Michael I. Schwartzbach. Extending Java for high-level Web service construction. ACM Transactions on Programming Languages and Systems, 2003. To appear.","DOI":"10.1145\/945885.945890"},{"key":"1_CR5","unstructured":"James Clark and Steve DeRose. XML path language, November 1999. W3C Recommendation. http:\/\/www.w3.org\/TR\/xpath."},{"key":"1_CR6","unstructured":"H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications, 1999. Available from http:\/\/www.grappa.univ-lille3.fr\/tata\/."},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Patrick Cousot and Radhia Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. 4th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL\u201977, pages 238\u2013252, 1977.","DOI":"10.1145\/512950.512973"},{"key":"1_CR8","series-title":"Lect Notes Comput Sci","volume-title":"Proc. 8th International Static Analysis Symposium, SAS\u2019 01","author":"N. Dor","year":"2001","unstructured":"Nurit Dor, Michael Rodeh, and Mooly Sagiv. Cleanness checking of string manipulations in C programs via integer analysis. In Proc. 8th International Static Analysis Symposium, SAS\u2019 01, volume 2126 of LNCS. Springer-Verlag, July 2001."},{"key":"1_CR9","unstructured":"John E. Hopcroft and Jeffrey D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, April 1979."},{"key":"1_CR10","series-title":"Lect Notes Comput Sci","volume-title":"Proc. 3rd International Workshop on the World Wide Web and Databases, WebDB\u201900","author":"H. Hosoya","year":"2000","unstructured":"Haruo Hosoya and Benjamin C. Pierce. XDuce: A typed XML processing language. In Proc. 3rd International Workshop on the World Wide Web and Databases, WebDB\u201900, volume 1997 of LNCS. Springer-Verlag, May 2000."},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Mehryar Mohri and Mark-Jan Nederhof. Robustness in Language and Speech Technology, chapter 9: Regular Approximation of Context-Free Grammars through Transformation. Kluwer Academic Publishers, 2001.","DOI":"10.1007\/978-94-015-9719-7_6"},{"key":"1_CR12","unstructured":"Anders M\u00f8ller. Document Structure Description 2.0, December 2002. BRICS, Department of Computer Science, University of Aarhus, Notes Series NS-02-7. Available from http:\/\/www.brics.dk\/DSD\/."},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Flemming Nielson, Hanne Riis Nielson, and Chris Hankin. Principles of Program Analysis. Springer-Verlag, October 1999.","DOI":"10.1007\/978-3-662-03811-6"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1023\/A:1010822518073","volume":"44","author":"R. Parekh","year":"2001","unstructured":"Rajesh Parekh and Vasant Honavar. DFA learning from simple examples. Machine Learning, 44:9\u201335, 2001.","journal-title":"Machine Learning"},{"issue":"11\u201312","key":"1_CR15","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/S0950-5849(98)00093-7","volume":"40","author":"T. Reps","year":"1998","unstructured":"Thomas Reps. Program analysis via graph reachability. Information and Software Technology, 40(11\u201312):701\u2013726, November\/December 1998.","journal-title":"Information and Software Technology"},{"key":"1_CR16","unstructured":"Umesh Shankar, Kunal Talwar, Jeffrey S. Foster, and David Wagner. Detecting format string vulnerabilities with type qualifiers. In Proc. 10th USENIX Security Symposium, 2001."},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Naoshi Tabuchi, Eijiro Sumii, and Akinori Yonezawa. Regular expression types for strings in a text processing language. In Proc. Workshop on Types in Programming, TIP\u2019 02, 2002.","DOI":"10.1016\/S1571-0661(04)80781-3"},{"key":"1_CR18","unstructured":"Raja Vallee-Rai, Laurie Hendren, Vijay Sundaresan, Patrick Lam, Etienne Gagnon, and Phong Co. Soot \u2014 A Java optimization framework. In Proc. IBM Centre for Advanced Studies Conference, CASCON\u201999. IBM, November 1999."}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44898-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T13:43:07Z","timestamp":1684071787000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44898-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540403258","9783540448983"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-44898-5_1","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}