{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:08:35Z","timestamp":1742998115888,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031308284"},{"type":"electronic","value":"9783031308291"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,4,21]],"date-time":"2023-04-21T00:00:00Z","timestamp":1682035200000},"content-version":"vor","delay-in-days":110,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Noetherian spaces are a generalisation of well-quasi-orderings to topologies, that can be used to prove termination of programs. They find applications in the verification of transition systems, some of which are better described using topology. The goal of this paper is to allow the systematic description of computations using inductively defined datatypes via Noetherian spaces. This is achieved through a fixed point theorem based on a topological minimal bad sequence argument.<\/jats:p>","DOI":"10.1007\/978-3-031-30829-1_22","type":"book-chapter","created":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T19:56:19Z","timestamp":1682020579000},"page":"456-476","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fixed Points and Noetherian Topologies"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4205-327X","authenticated-orcid":false,"given":"Aliaume","family":"Lopez","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,21]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","unstructured":"Abdulla, P.A., \u010cer\u0101ns, K., Jonsson, B., Tsay, Y.K.: General decidability theorems for infinite-state systems. Proceedings of LICS\u201996. pp. 313\u2013321. IEEE (1996). https:\/\/doi.org\/10.1109\/LICS.1996.561359","DOI":"10.1109\/LICS.1996.561359"},{"key":"22_CR2","doi-asserted-by":"publisher","unstructured":"Abdulla, P.A., Jonsson, B.: Verifying networks of timed processes. Proceedings of TACAS\u201998. Lecture Notes in Computer Science, vol. 1384, pp. 298\u2013312. Springer (1998). https:\/\/doi.org\/10.1007\/BFb0054179","DOI":"10.1007\/BFb0054179"},{"key":"22_CR3","doi-asserted-by":"publisher","unstructured":"Daligault, J., Rao, M., Thomass\u00e9, S.: Well-Quasi-Order of Relabel Functions. Order 27(3), 301\u2013315 (2010). https:\/\/doi.org\/10.1007\/s11083-010-9174-0","DOI":"10.1007\/s11083-010-9174-0"},{"key":"22_CR4","doi-asserted-by":"publisher","unstructured":"Dershowitz, N., Tzameret, I.: Gap Embedding for Well-Quasi-Orderings. Proceedings of WoLLIC\u201903. Electronic Notes in Theoretical Computer Science, vol. 84, pp. 80\u201390. Elsevier (2003). https:\/\/doi.org\/10.1016\/S1571-0661(04)80846-6","DOI":"10.1016\/S1571-0661(04)80846-6"},{"key":"22_CR5","doi-asserted-by":"publisher","unstructured":"Figueira, D., Figueira, S., Schmitz, S., Schnoebelen, P.: Ackermannian and Primitive-Recursive Bounds with Dickson\u2019s Lemma. Proceedings of LICS\u201911. pp. 269\u2013278. IEEE (2011). https:\/\/doi.org\/10.1109\/LICS.2011.39","DOI":"10.1109\/LICS.2011.39"},{"key":"22_CR6","doi-asserted-by":"publisher","unstructured":"Finkel, A., Goubault-Larrecq, J.: Forward analysis for WSTS, part I: completions. Mathematical Structures in Computer Science 30(7), 752\u2013832 (2020). https:\/\/doi.org\/10.1017\/S0960129520000195","DOI":"10.1017\/S0960129520000195"},{"key":"22_CR7","doi-asserted-by":"publisher","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theoretical Computer Science 256(1), 63\u201392 (2001). https:\/\/doi.org\/10.1016\/S0304-3975(00)00102-X","DOI":"10.1016\/S0304-3975(00)00102-X"},{"key":"22_CR8","doi-asserted-by":"publisher","unstructured":"Freund, A.: From Kruskal\u2019s Theorem to Friedman\u2019s gap condition. Mathematical Structures in Computer Science 30(8), 952\u2013975 (2020). https:\/\/doi.org\/10.1017\/S0960129520000298","DOI":"10.1017\/S0960129520000298"},{"key":"22_CR9","doi-asserted-by":"publisher","unstructured":"Gallier, J.H.: Ann. Pure Appl. Logic: Erratum to \u201cWhat\u2019s so special about Kruskal\u2019s Theorem and the ordinal $${\\gamma }_{0}$$? A survey of some results in proof theory\u201d [53 (1991) 199\u2013260]. Annals of Pure and Applied Logic 89(2), 275 (1997). https:\/\/doi.org\/10.1016\/S0168-0072(97)00043-2","DOI":"10.1016\/S0168-0072(97)00043-2"},{"key":"22_CR10","doi-asserted-by":"publisher","unstructured":"Goubault-Larrecq, J.: On Noetherian spaces. Proceedings of LICS\u201907. pp. 453\u2013462. IEEE (2007). https:\/\/doi.org\/10.1109\/LICS.2007.34","DOI":"10.1109\/LICS.2007.34"},{"key":"22_CR11","doi-asserted-by":"publisher","unstructured":"Goubault-Larrecq, J.: Noetherian Spaces in Verification. Proceedings of ICALP\u201910. Lecture Notes in Computer Science, vol. 6199, pp. 2\u201321. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-14162-1_2","DOI":"10.1007\/978-3-642-14162-1_2"},{"key":"22_CR12","doi-asserted-by":"publisher","unstructured":"Goubault-Larrecq, J.: Non-Hausdorff Topology and Domain Theory, New Mathematical Monographs, vol. 22. Cambridge University Press (2013). https:\/\/doi.org\/10.1017\/CBO9781139524438","DOI":"10.1017\/CBO9781139524438"},{"key":"22_CR13","doi-asserted-by":"publisher","unstructured":"Goubault-Larrecq, J.: Infinitary Noetherian Constructions I. Infinite Words. Colloquium Mathematicum (168), 257\u2013286 (2022). https:\/\/doi.org\/10.4064\/cm8077-4-2021","DOI":"10.4064\/cm8077-4-2021"},{"key":"22_CR14","unstructured":"Goubault-Larrecq, J.: Non-Hausdorff Topology and Domain Theory. Electronic supplements to the book \u2013 errata. https:\/\/projects.lsv.ens-cachan.fr\/topology\/?page_id=12 (2022)"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Goubault-Larrecq, J., Halfon, S., Lopez, A.: Infinitary Noetherian Constructions II. Transfinite Words and the Regular Subword Topology (2022), https:\/\/doi.org\/10.48550\/arXiv.2202.05047","DOI":"10.4064\/cm8077-4-2021"},{"key":"22_CR16","doi-asserted-by":"publisher","unstructured":"Goubault-Larrecq, J., Seisenberger, M., Selivanov, V.L., Weiermann, A.: Well Quasi-Orders in Computer Science (Dagstuhl Seminar 16031). Dagstuhl Reports 6(1), 69\u201398 (2016). https:\/\/doi.org\/10.4230\/DagRep.6.1.69","DOI":"10.4230\/DagRep.6.1.69"},{"key":"22_CR17","doi-asserted-by":"publisher","unstructured":"Hasegawa, R.: Two applications of analytic functors. Theoretical Computer Science 272(1), 113\u2013175 (2002). https:\/\/doi.org\/10.1016\/S0304-3975(00)00349-2","DOI":"10.1016\/S0304-3975(00)00349-2"},{"key":"22_CR18","doi-asserted-by":"publisher","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. Proceedings of the London Mathematical Society 3(1), 326\u2013336 (1952). https:\/\/doi.org\/10.1112\/plms\/s3-2.1.326","DOI":"10.1112\/plms\/s3-2.1.326"},{"key":"22_CR19","doi-asserted-by":"publisher","unstructured":"Jan\u010dar, P.: A note on well quasi-orderings for powersets. Information Processing Letters 72(5), 155\u2013160 (Dec 1999). https:\/\/doi.org\/10.1016\/S0020-0190(99)00149-0","DOI":"10.1016\/S0020-0190(99)00149-0"},{"key":"22_CR20","doi-asserted-by":"publisher","unstructured":"Joyal, A.: Foncteurs analytiques et esp\u00e8ces de structures. Combinatoire \u00e9num\u00e9rative. Lecture Notes in Mathematics, vol. 1234, pp. 126\u2013159. Springer (1986). https:\/\/doi.org\/10.1007\/BFb0072514","DOI":"10.1007\/BFb0072514"},{"key":"22_CR21","doi-asserted-by":"publisher","unstructured":"K\u0159\u00ed\u017e, I., Thomas, R.: On well-quasi-ordering finite structures with labels. Graphs and Combinatorics 6(1), 41\u201349 (1990). https:\/\/doi.org\/10.1007\/BF01787479","DOI":"10.1007\/BF01787479"},{"key":"22_CR22","doi-asserted-by":"publisher","unstructured":"Kruskal, J.B.: The theory of well-quasi-ordering: A frequently discovered concept. Journal of Combinatorial Theory, Series A 13(3), 297\u2013305 (1972). https:\/\/doi.org\/10.1016\/0097-3165(72)90063-5","DOI":"10.1016\/0097-3165(72)90063-5"},{"key":"22_CR23","doi-asserted-by":"publisher","unstructured":"Milner, E.C.: Basic wqo-and bqo-theory. Graphs and order, pp. 487\u2013502. Springer (1985). https:\/\/doi.org\/10.1007\/978-94-009-5315-4_14","DOI":"10.1007\/978-94-009-5315-4_14"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Nash-Williams, C.St.J.A.: On well-quasi-ordering transfinite sequences. Mathematical Proceedings of the Cambridge Philosophical Society 61(1), 33\u201339 (1965)","DOI":"10.1017\/S0305004100038603"},{"key":"22_CR25","unstructured":"Pouzet, M.: Un bel ordre d\u2019abritement et ses rapports avec les bornes d\u2019une multirelation. CR Acad. Sci. Paris S\u00e9r. AB 274, A1677\u2013A1680 (1972)"},{"key":"22_CR26","doi-asserted-by":"publisher","unstructured":"Rado, R.: Partial well-ordering of sets of vectors. Mathematika 1(2), 89\u201395 (1954). https:\/\/doi.org\/10.1112\/S0025579300000565","DOI":"10.1112\/S0025579300000565"},{"key":"22_CR27","unstructured":"Schmitz, S.: Algorithmic Complexity of Well-Quasi-Orders. Habilitation \u00e0 diriger des recherches, \u00c9cole normale sup\u00e9rieure Paris-Saclay (2017), https:\/\/tel.archives-ouvertes.fr\/tel-01663266"},{"key":"22_CR28","unstructured":"Schmitz, S., Schnoebelen, P.: Algorithmic Aspects of WQO Theory (2012), https:\/\/cel.archives-ouvertes.fr\/cel-00727025"},{"key":"22_CR29","doi-asserted-by":"publisher","unstructured":"Segoufin, L., Figueira, D.: Bottom-up automata on data trees and vertical XPath. Logical Methods in Computer Science 13 (2017). https:\/\/doi.org\/10.23638\/LMCS-13(4:5)2017","DOI":"10.23638\/LMCS-13(4:5)2017"},{"key":"22_CR30","doi-asserted-by":"publisher","unstructured":"Singh, D., Shuaibu, A.M., Ndayawo: Simplified proof of Kruskal\u2019s Tree Theorem. Mathematical Theory and Modeling 3, 93\u2013100 (2013). https:\/\/doi.org\/10.13140\/RG.2.2.12298.39363","DOI":"10.13140\/RG.2.2.12298.39363"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30829-1_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T20:01:12Z","timestamp":1682020872000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30829-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031308284","9783031308291"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30829-1_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"21 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FoSSaCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Foundations of Software Science and Computation Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2023","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":"fossacs2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2023\/fossacs","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":"85","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":"26","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":"31% - 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":"10","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)"}}]}}