{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:44:49Z","timestamp":1725558289453},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405245"},{"type":"electronic","value":"9783540450696"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45069-6_26","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T21:11:46Z","timestamp":1277241106000},"page":"249-261","source":"Crossref","is-referenced-by-count":6,"title":["Efficient Image Computation in Infinite State Model Checking"],"prefix":"10.1007","author":[{"given":"Constantinos","family":"Bartzis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tevfik","family":"Bultan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"The Li\u00e8ge Automata-based Symbolic Handler (LASH), Available at \n                    \n                      http:\/\/www.montefiore.ulg.ac.be\/~boigelot\/research\/lash\/"},{"key":"26_CR2","unstructured":"Bartzis, C., Bultan, T.: Efficient symbolic representations for arithmetic constraints in verification. International Journal of Foundations of Computer Science (to appear)"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Bartzis, C., Bultan, T.: Automata-based representations for arithmetic constraints in automated verification. In: Proceedings of the Seventh International Conference on Implementation and Application of Automata (2002)","DOI":"10.1007\/3-540-44977-9_30"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Bartzis, C., Bultan, T.: Construction of efficient BDDs for bounded arithmetic constraints. In: Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (2003)","DOI":"10.1007\/3-540-36577-X_28"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/3-540-61064-2_27","volume-title":"Trees in Algebra and Programming - CAAP \u201996","author":"A. Boudet","year":"1996","unstructured":"Boudet, A., Comon, H.: Diophantine equations, Presburger arithmetic and finite automata. In: Kirchner, H. (ed.) CAAP 1996. LNCS, vol.\u00a01059, pp. 30\u201343. Springer, Heidelberg (1996)"},{"key":"26_CR6","unstructured":"Bryant, R.: Graph-based algorithms for boolean function manipulation. In: Proceedings of the 27th ACM\/IEEE Design Automation Conference (1990)"},{"key":"26_CR7","unstructured":"Bultan, T., Yavuz-Kahveci, T.: Action language verifier. In: Proceedings of the 16th IEEE International Conference on Automated Software Engineering (2001)"},{"issue":"4","key":"26_CR8","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1145\/325478.325480","volume":"21","author":"T. Bultan","year":"1999","unstructured":"Bultan, T., Gerber, R., Pugh, W.: Model-checking concurrent systems with unbounded integer variables: symbolic representations, approximations, and experimental results. ACM Transactions on Programming Languages and Systems\u00a021(4), 747\u2013789 (1999)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Delzanno, G., Bultan, T.: Constraint-based verification of client-server protocols. In: Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming (2001)","DOI":"10.1007\/3-540-45578-7_20"},{"issue":"3","key":"26_CR10","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/s100090100049","volume":"3","author":"G. Delzanno","year":"2001","unstructured":"Delzanno, G., Podelski, A.: Constraint-based deductive model checking. Journal of Software Tools and Technology Transfer\u00a03(3), 250\u2013270 (2001)","journal-title":"Journal of Software Tools and Technology Transfer"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/3-540-47764-0_12","volume-title":"Static Analysis","author":"N. Dor","year":"2001","unstructured":"Dor, N., Rodeh, M., Sagiv, M.: Cleanness checking of string manipulations in C programs via integer analysis. In: Cousot, P. (ed.) SAS 2001. LNCS, vol.\u00a02126, pp. 194\u2013212. Springer, Heidelberg (2001)"},{"issue":"2","key":"26_CR12","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1023\/A:1008678014487","volume":"11","author":"N. Halbwachs","year":"1997","unstructured":"Halbwachs, N., Proy, Y.E., Roumanoff, P.: Verification of real-time systems using linear relation analysis. Formal Methods in System Design\u00a011(2), 157\u2013185 (1997)","journal-title":"Formal Methods in System Design"},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/s100090050008","volume":"1","author":"T.A. Henzinger","year":"1997","unstructured":"Henzinger, T.A., Ho, P., Wong-Toi, H.: Hytech: a model checker for hybrid systems. Software Tools for Technology Transfer\u00a01, 110\u2013122 (1997)","journal-title":"Software Tools for Technology Transfer"},{"key":"26_CR14","unstructured":"Klarlund, N., M\u00f8ller, A.: MONA Version 1.4 User Manual. BRICS Notes Series NS-01-1, Department of Computer Science, University of Aarhus (2001)"},{"key":"26_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3190-6","volume-title":"Symbolic model checking","author":"K.L. McMillan","year":"1993","unstructured":"McMillan, K.L.: Symbolic model checking. Kluwer Academic Publishers, Massachusetts (1993)"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Pugh, W.: The Omega test: a fast and practical integer programming algorithm for dependence analysis (1992)","DOI":"10.1145\/125826.125848"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Rybina, T., Voronkov, A.: Using canonical representations of solutions to speed up infinite-state model checking. In: Proceedings of the 14th International Conference on Computer Aided Verification, pp. 400\u2013411 (2002)","DOI":"10.1007\/3-540-45657-0_32"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Wolper, P., Boigelot, B.: An automata-theoretic approach to Presburger arithmetic constraints. In: Proceedings of the Static Analysis Symposium (1995)","DOI":"10.1007\/3-540-60360-3_30"},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-46419-0_1","volume-title":"Proceedings of the 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems","author":"P. Wolper","year":"2000","unstructured":"Wolper, P., Boigelot, B.: On the construction of automata from linear arithmetic constraints. In: Graf, S., Schwartzbach, M. (eds.) Proceedings of the 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. LNCS, pp. 1\u201319. Springer, Heidelberg (2000)"},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"Yavuz-Kahveci, T., Bultan, T.: Specification, verification, and synthesis of concurrency control components. In: Proceedings of the International Symposium on Software Testing and Analysis, July 2002, pp. 169\u2013179 (2002)","DOI":"10.1145\/566172.566199"},{"key":"26_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/3-540-45319-9_5","volume-title":"Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems","author":"T. Yavuz-Kahveci","year":"2001","unstructured":"Yavuz-Kahveci, T., Tuncer, M., Bultan, T.: Composite symbolic library. In: Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. LNCS, vol.\u00a02031, pp. 335\u2013344. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45069-6_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T22:09:20Z","timestamp":1580335760000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45069-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405245","9783540450696"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45069-6_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}