{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:59:31Z","timestamp":1740099571604,"version":"3.37.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030323035"},{"type":"electronic","value":"9783030323042"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-32304-2_8","type":"book-chapter","created":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T09:04:01Z","timestamp":1570266241000},"page":"140-161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Language Inclusion Algorithms as Complete Abstract Interpretations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3625-6003","authenticated-orcid":false,"given":"Pierre","family":"Ganty","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0159-0068","authenticated-orcid":false,"given":"Francesco","family":"Ranzato","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7531-6374","authenticated-orcid":false,"given":"Pedro","family":"Valero","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,2]]},"reference":[{"key":"8_CR1","unstructured":"Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science (LICS 1996), pp. 313\u2013321. IEEE Computer Society (1996)"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-12002-2_14","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"PA Abdulla","year":"2010","unstructured":"Abdulla, P.A., Chen, Y.-F., Hol\u00edk, L., Mayr, R., Vojnar, T.: When simulation meets antichains. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 158\u2013174. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12002-2_14"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Ganty, P., Giacobazzi, R., Pavlovic, D.: Sound up-to techniques and complete abstract domains. In: Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS 2018). ACM Press (2018)","DOI":"10.1145\/3209108.3209169"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Pous, D.: Checking NFA equivalence with bisimulations up to congruence. In: Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2013), pp. 457\u2013468. ACM Press (2013)","DOI":"10.1145\/2480359.2429124"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44914-0_1","volume-title":"Abstraction, Reformulation, and Approximation","author":"P Cousot","year":"2000","unstructured":"Cousot, P.: Partial completeness of abstract fixpoint checking. In: Choueiry, B.Y., Walsh, T. (eds.) SARA 2000. LNCS (LNAI), vol. 1864, pp. 1\u201325. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44914-0_1"},{"key":"8_CR6","doi-asserted-by":"crossref","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 the 4th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL 1977), pp. 238\u2013252. ACM Press (1977)","DOI":"10.1145\/512950.512973"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: Proceedings of the 6th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL 1979), pp. 269\u2013282. ACM, New York (1979)","DOI":"10.1145\/567752.567778"},{"issue":"6","key":"8_CR8","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/BF01213206","volume":"31","author":"A Luca de","year":"1994","unstructured":"de Luca, A., Varricchio, S.: Well quasi-orders and regular languages. Acta Informatica 31(6), 539\u2013557 (1994)","journal-title":"Acta Informatica"},{"key":"8_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59849-4","volume-title":"Finiteness and Regularity in Semigroups and Formal Languages","author":"A Luca de","year":"2011","unstructured":"de Luca, A., Varricchio, S.: Finiteness and Regularity in Semigroups and Formal Languages. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-59849-4"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/11817963_5","volume-title":"Computer Aided Verification","author":"M Wulf De","year":"2006","unstructured":"De Wulf, M., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Antichains: a new algorithm for checking universality of finite automata. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 17\u201330. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11817963_5"},{"issue":"3","key":"8_CR11","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(82)90124-4","volume":"27","author":"A Ehrenfeucht","year":"1983","unstructured":"Ehrenfeucht, A., Haussler, D., Rozenberg, G.: On regularity of context-free languages. Theor. Comput. Sci. 27(3), 311\u2013332 (1983)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"8_CR12","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s00236-018-0331-z","volume":"56","author":"T Fiedor","year":"2019","unstructured":"Fiedor, T., Hol\u00edk, L., Leng\u00e1l, O., Vojnar, T.: Nested antichains for WS1S. Acta Informatica 56(3), 205\u2013228 (2019)","journal-title":"Acta Informatica"},{"issue":"1\u20132","key":"8_CR13","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere!. Theor. Comput. Sci. 256(1\u20132), 63\u201392 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR14","unstructured":"Ganty, P., Ranzato, F., Valero, P.: Complete abstractions for checking language inclusion. arXiv e-prints, arXiv:1904.01388 , April 2019"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/3-540-47764-0_20","volume-title":"Static Analysis","author":"R Giacobazzi","year":"2001","unstructured":"Giacobazzi, R., Quintarelli, E.: Incompleteness, counterexamples, and refinements in abstract model-checking. In: Cousot, P. (ed.) SAS 2001. LNCS, vol. 2126, pp. 356\u2013373. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-47764-0_20"},{"issue":"2","key":"8_CR16","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1145\/333979.333989","volume":"47","author":"R Giacobazzi","year":"2000","unstructured":"Giacobazzi, R., Ranzato, F., Scozzari, F.: Making abstract interpretations complete. J. ACM 47(2), 361\u2013416 (2000)","journal-title":"J. ACM"},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.tcs.2017.05.009","volume":"735","author":"P Hofman","year":"2018","unstructured":"Hofman, P., Totzke, P.: Trace inclusion for one-counter nets revisited. Theor. Comput. Sci. 735, 50\u201363 (2018)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Hofmann, M., Chen, W.: Abstract interpretation from B\u00fcchi automata. In: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL 2014) and the Twenty-Ninth Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS 2014). ACM Press (2014)","DOI":"10.1145\/2603088.2603127"},{"key":"8_CR19","unstructured":"Janc\u0306ar, P., Esparza, J., Moller, F.: Petri nets and regular processes. J. Comput. Syst. Sci. 59(3), 476\u2013503 (1999)"},{"key":"8_CR20","first-page":"170","volume":"47","author":"D Kozen","year":"1992","unstructured":"Kozen, D.: On the Myhill-Nerode theorem for trees. Bull. EATCS 47, 170\u2013173 (1992)","journal-title":"Bull. EATCS"},{"issue":"1","key":"8_CR21","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.tcs.2004.03.052","volume":"324","author":"M Ogawa","year":"2004","unstructured":"Ogawa, M.: Well-quasi-orders and regular $$\\omega $$ -languages. Theor. Comput. Sci. 324(1), 55\u201360 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR22","first-page":"59","volume":"5","author":"D Park","year":"1969","unstructured":"Park, D.: Fixpoint induction and proofs of program properties. Mach. Intell. 5, 59\u201378 (1969)","journal-title":"Mach. Intell."},{"key":"8_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-642-35873-9_3","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"F Ranzato","year":"2013","unstructured":"Ranzato, F.: Complete abstractions everywhere. In: Giacobazzi, R., Berdine, J., Mastroeni, I. (eds.) VMCAI 2013. LNCS, vol. 7737, pp. 15\u201326. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-35873-9_3"},{"issue":"3","key":"8_CR24","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/S0019-9958(63)90306-1","volume":"6","author":"MP Sch\u00fctzenberger","year":"1963","unstructured":"Sch\u00fctzenberger, M.P.: On context-free languages and push-down automata. Inf. Control 6(3), 246\u2013264 (1963)","journal-title":"Inf. Control"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-32304-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,24]],"date-time":"2021-01-24T06:07:27Z","timestamp":1611468447000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-32304-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030323035","9783030323042"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-32304-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"2 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Static Analysis Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sas2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/staticanalysis.org\/sas2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"50","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":"20","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":"40% - 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.44","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.2","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)"}}]}}