{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T12:39:53Z","timestamp":1760099993515},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744061"},{"type":"electronic","value":"9783540744078"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74407-8_6","type":"book-chapter","created":{"date-parts":[[2007,8,18]],"date-time":"2007-08-18T14:30:48Z","timestamp":1187447448000},"page":"74-89","source":"Crossref","is-referenced-by-count":19,"title":["Solving Games Via Three-Valued Abstraction Refinement"],"prefix":"10.1007","author":[{"given":"Luca","family":"de Alfaro","sequence":"first","affiliation":[]},{"given":"Pritam","family":"Roy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/11817963_8","volume-title":"Computer Aided Verification","author":"B. Adler","year":"2006","unstructured":"Adler, B., de Alfaro, L., Silva, L.D.D., Faella, M., Legay, A., Raman, V., Roy, P.: TICC: a tool for interface compatibility and composition. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, pp. 59\u201362. Springer, Heidelberg (2006)"},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1006\/inco.1995.1059","volume":"118","author":"R. Alur","year":"1995","unstructured":"Alur, R., Itai, A., Kurshan, R.P., Yannakakis, M.: Timing verification by successive approximation. Inf. Comput.\u00a0118(1), 142\u2013157 (1995)","journal-title":"Inf. Comput."},{"key":"6_CR3","first-page":"1","volume-title":"Proceedings of the 29th Annual Symposium on Principles of Programming Languages","author":"T. Ball","year":"2002","unstructured":"Ball, T., Rajamani, S.: The SLAM project: Debugging system software via static analysis. In: Proceedings of the 29th Annual Symposium on Principles of Programming Languages, pp. 1\u20133. ACM Press, New York (2002)"},{"issue":"8","key":"6_CR4","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"R. Bryant","year":"1986","unstructured":"Bryant, R.: Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers\u00a0C-35(8), 677\u2013691 (1986)","journal-title":"IEEE Transactions on Computers"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/10722167_15","volume-title":"Computer Aided Verification","author":"E. Clarke","year":"2000","unstructured":"Clarke, E., Grumberg, O., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, Springer, Heidelberg (2000)"},{"key":"6_CR6","unstructured":"de Alfaro, L., Alur, R., Grosu, R., Henzinger, T., Kang, M., Majumdar, R., Mang, F., Meyer-Kirsch, C., Wang, B.: Mocha: A model checking tool that exploits design structure. In: ICSE 01. Proceedings of the 23rd International Conference on Software Engineering, pp. 835\u2013836 (2001)"},{"key":"6_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/11559306_5","volume-title":"Frontiers of Combining Systems","author":"L. Alfaro de","year":"2005","unstructured":"de Alfaro, L., da Silva, L.D., Faella, M., Legay, A., Roy, P., Sorea, M.: Sociable interfaces. In: Gramlich, B. (ed.) Frontiers of Combining Systems. LNCS (LNAI), vol.\u00a03717, pp. 81\u2013105. Springer, Heidelberg (2005)"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/978-3-540-45187-7_9","volume-title":"CONCUR 2003 - Concurrency Theory","author":"L. Alfaro de","year":"2003","unstructured":"de Alfaro, L., Faella, M., Henzinger, T., Majumdar, R., Stoelinga, M.: The element of surprise in timed games. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 144\u2013158. Springer, Heidelberg (2003)"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1109\/LICS.2004.1319611","volume-title":"Proc. 19th IEEE Symp. Logic in Comp. Sci.","author":"L. Alfaro de","year":"2004","unstructured":"de Alfaro, L., Godefroid, P., Jagadeesan, R.: Three-valued abstractions of games: Uncertainty, but with precision. In: Proc. 19th IEEE Symp. Logic in Comp. Sci., pp. 170\u2013179. IEEE Computer Society Press, Los Alamitos (2004)"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-44804-7","volume-title":"CONCUR 2001 - Concurrency Theory","author":"L. Alfaro de","year":"2001","unstructured":"de Alfaro, L., Henzinger, T., Majumdar, R.: Symbolic algorithms for infinite-state games. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, Springer, Heidelberg (2001)"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1109\/SFCS.1991.185392","volume-title":"Proc. 32nd IEEE Symp. Found. of Comp. Sci.","author":"E. Emerson","year":"1991","unstructured":"Emerson, E., Jutla, C.: Tree automata, mu-calculus and determinacy (extended abstract). In: Proc. 32nd IEEE Symp. Found. of Comp. Sci., pp. 368\u2013377. IEEE Computer Society Press, Los Alamitos (1991)"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1007\/3-540-45061-0_69","volume-title":"Automata, Languages and Programming","author":"T. Henzinger","year":"2003","unstructured":"Henzinger, T., Jhala, R., Majumdar, R.: Counterexample-guided control. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 886\u2013902. Springer, Heidelberg (2003)"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/3-540-59042-0_76","volume-title":"STACS 1995","author":"O. Maler","year":"1995","unstructured":"Maler, O., Pnueli, A., Sifakis, J.: On the synthesis of discrete controllers for timed systems. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol.\u00a0900, pp. 229\u2013242. Springer, Heidelberg (1995)"},{"key":"6_CR14","volume-title":"The Temporal Logic of Reactive and Concurrent Systems: Specification","author":"Z. Manna","year":"1991","unstructured":"Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer, New York (1991)"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0168-0072(90)90029-2","volume":"49","author":"D. Martin","year":"1990","unstructured":"Martin, D.: An extension of Borel determinacy. Annals of Pure and Applied Logic\u00a049, 279\u2013293 (1990)","journal-title":"Annals of Pure and Applied Logic"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/978-3-540-45069-6_28","volume-title":"Computer Aided Verification","author":"S. Shoham","year":"2003","unstructured":"Shoham, S.: A game-based framework for CTL counter-examples and 3-valued abstraction-refinement. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 275\u2013287. Springer, Heidelberg (2003)"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1007\/978-3-540-24730-2_40","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S. Shoham","year":"2004","unstructured":"Shoham, S., Grumberg, O.: Monotonic abstraction-refinement for CTL. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 546\u2013560. Springer, Heidelberg (2004)"},{"key":"6_CR18","first-page":"399","volume-title":"Proc. 21st IEEE Symp. Logic in Comp. Sci.","author":"S. Shoham","year":"2006","unstructured":"Shoham, S., Grumberg, O.: 3-valued abstraction: More precision at less cost. In: Proc. 21st IEEE Symp. Logic in Comp. Sci., pp. 399\u2013410. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"6_CR19","first-page":"135","volume-title":"Handbook of Theoretical Computer Science, ch. 4","author":"W. Thomas","year":"1990","unstructured":"Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, ch. 4, vol.\u00a0B, pp. 135\u2013191. Elsevier Science Publishers,North-Holland, Amsterdam (1990)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2007 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74407-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T06:22:41Z","timestamp":1550816561000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74407-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540744061","9783540744078"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74407-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}