{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:22:32Z","timestamp":1725492152963},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662020"},{"type":"electronic","value":"9783540486831"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":[[1999]]},"DOI":"10.1007\/3-540-48683-6_34","type":"book-chapter","created":{"date-parts":[[2007,10,7]],"date-time":"2007-10-07T03:22:18Z","timestamp":1191727338000},"page":"394-405","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Efficient Analysis of Cyclic Definitions"],"prefix":"10.1007","author":[{"given":"Kedar S.","family":"Namjoshi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert P.","family":"Kurshan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,1,14]]},"reference":[{"key":"34_CR1","series-title":"Lect Notes Comput Sci","volume-title":"Technical report, IBM, 1969. Reprinted in Programming Languages and Their Definition","author":"H. Beki\u010d","year":"1984","unstructured":"H. Beki\u010d. Definable operations in general algebras, and the theory of automata and flowcharts. Technical report, IBM, 1969. Reprinted in Programming Languages and Their Definition, LNCS 177, 1984. 399"},{"key":"34_CR2","unstructured":"G. Berry. The Constructive Semantics of Esterel. Draft book, available at ftp:\/\/ftpsop.inria.fr\/meije\/esterel\/papers\/constructiveness.ps.gz , 1995. 395, 395, 397, 397, 399, 403, 403"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"R. Bryant. Graph based algorithms for boolean function manipulation. IEEE Transactions on Computers, 1986. 395","DOI":"10.1109\/TC.1986.1676819"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"J. A. Brzozowski and C-J. H. Seger. Asynchronous Circuits. Springer-Verlag, 1994. 395, 398","DOI":"10.1007\/978-1-4612-4210-9"},{"key":"34_CR5","unstructured":"P. Cousot. Asynchronous iterative methods for solving a fixed point system of monotone equations in a complete lattice (rapport de recherche r.r. 88). Technical report, Laboratoire IMAG, Universite\u2019 scientifique et me\u2019dicale de Grenoble, 1978. 399"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"E. W. Dijkstra and C. S. Scholten. Predicate Calculus and Program Semantics. Springer-Verlag, 1990. 395","DOI":"10.1007\/978-1-4612-3228-5"},{"key":"34_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/3-540-61474-5_94","volume-title":"Proc. CAV\u201996","author":"R. H. Hardin","year":"1996","unstructured":"R. H. Hardin, Z. Har\u2019El, and R. P. Kurshan. COSPAN. In Proc. CAV\u201996, volume 1102, pages 423\u2013427. LNCS, 1996. 395, 401"},{"key":"34_CR8","unstructured":"J. Katzenelson and R. P. Kurshan. S\/R: A language for specifying protocols and other coordinating processes. In Proc. IEEE Conf. Comput. Comm., pages 286\u2013292, 1986. 401, 402"},{"key":"34_CR9","unstructured":"S. Malik. Analysis of cyclic combinational circuits. IEEE Transactions on Computer-Aided Design, 1994. 394, 397, 398, 398, 399, 399, 403, 403"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"D. S. Scott. A type-theoretical alternative to CUCH, ISWIM, OWHY. Unpublished notes, Oxford, 1969. Published in Theoretical Computer Science, 1993. 398","DOI":"10.1016\/0304-3975(93)90095-B"},{"key":"34_CR11","volume-title":"Formal Analysis of Synchronous Circuits","author":"T. Shiple","year":"1996","unstructured":"T. Shiple. Formal Analysis of Synchronous Circuits. PhD thesis, Univerisity of California, Berkeley, 1996. 395, 395, 398, 399, 402, 403, 403, 403, 403"},{"key":"34_CR12","unstructured":"T. Shiple, G. Berry, and H. Touati. Constructive analysis of cyclic circuits. In European Design and Test Conference, 1996. 395, 398, 399, 403, 403"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"L. Stok. False loops through resource sharing. In International Conference on Computer-Aided Design, 1992. 394","DOI":"10.1109\/ICCAD.1992.279349"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48683-6_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,25]],"date-time":"2021-08-25T08:32:49Z","timestamp":1629880369000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48683-6_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662020","9783540486831"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-48683-6_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"14 January 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}