{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T00:30:58Z","timestamp":1769733058265,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540581796","type":"print"},{"value":"9783540484691","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58179-0_67","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:25:27Z","timestamp":1330269927000},"page":"351-363","source":"Crossref","is-referenced-by-count":41,"title":["Incremental model checking in the modal mu-calculus"],"prefix":"10.1007","author":[{"given":"Oleg V.","family":"Sokolsky","sequence":"first","affiliation":[]},{"given":"Scott A.","family":"Smolka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"29_CR1","unstructured":"B. Alpern, R. Hoover, B. K. Rosen, P. F. Sweeney, and F. K. Zadeck. \u201cIncremental Evaluation of Computational Circuits\u201d. In Proc. of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, 1990."},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"H. R. Andersen. \u201cModel Checking and Boolean Graphs\u201d. In Proceedings of ESOP'92. LNCS 582, 1992.","DOI":"10.1007\/3-540-55253-7_1"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"R. Cleaveland, J. N. Gada, P. M. Lewis, S. A. Smolka, O. V. Sokolsky, and S. Zhang. \u201cThe Concurrency Factory \u2014 Practical Tools for Specification, Simulation, Verification and Implementation of Concurrent Systems\u201d. In Proceedings of the DIMACS Workshop on Specification Techniques for Concurrent Systems, Princeton, NJ., May 1994.","DOI":"10.1090\/dimacs\/018\/06"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"R. Cleaveland, J. Parrow, and B. Steffen. \u201cThe Concurrency Workbench: A Semantics-Based Tool for the Verification of Concurrent Systems\u201d. ACM TOPLAS, 15(1), 1993.","DOI":"10.1145\/151646.151648"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"R. Cleaveland and B. Steffen. \u201cA Linear-Time Model Checking Algorithm for the Alternation-Free Modal Mu-Calculus\u201d. Formal Methods in System Design, 2, 1993.","DOI":"10.1007\/BF01383878"},{"key":"29_CR6","unstructured":"E. A. Emerson and C.-L. Lei. \u201cEfficient Model Checking in Fragments of the Prepositional Mu-Calculus\u201d. In Proc. LICS '86. IEEE Computer Society Press, 1986."},{"key":"29_CR7","volume-title":"Flow Analysis of Computer Programs","author":"S. M. Hecht","year":"1977","unstructured":"S. M. Hecht. Flow Analysis of Computer Programs. Elsevier, North Holland, 1977."},{"key":"29_CR8","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. \u201cResults on the Propositional Mu-Calculus\u201d. Theoretical Computer Science, 27:333\u2013354, 1983.","journal-title":"Theoretical Computer Science"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"K. G. Larsen. \u201cEfficient Local Correctness Checking\u201d. In Proceedings of CAV'92, 1992.","DOI":"10.1007\/3-540-56496-9_4"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"R. Milner. A Calculus of Communicating Systems. LNCS 92, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"L. L. Pollock and M. L. Soffa. \u201cAn Incremental Version of Iterative Data Flow Analysis\u201d. IEEE Trans. Software Engineering, 15(12), 1989.","DOI":"10.1109\/32.58766"},{"key":"29_CR12","unstructured":"G. Ramalingam. Bounded Incremental Computation. PhD thesis, Computer Sciences Dept., University of Wisconsin-Madison, 1993."},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"B. G. Ryder, T. J. Marlowe, and M. C. Paull. \u201cConditions for Incremental Iteration: Examples and Counterexamples\u201d. Sci. Program., 11(1), 1988.","DOI":"10.1016\/0167-6423(88)90061-5"},{"key":"29_CR14","unstructured":"G. Ramalingam and T. Reps. \u201cOn the Computational Complexity of Incremental Algorithms\u201d. Technical Report TR-1033, Computer Sciences Dept., University of Wisconsin-Madison, 1991."},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"B. Steffen. \u201cData Flow Analysis as Model Checking\u201d. In Proc. TACS'91. LNCS 526, 1991.","DOI":"10.1007\/3-540-54415-1_54"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"C. Stirling and D. Walker. \u201cLocal Model Checking in the Modal Mu-Calculus\u201d. Theoretical Computer Science, 89(1), 1991.","DOI":"10.1016\/0304-3975(90)90110-4"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58179-0_67.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T06:18:32Z","timestamp":1640931512000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58179-0_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540581796","9783540484691"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-58179-0_67","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]}}}