{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T07:37:22Z","timestamp":1763105842636,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030945824"},{"type":"electronic","value":"9783030945831"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-030-94583-1_2","type":"book-chapter","created":{"date-parts":[[2022,1,13]],"date-time":"2022-01-13T22:02:34Z","timestamp":1642111354000},"page":"20-42","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Relational String Abstract Domains"],"prefix":"10.1007","author":[{"given":"Vincenzo","family":"Arceri","sequence":"first","affiliation":[]},{"given":"Martina","family":"Olliaro","sequence":"additional","affiliation":[]},{"given":"Agostino","family":"Cortesi","sequence":"additional","affiliation":[]},{"given":"Pietro","family":"Ferrara","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,14]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-030-31784-3_16","volume-title":"Automated Technology for Verification and Analysis","author":"PA Abdulla","year":"2019","unstructured":"Abdulla, P.A., Atig, M.F., Diep, B.P., Hol\u00edk, L., Jank\u016f, P.: Chain-free string constraints. In: Chen, Y.-F., Cheng, C.-H., Esparza, J. (eds.) ATVA 2019. LNCS, vol. 11781, pp. 277\u2013293. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31784-3_16"},{"issue":"4","key":"2_CR2","doi-asserted-by":"publisher","first-page":"297","DOI":"10.3233\/FI-2018-1650","volume":"158","author":"R Amadini","year":"2018","unstructured":"Amadini, R., et al.: Reference abstract domains and applications to string analysis. Fundam. Inform. 158(4), 297\u2013326 (2018). https:\/\/doi.org\/10.3233\/FI-2018-1650","journal-title":"Fundam. Inform."},{"key":"2_CR3","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":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-662-54577-5_3","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R Amadini","year":"2017","unstructured":"Amadini, R., et al.: Combining string abstract domains for JavaScript analysis: an evaluation. In: Legay, A., Margaria, T. (eds.) TACAS 2017. LNCS, vol. 10205, pp. 41\u201357. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54577-5_3"},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Arceri, V., Mastroeni, I.: An automata-based abstract semantics for string manipulation languages. In: Proceedings of VPT 2019. EPTCS, vol. 299, pp. 19\u201333 (2019). https:\/\/doi.org\/10.4204\/EPTCS.299.5","DOI":"10.4204\/EPTCS.299.5"},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"Arceri, V., Mastroeni, I.: Analyzing dynamic code: a sound abstract interpreter for evil eval. ACM Trans. Priv. Secur. 24(2), 10:1\u201310:38 (2021). https:\/\/doi.org\/10.1145\/3426470","DOI":"10.1145\/3426470"},{"key":"2_CR7","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":"2_CR8","doi-asserted-by":"publisher","unstructured":"Arceri, V., Olliaro, M., Cortesi, A., Mastroeni, I.: Completeness of string analysis for dynamic languages. Inform. Comput. 104791 (2021). https:\/\/doi.org\/10.1016\/j.ic.2021.104791","DOI":"10.1016\/j.ic.2021.104791"},{"issue":"1\u20132","key":"2_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.scico.2007.08.001","volume":"72","author":"R Bagnara","year":"2008","unstructured":"Bagnara, R., Hill, P.M., Zaffanella, E.: The Parma Polyhedra library: toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems. Sci. Comput. Program. 72(1\u20132), 3\u201321 (2008). https:\/\/doi.org\/10.1016\/j.scico.2007.08.001","journal-title":"Sci. Comput. Program."},{"key":"2_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68670-7","volume-title":"String Analysis for Software Verification and Security","author":"T Bultan","year":"2017","unstructured":"Bultan, T., Yu, F., Alkhalaf, M., Aydin, A.: String Analysis for Software Verification and Security. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-68670-7"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-030-30923-7_5","volume-title":"Model Checking Software","author":"A Cortesi","year":"2019","unstructured":"Cortesi, A., Lauko, H., Olliaro, M., Ro\u010dkai, P.: String abstraction for model checking of C programs. In: Biondi, F., Given-Wilson, T., Legay, A. (eds.) SPIN 2019. LNCS, vol. 11636, pp. 74\u201393. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30923-7_5"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-642-24559-6_34","volume-title":"Formal Methods and Software Engineering","author":"G Costantini","year":"2011","unstructured":"Costantini, G., Ferrara, P., Cortesi, A.: Static analysis of string values. In: Qin, S., Qiu, Z. (eds.) ICFEM 2011. LNCS, vol. 6991, pp. 505\u2013521. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24559-6_34"},{"issue":"2","key":"2_CR13","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":"2_CR14","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: Proceedings of POPL 1977, pp. 238\u2013252 (1977). https:\/\/doi.org\/10.1145\/512950.512973","DOI":"10.1145\/512950.512973"},{"key":"2_CR15","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"},{"key":"2_CR16","doi-asserted-by":"publisher","unstructured":"Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: Proceedings of POPL 1979, pp. 269\u2013282 (1979). https:\/\/doi.org\/10.1145\/567752.567778","DOI":"10.1145\/567752.567778"},{"issue":"2&3","key":"2_CR17","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0743-1066(92)90030-7","volume":"13","author":"P Cousot","year":"1992","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation and application to logic programs. J. Log. Program. 13(2 & 3), 103\u2013179 (1992). https:\/\/doi.org\/10.1016\/0743-1066(92)90030-7","journal-title":"J. Log. Program."},{"key":"2_CR18","doi-asserted-by":"publisher","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: Proceedings of POPL 1978, pp. 84\u201396 (1978). https:\/\/doi.org\/10.1145\/512760.512770","DOI":"10.1145\/512760.512770"},{"key":"2_CR19","doi-asserted-by":"publisher","unstructured":"Ferrara, P., Logozzo, F., F\u00e4hndrich, M.: Safer unsafe code for.net. In: Proceedings of OOPSLA 2008, pp. 329\u2013346. ACM (2008). https:\/\/doi.org\/10.1145\/1449764.1449791","DOI":"10.1145\/1449764.1449791"},{"key":"2_CR20","doi-asserted-by":"publisher","unstructured":"Ferrara, P., Negrini, L., Arceri, V., Cortesi, A.: Static analysis for dummies: experiencing LiSA. In: Do, L.N.Q., Urban, C. (eds.) SOAP@PLDI 2021: Proceedings of the 10th ACM SIGPLAN International Workshop on the State Of the Art in Program Analysis, Virtual Event, Canada, 22 June 2021, pp. 1\u20136. ACM (2021). https:\/\/doi.org\/10.1145\/3460946.3464316","DOI":"10.1145\/3460946.3464316"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-662-49122-5_4","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"G Gange","year":"2016","unstructured":"Gange, G., Navas, J.A., Schachte, P., S\u00f8ndergaard, H., Stuckey, P.J.: An abstract domain of uninterpreted functions. In: Jobstmann, B., Leino, K.R.M. (eds.) VMCAI 2016. LNCS, vol. 9583, pp. 85\u2013103. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49122-5_4"},{"key":"2_CR22","doi-asserted-by":"publisher","unstructured":"Gulwani, S., Tiwari, A.: Combining abstract interpreters. In: Proceedings of PLDI 2006, pp. 376\u2013386 (2006). https:\/\/doi.org\/10.1145\/1133981.1134026","DOI":"10.1145\/1133981.1134026"},{"key":"2_CR23","doi-asserted-by":"publisher","unstructured":"Illous, H., Lemerre, M., Rival, X.: A relational shape abstract domain. In: Proceedings of NFM 2017, pp. 212\u2013229 (2017). https:\/\/doi.org\/10.1007\/978-3-319-57288-8_15","DOI":"10.1007\/978-3-319-57288-8_15"},{"key":"2_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-642-03237-0_17","volume-title":"Static Analysis","author":"SH Jensen","year":"2009","unstructured":"Jensen, S.H., M\u00f8ller, A., Thiemann, P.: Type analysis for JavaScript. In: Palsberg, J., Su, Z. (eds.) SAS 2009. LNCS, vol. 5673, pp. 238\u2013255. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03237-0_17"},{"key":"2_CR25","doi-asserted-by":"publisher","unstructured":"Kashyap, V., et al.: JSAI: a static analysis platform for JavaScript. In: Proceedings of FSE-22, pp. 121\u2013132 (2014). https:\/\/doi.org\/10.1145\/2635868.2635904","DOI":"10.1145\/2635868.2635904"},{"key":"2_CR26","unstructured":"Lee, H., Won, S., Jin, J., Cho, J., Ryu, S.: SAFE: formal specification and implementation of a scalable analysis framework for ECMAScript. In: Proceedings of FOOL 2012 (2012)"},{"key":"2_CR27","unstructured":"Logozzo, F.: Towards a quantitative estimation of abstract interpretations. In: Workshop on Quantitative Analysis of Software. Microsoft, June 2009. https:\/\/www.microsoft.com\/en-us\/research\/publication\/towards-a-quantitative-estimation-of-abstract-interpretations\/"},{"issue":"9","key":"2_CR28","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1016\/j.scico.2009.04.004","volume":"75","author":"F Logozzo","year":"2010","unstructured":"Logozzo, F., F\u00e4hndrich, M.: Pentagons: a weakly relational abstract domain for the efficient validation of array accesses. Sci. Comput. Program. 75(9), 796\u2013807 (2010). https:\/\/doi.org\/10.1016\/j.scico.2009.04.004","journal-title":"Sci. Comput. Program."},{"key":"2_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-642-54807-9_12","volume-title":"Compiler Construction","author":"M Madsen","year":"2014","unstructured":"Madsen, M., Andreasen, E.: String analysis for dynamic field access. In: Cohen, A. (ed.) CC 2014. LNCS, vol. 8409, pp. 197\u2013217. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54807-9_12"},{"issue":"1","key":"2_CR30","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10990-006-8609-1","volume":"19","author":"A Min\u00e9","year":"2006","unstructured":"Min\u00e9, A.: The octagon abstract domain. High. Order Symb. Comput. 19(1), 31\u2013100 (2006). https:\/\/doi.org\/10.1007\/s10990-006-8609-1","journal-title":"High. Order Symb. Comput."},{"key":"2_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-030-67067-2_13","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"L Negrini","year":"2021","unstructured":"Negrini, L., Arceri, V., Ferrara, P., Cortesi, A.: Twinning automata and regular expressions for string static analysis. In: Henglein, F., Shoham, S., Vizel, Y. (eds.) VMCAI 2021. LNCS, vol. 12597, pp. 267\u2013290. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-67067-2_13"},{"key":"2_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03811-6","volume-title":"Principles of Program Analysis","author":"F Nielson","year":"1999","unstructured":"Nielson, F., Nielson, H.R., Hankin, C.: Principles of Program Analysis. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-662-03811-6"},{"key":"2_CR33","doi-asserted-by":"publisher","unstructured":"Park, C., Im, H., Ryu, S.: Precise and scalable static analysis of jQuery using a regular expression domain. In: Proceedings of DLS 2016, pp. 25\u201336 (2016). https:\/\/doi.org\/10.1145\/2989225.2989228","DOI":"10.1145\/2989225.2989228"},{"key":"2_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17548-0","volume-title":"Compiler Design - Analysis and Transformation","author":"H Seidl","year":"2012","unstructured":"Seidl, H., Wilhelm, R., Hack, S.: Compiler Design - Analysis and Transformation. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-17548-0"},{"key":"2_CR35","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: Proceedings of ASE 2018, pp. 623\u2013633. ACM (2018). https:\/\/doi.org\/10.1145\/3238147.3238189","DOI":"10.1145\/3238147.3238189"},{"key":"2_CR36","doi-asserted-by":"publisher","unstructured":"Wilhelm, R., Sagiv, S., Reps, T.W.: Shape analysis. In: Proceedings of CC 2000, pp. 1\u201317 (2000). https:\/\/doi.org\/10.1007\/3-540-46423-9_1","DOI":"10.1007\/3-540-46423-9_1"},{"issue":"1","key":"2_CR37","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 Methods Syst. Design 44(1), 44\u201370 (2013). https:\/\/doi.org\/10.1007\/s10703-013-0189-1","journal-title":"Formal Methods Syst. Design"},{"key":"2_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-642-22306-8_3","volume-title":"Model Checking Software","author":"F Yu","year":"2011","unstructured":"Yu, F., Bultan, T., Hardekopf, B.: String abstractions for string verification. In: Groce, A., Musuvathi, M. (eds.) SPIN 2011. LNCS, vol. 6823, pp. 20\u201337. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22306-8_3"}],"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-94583-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,14]],"date-time":"2022-01-14T00:04:37Z","timestamp":1642118677000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-94583-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030945824","9783030945831"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-94583-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"14 January 2022","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":"Philadelphia, PA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 January 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 January 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"vmcai2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/popl22.sigplan.org\/home\/VMCAI-2022","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":"63","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":"23","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":"0","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":"37% - 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","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":"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)"}}]}}