{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:40:54Z","timestamp":1725496854320},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540665366"},{"type":"electronic","value":"9783540481683"}],"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-48168-0_34","type":"book-chapter","created":{"date-parts":[[2007,12,1]],"date-time":"2007-12-01T06:30:26Z","timestamp":1196490626000},"page":"484-498","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On Guarding Nested Fixpoints"],"prefix":"10.1007","author":[{"given":"Helmut","family":"Seidl","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Neumann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"H.R. Andersen, C. Stirling, and G. Winskel. A Compositional Proof System for the Modal Mu-Calculus. In IEEE Conf. on Logic in Computer Science (LICS), 144\u2013153, 1994.","DOI":"10.7146\/brics.v1i34.21609"},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0304-3975(80)90045-6","volume":"11","author":"A. Arnold","year":"1980","unstructured":"A. Arnold and M. Nivat. Metric Interpretations of Infinite Trees and Semantics of Non-Deterministic Recursive Programs. Theoretical Computer Science (TCS), 11:181\u2013205, 1980.","journal-title":"Theoretical Computer Science (TCS)"},{"key":"34_CR3","volume-title":"Technical Report","author":"H. Bekic","year":"1967","unstructured":"H. Bekic. Definable Operations in General Algebras, and the Theory of Automata and Flowcharts. Technical Report, IBM Labor, Wien, 1967."},{"key":"34_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/BFb0039704","volume-title":"Int. Conf. on Formal Methods in Programming and their Applications","author":"F. Bourdoncle","year":"1993","unstructured":"F. Bourdoncle. Efficient Chaotic Iteration Strategies with Widenings. In Int. Conf. on Formal Methods in Programming and their Applications, 128\u2013141. LNCS 735, 1993."},{"issue":"1&2","key":"34_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(95)00145-X","volume":"163","author":"B. Courcelle","year":"1996","unstructured":"B. Courcelle. Basic Notions of Universal Algebra for Language Theory and Graph Grammars. Theoretical Computer Science (TCS), 163(1&2):1\u201354, 1996.","journal-title":"Theoretical Computer Science (TCS)"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"C. Fecht and H. Seidl. A Faster Solver for General Systems of Equations. Science of Computer Programming (SCP), 1999. To appear.","DOI":"10.1016\/S0167-6423(99)00009-X"},{"issue":"3","key":"34_CR7","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/S0022-0000(77)80032-9","volume":"15","author":"A.C. Fong","year":"1977","unstructured":"A.C. Fong and J.D. Ullman. Finding the Depth of a Flow Graph. J. of Computer and System Sciences (JCSS), 15(3):300\u2013309, 1977.","journal-title":"J. of Computer and System Sciences (JCSS)"},{"key":"34_CR8","unstructured":"M.S. Hecht. Flow Analysis of Computer Programs. North Holland, 1977."},{"key":"34_CR9","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-1-4471-3078-9_13","volume-title":"Int. Workshop on Structures in ConcurrencyThe ory(STRICT)","author":"R. Kaivola","year":"1995","unstructured":"R. Kaivola. A Simple Decision Method for the Linear Time Mu-Calculus. In Int. Workshop on Structures in ConcurrencyThe ory(STRICT) (ed. J. Desel), 190\u2013204. Springer-Verlag, Berlin, 1995."},{"key":"34_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/3-540-61440-0_138","volume-title":"23rd Int. Coll. on Automata, Languages and Programming (ICALP)","author":"R. Kaivola","year":"1996","unstructured":"R. Kaivola. Fixpoints for Rabin Tree Automata Make Complementation Easy. In 23rd Int. Coll. on Automata, Languages and Programming (ICALP), 312\u2013323. LNCS 1099, 1996."},{"key":"34_CR11","unstructured":"R. Kaivola. Using Automata to Characterise Fixpoint Temporal Logics. PhD thesis, Dept. of Computer Science, Univ. of Edinburgh, 1996."},{"issue":"1","key":"34_CR12","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/321921.321938","volume":"23","author":"J.B. Kam","year":"1976","unstructured":"J.B. Kam and J.D. Ullman. Global Data Flow Analysis and Iterative Algorithms. J. of the Association for Computing Machinary(JA CM), 23(1):158\u2013171, 1976.","journal-title":"J. of the Association for Computing Machinary(JA CM)"},{"key":"34_CR13","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"D. Kozen. Results on the Propositional \u03bc-Calculus. Theoretical Computer Science (TCS), 27:333\u2013354, 1983.","journal-title":"Theoretical Computer Science (TCS)"},{"key":"34_CR14","unstructured":"A. Mader. Verification of Modal Properties Using Boolean Equation Systems. PhD thesis, TU M\u00fcnchen, 1997."},{"key":"34_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-540-49382-2_12","volume-title":"18th Int. Conf. on Foundations of Software Technologyand Theoretical Computer Science (FST&TCS)","author":"A. Neumann","year":"1998","unstructured":"A. Neumann and H. Seidl. Locating Matches of Tree Patterns in Forests. Technical Report 98-08, University of Trier, 1998. Short version in 18th Int. Conf. on Foundations of Software Technologyand Theoretical Computer Science (FST&TCS), LNCS 1530, 134\u2013145, 1998."},{"key":"34_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00039-X","volume":"189","author":"D. Niwinski","year":"1997","unstructured":"D. Niwinski. Fixed Point Characterization of Infinite Behavior of Finite State Systems. Theoretical Computer Science (TCS), 189:1\u201369, 1997.","journal-title":"Theoretical Computer Science (TCS)"},{"issue":"1&2","key":"34_CR17","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0304-3975(95)00136-0","volume":"163","author":"D. Niwinski","year":"1996","unstructured":"D. Niwinski and I. Walukiewicz. Games for the \u03bc-Calculus. Theoretical Computer Science (TCS), 163(1&2):99\u2013116, 1996.","journal-title":"Theoretical Computer Science (TCS)"},{"key":"34_CR18","unstructured":"H. Seidland D. Niwinski. On Distributive Fixpoint Expressions. TechnicalRep ort TR 98-04 (253), University of Warsaw, 1998. To appear in RAIRO."},{"issue":"3","key":"34_CR19","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1137\/0202017","volume":"2","author":"R.E. Tarjan","year":"1974","unstructured":"R.E. Tarjan. Finding Dominators in Directed Graphs. SIAM J. of Computing, 2(3):211\u2013216, 1974.","journal-title":"SIAM J. of Computing"},{"key":"34_CR20","unstructured":"I. Walukiewicz. Notes on the Propositional \u03bc-Calculus: Completeness and Related Results. Technical Report NS-95-1, BRICS Notes Series, 1995."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48168-0_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T00:09:42Z","timestamp":1586131782000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48168-0_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540665366","9783540481683"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-48168-0_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":"13 May 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}