{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T04:10:04Z","timestamp":1746072604809,"version":"3.40.4"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319035444"},{"type":"electronic","value":"9783319035451"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03545-1_13","type":"book-chapter","created":{"date-parts":[[2013,12,9]],"date-time":"2013-12-09T16:31:48Z","timestamp":1386606708000},"page":"194-210","source":"Crossref","is-referenced-by-count":2,"title":["Extracting Proofs from Tabled Proof Search"],"prefix":"10.1007","author":[{"given":"Dale","family":"Miller","sequence":"first","affiliation":[]},{"given":"Alwen","family":"Tiu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-3-540-73595-3_28","volume-title":"Automated Deduction \u2013 CADE-21","author":"D. Baelde","year":"2007","unstructured":"Baelde, D., Gacek, A., Miller, D., Nadathur, G., Tiu, A.: The Bedwyr system for model checking over syntactic expressions. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol.\u00a04603, pp. 391\u2013397. Springer, Heidelberg (2007)"},{"key":"13_CR2","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, pp. 457\u2013468. ACM (2013)","DOI":"10.1145\/2429069.2429124"},{"key":"13_CR3","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.\u00a07705, pp. 350\u2013367. Springer, Heidelberg (2012)"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Brotherston, J., Simpson, A.: Complete sequent calculi for induction and infinite descent. In: 22nd Symp. on Logic in Computer Science, pp. 51\u201362 (2007)","DOI":"10.1109\/LICS.2007.16"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Jaffar, J., Santosa, A.E., Voicu, R.: A CLP proof method for timed automata. In: RTSS, pp. 175\u2013186. IEEE Computer Society (2004)","DOI":"10.1109\/REAL.2004.5"},{"issue":"3","key":"13_CR6","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/S0304-3975(01)00168-2","volume":"294","author":"R. McDowell","year":"2003","unstructured":"McDowell, R., Miller, D., Palamidessi, C.: Encoding transition systems in sequent calculus. Theoretical Computer Science\u00a0294(3), 411\u2013437 (2003)","journal-title":"Theoretical Computer Science"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Miller, D., Nadathur, G.: Programming with Higher-Order Logic. Cambridge University Press (June 2012)","DOI":"10.1017\/CBO9781139021326"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-540-74915-8_35","volume-title":"Computer Science Logic","author":"D. Miller","year":"2007","unstructured":"Miller, D., Nigam, V.: Incorporating tables into proofs. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol.\u00a04646, pp. 466\u2013480. Springer, Heidelberg (2007)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Miller, D., Tiu, A.: Extracting proofs from tabled proof search: Extended version. Technical report, HAL-INRIA (2013), http:\/\/hal.inria.fr\/hal-00863561","DOI":"10.1007\/978-3-319-03545-1_13"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Pous, D., Sangiorgi, D.: Enhancements of the bisimulation proof method. In: Sangiorgi, D., Rutten, J. (eds.) Advanced Topics in Bisimulation and Coinduction, pp. 233\u2013289. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511792588.007"},{"issue":"5","key":"13_CR11","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1017\/S0960129598002527","volume":"8","author":"D. Sangiorgi","year":"1998","unstructured":"Sangiorgi, D.: On the bisimulation proof method. Mathematical Structures in Computer Science\u00a08(5), 447\u2013479 (1998)","journal-title":"Mathematical Structures in Computer Science"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/BFb0084781","volume-title":"CONCUR \u201992","author":"D. Sangiorgi","year":"1992","unstructured":"Sangiorgi, D., Milner, R.: The problem of \u201cweak bisimulation up to\u201d. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol.\u00a0630, pp. 32\u201346. Springer, Heidelberg (1992)"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/11799573_25","volume-title":"Logic Programming","author":"L. Simon","year":"2006","unstructured":"Simon, L., Mallya, A., Bansal, A., Gupta, G.: Coinductive logic programming. In: Etalle, S., Truszczy\u0144ski, M. (eds.) ICLP 2006. LNCS, vol.\u00a04079, pp. 330\u2013345. Springer, Heidelberg (2006)"},{"issue":"4","key":"13_CR14","first-page":"365","volume":"37","author":"C. Sprenger","year":"2003","unstructured":"Sprenger, C., Dam, M.: On global induction mechanisms in a \u03bc-calculus with explicit approximations. ITA\u00a037(4), 365\u2013391 (2003)","journal-title":"ITA"},{"key":"13_CR15","unstructured":"Tiu, A.: A Logical Framework for Reasoning about Logical Specifications. PhD thesis, Pennsylvania State University (May 2004)"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Tiu, A., Miller, D.: Proof search specifications of bisimulation and modal logics for the \u03c0-calculus. ACM Trans. on Computational Logic\u00a011(2) (2010)","DOI":"10.1145\/1656242.1656248"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Tiu, A., Momigliano, A.: Cut elimination for a logic with induction and co-induction. Journal of Applied Logic (2012)","DOI":"10.1016\/j.jal.2012.07.007"},{"issue":"1-2","key":"13_CR18","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1006\/inco.1999.2836","volume":"157","author":"I. Walukiewicz","year":"2000","unstructured":"Walukiewicz, I.: Completeness of Kozen\u2019s axiomatisation of the propositional \u03bc-calculus. Inf. Comput.\u00a0157(1-2), 142\u2013182 (2000)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Certified Programs and Proofs"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03545-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T03:45:07Z","timestamp":1746071107000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-03545-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319035444","9783319035451"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03545-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}