{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:42:58Z","timestamp":1725601378113},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540068594"},{"type":"electronic","value":"9783540378198"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1974]]},"DOI":"10.1007\/3-540-06859-7_137","type":"book-chapter","created":{"date-parts":[[2011,8,18]],"date-time":"2011-08-18T15:52:56Z","timestamp":1313682776000},"page":"234-252","source":"Crossref","is-referenced-by-count":0,"title":["Completude d'un systeme formel pour prouver l'equivalence de certains schemas recursifs monadiques"],"prefix":"10.1007","author":[{"given":"B.","family":"Courcelle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Vuillemin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,20]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"E. Ashcroft, Z. Manna, A. Pnueli \"Decidable Properties of Monadic Functional Schemes\" in Theory of Machines and Computations (Eds: Kohavi and Paz), New York 1971, 3\u201317.","DOI":"10.1016\/B978-0-12-417750-5.50005-1"},{"key":"19_CR2","unstructured":"J.W. de Bakker \"Recursive Procedures\", Mathematical Center Tract n o 24, Amsterdam 1971."},{"key":"19_CR3","unstructured":"J.W. de Bakker, D. Scott \"A Theory of Programs\", 1969, Unpublished."},{"key":"19_CR4","unstructured":"B. Courcelle \"Grammaires canoniques des Langages simples\", Revue de l'Association pour l'Informatique et la Recherche Op\u00e9rationnelle, 1974, no1."},{"key":"19_CR5","unstructured":"F.G. Cousineau, J.M. Rifflet \"Sch\u00e9mas de Programme: Probl\u00e8mes d'Equivalence et Complexit\u00e9\", Th\u00e8se de 3\u00e8me cycle, Paris 1974."},{"key":"19_CR6","unstructured":"P. Hitchcok, D. Park \"Induction Rules and Termination Proofs\" Automata, Languages and Programming pp 225\u2013252, 1973. (Colloque IRIA 1972)."},{"key":"19_CR7","unstructured":"J.E. Hopcroft, A.J. Korenjak \"Simple Deterministic Languages\", IEEE 7th Annual Symposium on Switching and Automata Theory pp 36\u201346."},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"D. Luckham, D. Park, M. Paterson \"On Formalized Computer Programs\" J.C.S.S. vol 4, pp 220\u2013249.","DOI":"10.1016\/S0022-0000(70)80022-8"}],"container-title":["Lecture Notes in Computer Science","Programming Symposium"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-06859-7_137.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:56:24Z","timestamp":1605642984000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-06859-7_137"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974]]},"ISBN":["9783540068594","9783540378198"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-06859-7_137","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1974]]}}}