{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T05:28:22Z","timestamp":1769923702573,"version":"3.49.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030290252","type":"print"},{"value":"9783030290269","type":"electronic"}],"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-29026-9_18","type":"book-chapter","created":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T19:10:06Z","timestamp":1566414606000},"page":"317-334","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["PSPACE-Completeness of a Thread Criterion for Circular Proofs in Linear Logic with Least and Greatest Fixed Points"],"prefix":"10.1007","author":[{"given":"R\u00e9mi","family":"Nollet","sequence":"first","affiliation":[]},{"given":"Alexis","family":"Saurin","sequence":"additional","affiliation":[]},{"given":"Christine","family":"Tasson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,14]]},"reference":[{"key":"18_CR1","unstructured":"The cyclist theorem prover. \n                      http:\/\/www.cyclist-prover.org\/"},{"issue":"1","key":"18_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2071368.2071370","volume":"13","author":"David Baelde","year":"2012","unstructured":"Baelde, D.: Least and greatest fixed points in linear logic. ACM Trans. Comput. Log. 13(1), 2:1\u20132:44 (2012). \n                      https:\/\/doi.org\/10.1145\/2071368.2071370","journal-title":"ACM Transactions on Computational Logic"},{"key":"18_CR3","doi-asserted-by":"publisher","unstructured":"Baelde, D., Doumane, A., Saurin, A.: Infinitary proof theory: the multiplicative additive case. In: Talbot, J., Regnier, L. (eds.) 25th EACSL Annual Conference on Computer Science Logic, CSL 2016. LIPIcs, Marseille, France, August 29\u2013September 1 2016, vol. 62, pp. 42:1\u201342:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016). \n                      https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2016.42","DOI":"10.4230\/LIPIcs.CSL.2016.42"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-642-35182-2_25","volume-title":"Programming Languages and Systems","author":"J Brotherston","year":"2012","unstructured":"Brotherston, J., Gorogiannis, N., Petersen, R.L.: A generic cyclic theorem prover. In: Jhala, R., Igarashi, A. (eds.) APLAS 2012. LNCS, vol. 7705, pp. 350\u2013367. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-35182-2_25"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/11944836_26","volume-title":"FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science","author":"C Dax","year":"2006","unstructured":"Dax, C., Hofmann, M., Lange, M.: A proof system for the linear time \n                      \n                        \n                      \n                      $$\\mu $$\n                    -Calculus. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol. 4337, pp. 273\u2013284. Springer, Heidelberg (2006). \n                      https:\/\/doi.org\/10.1007\/11944836_26"},{"key":"18_CR6","unstructured":"Doumane, A.: On the infinitary proof theory of logics with fixed points. (Th\u00e9orie de la d\u00e9monstration infinitaire pour les logiques \u00e0 points fixes). Ph.D. thesis, Paris Diderot University, France (2017). \n                      https:\/\/tel.archives-ouvertes.fr\/tel-01676953"},{"key":"18_CR7","doi-asserted-by":"publisher","unstructured":"Hyvernat, P.: The size-change termination principle for constructor based languages. Log. Methods Comput. Sci. 10(1) (2014). \n                      https:\/\/doi.org\/10.2168\/LMCS-10(1:11)2014","DOI":"10.2168\/LMCS-10(1:11)2014"},{"key":"18_CR8","unstructured":"Hyvernat, P.: The size-change principle for mixed inductive and coinductive types. CoRR abs\/1901.07820 (2019). \n                      http:\/\/arxiv.org\/abs\/1901.07820"},{"key":"18_CR9","series-title":"Foundations of Computing Series","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/2003.001.0001","volume-title":"Computability and Complexity - from a Programming Perspective","author":"ND Jones","year":"1997","unstructured":"Jones, N.D.: Computability and Complexity - from a Programming Perspective. Foundations of Computing Series. MIT Press, Cambridge (1997)"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0025782","volume-title":"Logics of Programs","author":"D Kozen","year":"1982","unstructured":"Kozen, D.: On induction vs. *-continuity. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131, pp. 167\u2013176. Springer, Heidelberg (1982). \n                      https:\/\/doi.org\/10.1007\/BFb0025782"},{"issue":"3","key":"18_CR11","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"Dexter Kozen","year":"1983","unstructured":"Kozen, D.: Results on the propositional mu-calculus. Theor. Comput. Sci. 27, 333\u2013354 (1983). \n                      https:\/\/doi.org\/10.1016\/0304-3975(82)90125-6","journal-title":"Theoretical Computer Science"},{"key":"18_CR12","doi-asserted-by":"publisher","unstructured":"Lee, C.S., Jones, N.D., Ben-Amram, A.M.: The size-change principle for program termination. In: Hankin, C., Schmidt, D. (eds.) Conference Record of POPL 2001: The 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, London, UK, 17\u201319 January 2001, pp. 81\u201392. ACM (2001). \n                      https:\/\/doi.org\/10.1145\/360204.360210\n                      \n                    . \n                      http:\/\/doi.acm.org\/10.1145\/360204.360210","DOI":"10.1145\/360204.360210"},{"issue":"1","key":"18_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3285955","volume":"41","author":"Rodolphe Lepigre","year":"2019","unstructured":"Lepigre, R., Raffalli, C.: Practical subtyping for curry-style languages. ACM Trans. Program. Lang. Syst. 41(1), 5:1\u20135:58 (2019). \n                      https:\/\/doi.org\/10.1145\/3285955","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"18_CR14","doi-asserted-by":"publisher","unstructured":"Nollet, R., Saurin, A., Tasson, C.: Local validity for circular proofs in linear logic with fixed points. In: Ghica, D.R., Jung, A. (eds.) 27th EACSL Annual Conference on Computer Science Logic, CSL 2018. LIPIcs, Birmingham, UK, 4\u20137 September 2018, vol. 119, pp. 35:1\u201335:23. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018). \n                      https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2018.35","DOI":"10.4230\/LIPIcs.CSL.2018.35"},{"key":"18_CR15","doi-asserted-by":"publisher","unstructured":"Rowe, R.N.S., Brotherston, J.: Automatic cyclic termination proofs for recursive procedures in separation logic. In: Bertot, Y., Vafeiadis, V. (eds.) Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, CPP 2017, Paris, France, 16\u201317 January 2017, pp. 53\u201365. ACM (2017). \n                      https:\/\/doi.org\/10.1145\/3018610.3018623","DOI":"10.1145\/3018610.3018623"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/978-3-319-63046-5_30","volume-title":"Automated Deduction \u2013 CADE 26","author":"G Tellez","year":"2017","unstructured":"Tellez, G., Brotherston, J.: Automatically verifying temporal properties of pointer programs with cyclic proof. In: de Moura, L. (ed.) CADE 2017. LNCS (LNAI), vol. 10395, pp. 491\u2013508. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-63046-5_30"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning with Analytic Tableaux and Related Methods"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29026-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T19:16:02Z","timestamp":1566414962000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-29026-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030290252","9783030290269"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29026-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TABLEAUX","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Automated Reasoning with Analytic Tableaux and Related Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"3 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tableaux2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tableaux2019.org\/","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":"43","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":"25","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":"58% - 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.2","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":"3","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)"}}]}}