{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:17:18Z","timestamp":1725664638080},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540633716"},{"type":"electronic","value":"9783540695257"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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":[[1997]]},"DOI":"10.1007\/3-540-63371-5_6","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:25:15Z","timestamp":1330298715000},"page":"45-59","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A formal framework for the analysis of recursive-parallel programs"],"prefix":"10.1007","author":[{"given":"O.","family":"Kushnarenko","sequence":"first","affiliation":[]},{"given":"Ph.","family":"Schnoebelen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"issue":"2","key":"6_CR1","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/0890-5401(92)90017-A","volume":"98","author":"J. R. Burch","year":"1992","unstructured":"J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang. Symbolic model checking: 1020 states and beyond. Information and Computation, 98(2):142\u2013170, June 1992.","journal-title":"Information and Computation"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"J. A. Bergstra and J. W. Klop. Process theory based on bisimulation semantics. In Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Noordwijkerhout, LNCS 354, pages 50\u2013122. Springer-Verlag, 1989.","DOI":"10.1007\/BFb0013021"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"J. C. M. Baeten and W. P. Weijland. Process Algebra, volume 18 of Cambridge Tracts in Theoretical Computer Science. Cambridge Univ. Press, 1990.","DOI":"10.1017\/CBO9780511624193"},{"key":"6_CR4","unstructured":"J. Esparza. More infinite results. In Proc. Int. Workshop Verification of Infinite State Systems, Pisa, pages 4\u201320, August 1996."},{"key":"6_CR5","volume-title":"S\u00e9mantique des programmes r\u00e9cursifs-parall\u00e8les et m\u00e9thodes pour leur analyse","author":"O. Kouchnarenko","year":"1997","unstructured":"O. Kouchnarenko. S\u00e9mantique des programmes r\u00e9cursifs-parall\u00e8les et m\u00e9thodes pour leur analyse. Th\u00e8se de Doctorat, Univ. Joseph Fourier-Grenoble I, France, February 1997."},{"key":"6_CR6","first-page":"210","volume":"95","author":"J. B. Kruskal","year":"1960","unstructured":"J. B. Kruskal. Well-quasi-ordering, the Tree Theorem, and Vazsonyi's conjecture. Trans. Amer. Math. Soc., 95:210\u2013225, 1960.","journal-title":"Trans. Amer. Math. Soc."},{"key":"6_CR7","unstructured":"O. Kouchnarenko and Ph. Schnoebelen. A model for recursive-parallel programs. In Proc. Int. Workshop Verification of Infinite State Systems, Pisa, pages 127\u2013138, August 1996."},{"key":"6_CR8","unstructured":"O. Kouchnarenko and Ph. Schnoebelen.Mod\u00e8les formels pour les programmes r\u00e9cursifs-parall\u00e8les. In Proc. RENPAR'8, Bordeaux, pages 85\u201388, May 1996."},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"F. Moller. Infinite results. In Proc. CONCUR'96, Pisa, Italy, LNCS 1119, pages 195\u2013216. Springer-Verlag, August 1996.","DOI":"10.1007\/3-540-61604-7_56"},{"key":"6_CR10","series-title":"Technical Report 7160","volume-title":"Multiprocessor computer system with dynamic parallelism","author":"Y. Mamatov","year":"1988","unstructured":"Y. Mamatov, V. Vasilchikov, S. Volchenkov, and V. Kurchidis. Multiprocessor computer system with dynamic parallelism. Technical Report 7160, VINITI, Moscow, Russia, September 1988."},{"key":"6_CR11","unstructured":"Ph. Schnoebelen. On the analysis of RP schemes. Unpublished notes, November 1996."},{"key":"6_CR12","volume-title":"Recursive-parallel programming and work in RPMSHELL","author":"V. Vasilchikov","year":"1994","unstructured":"V. Vasilchikov, V. Emielyn, V. Kurchidis, and Y. Mamatov. Recursive-parallel programming and work in RPMSHELL. IPVT RAN, Iaroslavl, Russia, 1994."},{"key":"6_CR13","unstructured":"D. J. Walker. Bisimulations and divergence. In Proc. 3rd IEEE Symp. Logic in Computer Science, Edinburgh, July 1988."}],"container-title":["Lecture Notes in Computer Science","Parallel Computing Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63371-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:09:39Z","timestamp":1558267779000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63371-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633716","9783540695257"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-63371-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"9 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}