{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:47:39Z","timestamp":1725558459209},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540408017"},{"type":"electronic","value":"9783540452201"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45220-1_46","type":"book-chapter","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T23:33:58Z","timestamp":1277508838000},"page":"546-573","source":"Crossref","is-referenced-by-count":2,"title":["Fast Infinite-State Model Checking in Integer-Based Systems"],"prefix":"10.1007","author":[{"given":"Tatiana","family":"Rybina","sequence":"first","affiliation":[]},{"given":"Andrei","family":"Voronkov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-2","key":"46_CR1","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1999.2843","volume":"160","author":"P.A. Abdulla","year":"2000","unstructured":"Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: Algorithmic analysis of programs with well quasi-ordered domains. Information and Computation\u00a0160(1-2), 109\u2013127 (2000)","journal-title":"Information and Computation"},{"key":"46_CR2","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0304-3975(00)00105-5","volume":"256","author":"P.A. Abdulla","year":"2001","unstructured":"Abdulla, P.A., Jonsson, B.: Ensuring completeness of symbolic verification methods for infinite-state systems. Theoretical Computer Science\u00a0256, 145\u2013167 (2001)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"46_CR3","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0304-3975(96)00195-8","volume":"173","author":"F. Ajili","year":"1997","unstructured":"Ajili, F., Contejean, E.: Avoiding slack variables in the solving of linear Diophantine equations and inequations. Theoretical Computer Science\u00a0173(1), 183\u2013208 (1997)","journal-title":"Theoretical Computer Science"},{"key":"46_CR4","first-page":"15","volume":"60","author":"A.P. Beltyukov","year":"1976","unstructured":"Beltyukov, A.P.: Decidability of the universal theory of natural numbers with addition and divisibility (in Russian). Zapiski Nauchnyh Seminarov LOMI\u00a060, 15\u201328 (1976); English translation in Journal of Soviet Mathematics","journal-title":"Zapiski Nauchnyh Seminarov LOMI"},{"key":"46_CR5","unstructured":"Bj\u00f8rner, N.S.: Integrating Decision Procedures for Temporal Verification. PhD thesis, Computer Science Department, Stanford University (1998)"},{"key":"46_CR6","unstructured":"Bj\u00f8rner, N.S.: Reactive verification with queues. In: ARO\/ONR\/NSF\/DARPA Workshop on Engineering Automation for Computer-Based Systems, Carmel, CA, pp. 1\u20138 (1998)"},{"key":"46_CR7","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1145\/337180.337219","volume-title":"ICSE 2000, Proceedings of the 22nd International Conference on Software Engineering","author":"T. Bultan","year":"2000","unstructured":"Bultan, T.: Action Language: a specification language for model checking reactive systems. In: ICSE 2000, Proceedings of the 22nd International Conference on Software Engineering, Limerick, Ireland, pp. 335\u2013344. ACM, New York (2000)"},{"issue":"4","key":"46_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"},{"issue":"1","key":"46_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1006\/inco.1994.1067","volume":"113","author":"E. Contejean","year":"1994","unstructured":"Contejean, E., Devie, H.: An efficient incremental algorithm for solving of systems of linear Diophantine equations. Information and Computation\u00a0113(1), 143\u2013172 (1994)","journal-title":"Information and Computation"},{"key":"46_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/10722167_8","volume-title":"Computer Aided Verification","author":"G. Delzanno","year":"2000","unstructured":"Delzanno, G.: Automatic verification of parametrized cache coherence protocols. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 53\u201368. Springer, Heidelberg (2000)"},{"issue":"3","key":"46_CR11","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. International Journal on Software Tools for Technology Transfer\u00a03(3), 250\u2013270 (2001)","journal-title":"International Journal on Software Tools for Technology Transfer"},{"issue":"3","key":"46_CR12","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0167-6423(83)90017-5","volume":"2","author":"E.A. Emerson","year":"1982","unstructured":"Emerson, E.A., Clarke, E.M.: Using branching time temporal logic to synthesize synchronization skeletons. Science of Computer Programming\u00a02(3), 241\u2013266 (1982)","journal-title":"Science of Computer Programming"},{"key":"46_CR13","first-page":"352","volume-title":"14th Annual IEEE Symposium on Logic in Computer Science (LICS 1999)","author":"J. Esparza","year":"1999","unstructured":"Esparza, J., Finkel, A., Mayr, R.: On the verification of broadcast protocols. In: 14th Annual IEEE Symposium on Logic in Computer Science (LICS 1999), Trento, Italy, pp. 352\u2013359. IEEE Computer Society, Los Alamitos (1999)"},{"issue":"2","key":"46_CR14","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"},{"issue":"1\u20132","key":"46_CR15","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/s100090050008","volume":"1","author":"T.A. Henzinger","year":"1997","unstructured":"Henzinger, T.A., Ho, P.-H., Wong-Toi, H.: Hy-Tech: a model checker for hybrid systems. International Journal on Software Tools for Technology Transfer\u00a01(1\u20132), 110\u2013122 (1997)","journal-title":"International Journal on Software Tools for Technology Transfer"},{"key":"46_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-46541-3_2","volume-title":"STACS 2000","author":"T.A. Henzinger","year":"2000","unstructured":"Henzinger, T.A., Majumdar, R.: A classification of symbolic state transition systems. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol.\u00a01770, pp. 13\u201334. Springer, Heidelberg (2000)"},{"key":"46_CR17","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/BF01208503","volume":"36","author":"D. Hilbert","year":"1890","unstructured":"Hilbert, D.: \u00fcber die Theorie der algebraischen Formen. Mathematische Annalen\u00a036, 473\u2013534 (1890)","journal-title":"Mathematische Annalen"},{"key":"46_CR18","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1006\/jcss.1995.1051","volume":"51","author":"P. Kanellakis","year":"1995","unstructured":"Kanellakis, P., Kuper, G.M., Revesz, P.Z.: Constraint query languages. Journal of Computer and System Sciences\u00a051, 26\u201352 (1995)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1-2","key":"46_CR19","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0304-3975(00)00103-1","volume":"256","author":"Y. Kesten","year":"2001","unstructured":"Kesten, Y., Maler, O., Marcus, M., Pnueli, A., Shahar, E.: Symbolic model checking with rich assertional languages. Theoretical Computer Science\u00a0256(1-2), 93\u2013112 (2001)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"46_CR20","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1023\/A:1011254632723","volume":"19","author":"O. Kupferman","year":"2001","unstructured":"Kupferman, O., Vardi, M.: Model checking of safety properties. Formal Methods in System Design\u00a019(3), 291\u2013314 (2001)","journal-title":"Formal Methods in System Design"},{"issue":"3","key":"46_CR21","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1006\/jsco.2001.0472","volume":"32","author":"G. Lafferriere","year":"2001","unstructured":"Lafferriere, G., Pappas, G.J., Yovine, S.: Symbolic reachability computation for families of linear vector fields. Journal of Symbolic Computations\u00a032(3), 231\u2013253 (2001)","journal-title":"Journal of Symbolic Computations"},{"key":"46_CR22","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1090\/S0002-9947-1978-0469886-1","volume":"235","author":"L. Lipshitz","year":"1978","unstructured":"Lipshitz, L.: The Diophantine problem for addition and divisibility. Transactions of the American Mathematical Society\u00a0235, 271\u2013283 (1978)","journal-title":"Transactions of the American Mathematical Society"},{"issue":"5","key":"46_CR23","first-page":"588","volume":"16","author":"V.I. Mart\u2019janov","year":"1977","unstructured":"Mart\u2019janov, V.I.: Universal extended theories of integers. Algebra i Logika\u00a016(5), 588\u2013602 (1977)","journal-title":"Algebra i Logika"},{"key":"46_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-540-45099-3_2","volume-title":"Static Analysis","author":"A. Podelski","year":"2000","unstructured":"Podelski, A.: Model checking as constraint solving. In: Palsberg, J. (ed.) SAS 2000. LNCS, vol.\u00a01824, pp. 22\u201337. Springer, Heidelberg (2000)"},{"issue":"6","key":"46_CR25","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/773473.178254","volume":"29","author":"W. Pugh","year":"1994","unstructured":"Pugh, W.: Counting solutions to Presburger formulas: how and why. ACM SIGPLAN Notices\u00a029(6), 121\u2013134 (1994); Proceedings of the ACM SIGPLAN 1994 Conference on Programming Languages Design and Implementation (PLDI) (1994)","journal-title":"ACM SIGPLAN Notices"},{"key":"46_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/3-540-11494-7_22","volume-title":"International Symposium on Programming","author":"J.P. Queille","year":"1982","unstructured":"Queille, J.P., Sifakis, J.: Specification and verification of concurrent systems in Cesar. In: Dezani-Ciancaglini, M., Montanari, U. (eds.) Programming 1982. LNCS, vol.\u00a0137, pp. 337\u2013351. Springer, Heidelberg (1982)"},{"key":"46_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/3-540-45657-0_32","volume-title":"Computer Aided Verification","author":"T. Rybina","year":"2002","unstructured":"Rybina, T., Voronkov, A.: Using canonical representations of solutions to speed up infinitestate model-checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, p. 386. Springer, Heidelberg (2002) (to appear)"},{"key":"46_CR28","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1998","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley and Sons, Chichester (1998)"},{"key":"46_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BFb0023912","volume-title":"Progress in Artificial Intelligence","author":"A.P. Tom\u00e1s","year":"1997","unstructured":"Tom\u00e1s, A.P., Filgueiras, M.: An algorithm for solving systems of linear diophantine equations in naturals. In: Costa, E. (ed.) EPIA 1997. LNCS, vol.\u00a01323, pp. 73\u201384. Springer, Heidelberg (1997)"},{"key":"46_CR30","unstructured":"Voronkov, A.: An incremental algorithm for finding the basis of solutions to systems of linear Diophantine equations and inequations (January 2003) (unpublished)"},{"issue":"3","key":"46_CR31","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1145\/131295.131299","volume":"35","author":"D.S. Warren","year":"1992","unstructured":"Warren, D.S.: Memoing for logic programs. Communications of the ACM\u00a035(3), 93\u2013111 (1992)","journal-title":"Communications of the ACM"},{"key":"46_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/3-540-45319-9_5","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"T. Yavuz-Kahveci","year":"2001","unstructured":"Yavuz-Kahveci, T., Tuncer, M., Bultan, T.: A library for composite symbolic representations. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol.\u00a02031, pp. 52\u201366. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45220-1_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,6]],"date-time":"2020-06-06T05:00:14Z","timestamp":1591419614000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45220-1_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540408017","9783540452201"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45220-1_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}