{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:46:33Z","timestamp":1764557193369,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540229407"},{"type":"electronic","value":"9783540286448"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28644-8_33","type":"book-chapter","created":{"date-parts":[[2010,2,25]],"date-time":"2010-02-25T19:48:13Z","timestamp":1267127293000},"page":"512-528","source":"Crossref","is-referenced-by-count":35,"title":["A Higher Order Modal Fixed Point Logic"],"prefix":"10.1007","author":[{"given":"Mahesh","family":"Viswanathan","sequence":"first","affiliation":[]},{"given":"Ramesh","family":"Viswanathan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1007\/3-540-49116-3_48","volume-title":"STACS 99","author":"M. M\u00fcller-Olm","year":"1999","unstructured":"M\u00fcller-Olm, M.: A modal fixpoint logic with chop. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 510\u2013520. Springer, Heidelberg (1999)"},{"key":"33_CR2","series-title":"NATO ASI Series","first-page":"123","volume-title":"Logics and Models of Concurrent Systems","author":"A. Pnueli.","year":"1984","unstructured":"Pnueli., A.: In transition from global to modular temporal reasoning about programs. In: Logics and Models of Concurrent Systems. NATO ASI Series, pp. 123\u2013144. Springer, Heidelberg (1984)"},{"key":"33_CR3","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1109\/TSE.1981.230844","volume":"7","author":"J. Misra","year":"1981","unstructured":"Misra, J., Chandy, K.M.: Proofs of network processes. IEEE Transactions on Software Engineering\u00a0SE-7, 417\u2013426 (1981)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/151646.151649","volume":"15","author":"M. Abadi","year":"1993","unstructured":"Abadi, M., Lamport, L.: Composing specifications. ACM Transactions on Programming Languages and Systems\u00a015, 73\u2013132 (1993)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"33_CR5","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1145\/203095.201069","volume":"17","author":"M. Abadi","year":"1995","unstructured":"Abadi, M., Lamport, L.: Conjoining specifications. ACM Transactions on Programming Languages and Systems\u00a017, 507\u2013534 (1995)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/3-540-48153-2_30","volume-title":"Correct Hardware Design and Verification Methods","author":"K.L. McMillan","year":"1999","unstructured":"McMillan, K.L.: Circular compositional reasoning about liveness. In: Pierre, L., Kropf, T. (eds.) CHARME 1999. LNCS, vol.\u00a01703, pp. 342\u2013346. Springer, Heidelberg (1999)"},{"key":"33_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/3-540-49519-3_27","volume-title":"Formal Methods in Computer-Aided Design","author":"T.A. Henzinger","year":"1998","unstructured":"Henzinger, T.A., Qadeer, S., Rajamani, S.K., Ta\u015f\u0131ran, S.: An assume-guarantee rule for checking simulation. In: Gopalakrishnan, G.C., Windley, P. (eds.) FMCAD 1998. LNCS, vol.\u00a01522, pp. 421\u2013431. Springer, Heidelberg (1998)"},{"key":"33_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of the International Colloquim on Automata, Languages and Programming","author":"M. Viswanathan","year":"2001","unstructured":"Viswanathan, M., Viswanathan, R.: Foundations of Circular Compositional Reasoning. In: Proceedings of the International Colloquim on Automata, Languages and Programming. LNCS. Springer, Heidelberg (2001)"},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"Kozen, D.: Results on the propositional \u03bc-calculus. Theoretical Computer Science\u00a027, 333\u2013354 (1983)","journal-title":"Theoretical Computer Science"},{"key":"33_CR10","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1093\/oso\/9780198537618.003.0005","volume-title":"Handbook of Logic in Computer Science","author":"C. Stirling","year":"1992","unstructured":"Stirling, C.: Modal and Temporal Logics. In: Handbook of Logic in Computer Science, vol.\u00a02, pp. 477\u2013563. Claredon Press, Oxford, UK (1992)"},{"key":"33_CR11","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/S0304-3975(00)00034-7","volume":"258","author":"E.A. Emerson","year":"2001","unstructured":"Emerson, E.A., Jutla, C.S., Sistla, A.P.: On model checking for the \u03bc-calculus and its fragments. Theoretical Computer Science\u00a0258, 491\u2013522 (2001)","journal-title":"Theoretical Computer Science"},{"key":"33_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-45931-6_18","volume-title":"Foundations of Software Science and Computation Structures","author":"M. Lange","year":"2002","unstructured":"Lange, M., Stirling, C.: Model checking fixed point logic with chop. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol.\u00a02303, pp. 250\u2013263. Springer, Heidelberg (2002)"},{"key":"33_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/3-540-45694-5_17","volume-title":"CONCUR 2002 - Concurrency Theory","author":"M. Lange","year":"2002","unstructured":"Lange, M.: Local model checking games for fixed point logic with chop. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 240\u2013254. Springer, Heidelberg (2002)"},{"key":"33_CR14","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)"},{"key":"33_CR15","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1016\/B978-044482830-9\/50027-8","volume-title":"Handbook of Process Algebra","author":"O. Burkart","year":"2001","unstructured":"Burkart, O., Caucal, D., Moller, F., Steffen, B.: Verification on Infinite Structures. In: Handbook of Process Algebra, pp. 545\u2013623. Elsevier Science Publishers, Amsterdam (2001)"},{"key":"33_CR16","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0304-3975(95)00064-X","volume":"15","author":"Y. Hirshfeld","year":"1996","unstructured":"Hirshfeld, Y., Jerrum, M., Moller, F.: A polynomial algorithm for deciding bisimilarity of normed context-free processes. Theoretical Computer Science\u00a015, 143\u2013159 (1996)","journal-title":"Theoretical Computer Science"},{"key":"33_CR17","doi-asserted-by":"crossref","unstructured":"S\u00e9nizergues, G.: Decidability of bisimulation equivalence for equations graphs of finite out-degree. In: Proceedings of the IEEE Sysmposium on the Foundations of Computer Science, pp. 120\u2013129 (1998)","DOI":"10.1109\/SFCS.1998.743435"},{"key":"33_CR18","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics\u00a05, 285\u2013309 (1955)","journal-title":"Pacific Journal of Mathematics"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2004 - Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28644-8_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T22:00:00Z","timestamp":1739916000000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28644-8_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540229407","9783540286448"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28644-8_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}