{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T16:41:04Z","timestamp":1781887264557,"version":"3.54.5"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030670665","type":"print"},{"value":"9783030670672","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-67067-2_13","type":"book-chapter","created":{"date-parts":[[2021,1,11]],"date-time":"2021-01-11T20:57:20Z","timestamp":1610398640000},"page":"267-290","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Twinning Automata and Regular Expressions for String Static Analysis"],"prefix":"10.1007","author":[{"given":"Luca","family":"Negrini","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vincenzo","family":"Arceri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pietro","family":"Ferrara","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Agostino","family":"Cortesi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,1,12]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","unstructured":"Abdulla, P.A., et al.: Efficient handling of string-number conversion. In: Donaldson, A.F., Torlak, E. (eds.) Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, PLDI 2020, London, UK, 15\u201320 June 2020, pp. 943\u2013957. ACM (2020). https:\/\/doi.org\/10.1145\/3385412.3386034","DOI":"10.1145\/3385412.3386034"},{"key":"13_CR2","doi-asserted-by":"publisher","unstructured":"Abdulla, et al.: String constraints for verification. In: Biere, A., Bloem, R. (eds.) Computer Aided Verification - 26th International Conference, CAV 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, 18\u201322 July 2014. Proceedings. Lecture Notes in Computer Science, vol. 8559, pp. 150\u2013166. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_10","DOI":"10.1007\/978-3-319-08867-9_10"},{"key":"13_CR3","doi-asserted-by":"publisher","unstructured":"Abdulla, P.A., Atig, M.F., Diep, B.P., Hol\u00edk, L., Janku, P.: Chain-free string constraints. In: Chen, Y., Cheng, C., Esparza, J. (eds.) Automated Technology for Verification and Analysis - 17th International Symposium, ATVA 2019, Taipei, Taiwan, 28\u201331 October 2019, Proceedings. Lecture Notes in Computer Science, vol. 11781, pp. 277\u2013293. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-31784-3_16","DOI":"10.1007\/978-3-030-31784-3_16"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Almashfi, N., Lu, L.: Precise string domain for analyzing javascript arrays and objects. In: 2020 3rd International Conference on Information and Computer Technologies (ICICT), pp. 17\u201323 (2020)","DOI":"10.1109\/ICICT50521.2020.00011"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"103368","DOI":"10.1016\/j.artint.2020.103368","volume":"289","author":"R Amadini","year":"2020","unstructured":"Amadini, R., Gange, G., Stuckey, P.J.: Dashed strings for string constraint solving. Artif. Intell. 289, 103368 (2020). https:\/\/doi.org\/10.1016\/j.artint.2020.103368","journal-title":"Artif. Intell."},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.entcs.2017.02.003","volume":"331","author":"V Arceri","year":"2017","unstructured":"Arceri, V., Maffeis, S.: Abstract domains for type juggling. Electron. Notes Theor. Comput. Sci. 331, 41\u201355 (2017). https:\/\/doi.org\/10.1016\/j.entcs.2017.02.003","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Arceri, V., Mastroeni, I.: A sound abstract interpreter for dynamic code. In: Hung, C., Cern\u00fd, T., Shin, D., Bechini, A. (eds.) SAC 2020: The 35th ACM\/SIGAPP Symposium on Applied Computing, online event, [Brno, Czech Republic], 30 March\u20133 April 2020. pp. 1979\u20131988. ACM (2020). https:\/\/doi.org\/10.1145\/3341105.3373964","DOI":"10.1145\/3341105.3373964"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"3525","DOI":"10.3390\/app10103525","volume":"10","author":"V Arceri","year":"2020","unstructured":"Arceri, V., Mastroeni, I., Xu, S.: Static analysis for Ecmascript string manipulation programs. Appl. Sci. 10, 3525 (2020). https:\/\/doi.org\/10.3390\/app10103525","journal-title":"Appl. Sci."},{"key":"13_CR9","doi-asserted-by":"publisher","unstructured":"Arceri, V., Olliaro, M., Cortesi, A., Mastroeni, I.: Completeness of abstract domains for string analysis of javascript programs. In: Hierons, R.M., Mosbah, M. (eds.) Theoretical Aspects of Computing - ICTAC 2019\u201316th International Colloquium, Hammamet, Tunisia, 31 October\u20134 November 2019, Proceedings. Lecture Notes in Computer Science, vol. 11884, pp. 255\u2013272. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-32505-3_15","DOI":"10.1007\/978-3-030-32505-3_15"},{"key":"13_CR10","doi-asserted-by":"publisher","unstructured":"Bartzis, C., Bultan, T.: Widening arithmetic automata. In: Alur, R., Peled, D.A. (eds.) Computer Aided Verification, 16th International Conference, CAV 2004, Boston, MA, USA, 13\u201317 July 2004, Proceedings. Lecture Notes in Computer Science, vol. 3114, pp. 321\u2013333. Springer (2004). https:\/\/doi.org\/10.1007\/978-3-540-27813-9_25","DOI":"10.1007\/978-3-540-27813-9_25"},{"key":"13_CR11","doi-asserted-by":"publisher","unstructured":"Chen, T., Hague, M., Lin, A.W., R\u00fcmmer, P., Wu, Z.: Decision procedures for path feasibility of string-manipulating programs with complex operations. Proc. ACM Program. Lang. 3(POPL), 49:1\u201349:30 (2019). https:\/\/doi.org\/10.1145\/3290362","DOI":"10.1145\/3290362"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Choi, T., Lee, O., Kim, H., Doh, K.: A practical string analyzer by the widening approach. In: Kobayashi, N. (ed.) Programming Languages and Systems, 4th Asian Symposium, APLAS 2006, Sydney, Australia, 8\u201310 November 2006, Proceedings. Lecture Notes in Computer Science, vol. 4279, pp. 374\u2013388. Springer (2006). https:\/\/doi.org\/10.1007\/11924661_23","DOI":"10.1007\/11924661_23"},{"key":"13_CR13","doi-asserted-by":"publisher","unstructured":"Christensen, A.S., M\u00f8ller, A., Schwartzbach, M.I.: Precise analysis of string expressions. In: Cousot, R. (ed.) Static Analysis, 10th International Symposium, SAS 2003, San Diego, CA, USA, 11\u201313 June 2003, Proceedings. Lecture Notes in Computer Science, vol. 2694, pp. 1\u201318. Springer (2003). https:\/\/doi.org\/10.1007\/3-540-44898-5_1","DOI":"10.1007\/3-540-44898-5_1"},{"key":"13_CR14","doi-asserted-by":"publisher","unstructured":"Cortesi, A., Olliaro, M.: M-string segmentation: A refined abstract domain for string analysis in C programs. In: Pang, J., Zhang, C., He, J., Weng, J. (eds.) 2018 International Symposium on Theoretical Aspects of Software Engineering, TASE 2018, Guangzhou, China, 29\u201331 August 2018, pp. 1\u20138. IEEE Computer Society (2018). https:\/\/doi.org\/10.1109\/TASE.2018.00009","DOI":"10.1109\/TASE.2018.00009"},{"issue":"1","key":"13_CR15","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.cl.2010.09.001","volume":"37","author":"A Cortesi","year":"2011","unstructured":"Cortesi, A., Zanioli, M.: Widening and narrowing operators for abstract interpretation. Comput. Lang. Syst. Struct. 37(1), 24\u201342 (2011). https:\/\/doi.org\/10.1016\/j.cl.2010.09.001","journal-title":"Comput. Lang. Syst. Struct."},{"issue":"2","key":"13_CR16","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1002\/spe.2218","volume":"45","author":"G Costantini","year":"2015","unstructured":"Costantini, G., Ferrara, P., Cortesi, A.: A suite of abstract domains for static analysis of string values. Softw. Pract. Exp. 45(2), 245\u2013287 (2015). https:\/\/doi.org\/10.1002\/spe.2218","journal-title":"Softw. Pract. Exp."},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Graham, R.M., Harrison, M.A., Sethi, R. (eds.) Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, Los Angeles, California, USA, January 1977, pp. 238\u2013252. ACM (1977). https:\/\/doi.org\/10.1145\/512950.512973","DOI":"10.1145\/512950.512973"},{"key":"13_CR18","doi-asserted-by":"publisher","unstructured":"Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: Aho, A.V., Zilles, S.N., Rosen, B.K. (eds.) Conference Record of the Sixth Annual ACM Symposium on Principles of Programming Languages, San Antonio, Texas, USA, January 1979, pp. 269\u2013282. ACM Press (1979). https:\/\/doi.org\/10.1145\/567752.567778","DOI":"10.1145\/567752.567778"},{"issue":"4","key":"13_CR19","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1093\/logcom\/2.4.511","volume":"2","author":"P Cousot","year":"1992","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation frameworks. J. Log. Comput. 2(4), 511\u2013547 (1992). https:\/\/doi.org\/10.1093\/logcom\/2.4.511","journal-title":"J. Log. Comput."},{"key":"13_CR20","doi-asserted-by":"publisher","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: Aho, A.V., Zilles, S.N., Szymanski, T.G. (eds.) Conference Record of the Fifth Annual ACM Symposium on Principles of Programming Languages, Tucson, Arizona, USA, January 1978, pp. 84\u201396. ACM Press (1978). https:\/\/doi.org\/10.1145\/512760.512770","DOI":"10.1145\/512760.512770"},{"key":"13_CR21","doi-asserted-by":"publisher","unstructured":"D\u2019Antoni, L., Veanes, M.: Minimization of symbolic automata. In: Jagannathan, S., Sewell, P. (eds.) The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2014, San Diego, CA, USA, 20\u201321 January 2014, pp. 541\u2013554. ACM (2014). https:\/\/doi.org\/10.1145\/2535838.2535849","DOI":"10.1145\/2535838.2535849"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Davis, M.D., Sigal, R., Weyuker, E.J.: Computability, Complexity, and Languages: Fund. of Theor. CS. Academic Press Professional, Inc. (1994)","DOI":"10.1016\/B978-0-08-050246-5.50020-9"},{"key":"13_CR23","unstructured":"D\u2019Silva, V.: Widening for Automata. MsC Thesis, Inst. Fur Inform. - UZH (2006)"},{"key":"13_CR24","doi-asserted-by":"publisher","unstructured":"Giacobazzi, R., Ranzato, F., Scozzari, F.: Making abstract interpretations complete. J. ACM 47(2), 361\u2013416 (2000). https:\/\/doi.org\/10.1145\/333979.333989","DOI":"10.1145\/333979.333989"},{"key":"13_CR25","doi-asserted-by":"publisher","unstructured":"Madsen, M., Andreasen, E.: String analysis for dynamic field access. In: Cohen, A. (ed.) Compiler Construction - 23rd International Conference, CC 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, 5\u201313 April, 2014. Proceedings. Lecture Notes in Computer Science, vol. 8409, pp. 197\u2013217. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-642-54807-9_12","DOI":"10.1007\/978-3-642-54807-9_12"},{"key":"13_CR26","doi-asserted-by":"publisher","unstructured":"Mastroeni, I., Nikolic, D.: Abstract program slicing: From theory towards an implementation. In: Dong, J.S., Zhu, H. (eds.) Formal Methods and Software Engineering - 12th International Conference on Formal Engineering Methods, ICFEM 2010, Shanghai, China, 17\u201319 November 2010. Proceedings. Lecture Notes in Computer Science, vol. 6447, pp. 452\u2013467. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-16901-4_30","DOI":"10.1007\/978-3-642-16901-4_30"},{"key":"13_CR27","doi-asserted-by":"publisher","unstructured":"Mastroeni, I., Zanardini, D.: Abstract program slicing: an abstract interpretation-based approach to program slicing. ACM Trans. Comput. Log. 18(1), 7:1\u20137:58 (2017). https:\/\/doi.org\/10.1145\/3029052","DOI":"10.1145\/3029052"},{"key":"13_CR28","doi-asserted-by":"publisher","unstructured":"Midtgaard, J., Nielson, F., Nielson, H.R.: A parametric abstract domain for lattice-valued regular expressions. In: Rival, X. (ed.) Static Analysis - 23rd International Symposium, SAS 2016, Edinburgh, UK, 8\u201310 September 2016, Proceedings. Lecture Notes in Computer Science, vol. 9837, pp. 338\u2013360. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-662-53413-7_17","DOI":"10.1007\/978-3-662-53413-7_17"},{"key":"13_CR29","doi-asserted-by":"publisher","unstructured":"Park, C., Im, H., Ryu, S.: Precise and scalable static analysis of jquery using a regular expression domain. In: Ierusalimschy, R. (ed.) Proceedings of the 12th Symposium on Dynamic Languages, DLS 2016, Amsterdam, The Netherlands, 1 November 2016, pp. 25\u201336. ACM (2016). https:\/\/doi.org\/10.1145\/2989225.2989228","DOI":"10.1145\/2989225.2989228"},{"key":"13_CR30","doi-asserted-by":"publisher","unstructured":"Preda, M.D., Giacobazzi, R., Lakhotia, A., Mastroeni, I.: Abstract symbolic automata: mixed syntactic\/semantic similarity analysis of executables. In: Rajamani, S.K., Walker, D. (eds.) Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2015, Mumbai, India, 15\u201317 January 2015, pp. 329\u2013341. ACM (2015). https:\/\/doi.org\/10.1145\/2676726.2676986","DOI":"10.1145\/2676726.2676986"},{"key":"13_CR31","doi-asserted-by":"publisher","unstructured":"Rival, X., Mauborgne, L.: The trace partitioning abstract domain. ACM Trans. Program. Lang. Syst. 29(5), 26-es, August 2007. https:\/\/doi.org\/10.1145\/1275497.1275501","DOI":"10.1145\/1275497.1275501"},{"key":"13_CR32","doi-asserted-by":"publisher","unstructured":"Veanes, M.: Applications of symbolic finite automata. In: Konstantinidis, S. (ed.) Implementation and Application of Automata - 18th International Conference, CIAA 2013, Halifax, NS, Canada, July 16\u201319, 2013. Proceedings. Lecture Notes in Computer Science, vol. 7982, pp. 16\u201323. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-39274-0_3","DOI":"10.1007\/978-3-642-39274-0_3"},{"key":"13_CR33","doi-asserted-by":"publisher","unstructured":"Wang, H., Chen, S., Yu, F., Jiang, J.R.: A symbolic model checking approach to the analysis of string and length constraints. In: Huchard, M., K\u00e4stner, C., Fraser, G. (eds.) Proceedings of the 33rd ACM\/IEEE International Conference on Automated Software Engineering, ASE 2018, Montpellier, France, 3\u20137 September 2018, pp. 623\u2013633. ACM (2018). https:\/\/doi.org\/10.1145\/3238147.3238189","DOI":"10.1145\/3238147.3238189"},{"issue":"1","key":"13_CR34","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/s10703-013-0189-1","volume":"44","author":"F Yu","year":"2013","unstructured":"Yu, F., Alkhalaf, M., Bultan, T., Ibarra, O.H.: Automata-based symbolic string analysis for vulnerability detection. Formal Meth. Syst. Des. 44(1), 44\u201370 (2013). https:\/\/doi.org\/10.1007\/s10703-013-0189-1","journal-title":"Formal Meth. Syst. Des."}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-67067-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T20:11:23Z","timestamp":1718050283000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-67067-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030670665","9783030670672"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67067-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"12 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"VMCAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Verification, Model Checking, and Abstract Interpretation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Copenhagen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 January 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 January 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"vmcai2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/popl21.sigplan.org\/home\/VMCAI-2021","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4,6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference took place virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}