{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:09:19Z","timestamp":1725566959021},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540304951"},{"type":"electronic","value":"9783540324195"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11590156_18","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T15:43:16Z","timestamp":1133797396000},"page":"225-237","source":"Crossref","is-referenced-by-count":2,"title":["Decision Procedures for Queues with Integer Constraints"],"prefix":"10.1007","author":[{"given":"Ting","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Henny B.","family":"Sipma","sequence":"additional","affiliation":[]},{"given":"Zohar","family":"Manna","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1109\/LICS.2001.932518","volume-title":"Proceedings of 16th IEEE Symposium on Logic in Computer Science (LICS 2001)","author":"M. Benedikt","year":"2001","unstructured":"Benedikt, M., Libkin, L., Schwentick, T., Segoufin, L.: A modeltheoretic approach to regular string relations. In: Proceedings of 16th IEEE Symposium on Logic in Computer Science (LICS 2001), pp. 431\u2013440. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"18_CR2","unstructured":"Bj\u00f8rner, N.S.: Integrating Decision Procedures for Temporal Verification. Ph.D thesis, Computer Science Department, Stanford University (November 1998)"},{"key":"18_CR3","first-page":"91","volume-title":"Machine Intelligence","author":"D.C. Cooper","year":"1972","unstructured":"Cooper, D.C.: Theorem proving in arithmetic without multiplication. In: Machine Intelligence, vol.\u00a07, pp. 91\u201399. American Elsevier, Amsterdam (1972)"},{"key":"18_CR4","volume-title":"A Mathematical Introduction to Logic","author":"H.B. Enderton","year":"2001","unstructured":"Enderton, H.B.: A Mathematical Introduction to Logic. Academic Press, London (2001)"},{"key":"18_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511551574","volume-title":"Model Theory","author":"W. Hodges","year":"1993","unstructured":"Hodges, W.: Model Theory. Cambridge University Press, Cambridge (1993)"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45061-0_54","volume-title":"Automata, Languages and Programming","author":"F. Klaedtke","year":"2003","unstructured":"Klaedtke, F., Rue\u00df, H.: Monadic second-order logics with cardinalities. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, Springer, Heidelberg (2003)"},{"key":"18_CR7","volume-title":"Combinatorics on Words","author":"M. Lothaire","year":"1983","unstructured":"Lothaire, M.: Combinatorics on Words. Addison-Wesley, Reading (1983)"},{"issue":"2","key":"18_CR8","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/357073.357079","volume":"1","author":"G. Nelson","year":"1979","unstructured":"Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. ACM Transaction on Programming Languages and Systems\u00a01(2), 245\u2013257 (1979)","journal-title":"ACM Transaction on Programming Languages and Systems"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1145\/800133.804361","volume-title":"Proceedings of the 10th Annual Symposium on Theory of Computing (STOC 1978)","author":"C.R. Reddy","year":"1978","unstructured":"Reddy, C.R., Loveland, D.W.: Presburger arithmetic with bounded quantifier alternation. In: Proceedings of the 10th Annual Symposium on Theory of Computing (STOC 1978), pp. 320\u2013325. ACM Press, New York (1978)"},{"key":"18_CR10","first-page":"279","volume-title":"Proceedings of 15th IEEE Symposium on Logic in Computer Science (LICS 2000)","author":"T. Rybina","year":"2000","unstructured":"Rybina, T., Voronkov, A.: A decision procedure for term algebras with queues. In: Proceedings of 15th IEEE Symposium on Logic in Computer Science (LICS 2000), pp. 279\u2013290. IEEE Computer Society Press, Los Alamitos (2000)"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1007\/3-540-45061-0_56","volume-title":"Automata, Languages and Programming","author":"T. Rybina","year":"2003","unstructured":"Rybina, T., Voronkov, A.: Upper bounds for a theory of queues. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 714\u2013724. Springer, Heidelberg (2003)"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0304-3975(92)90090-3","volume":"103","author":"W. Thomas","year":"1992","unstructured":"Thomas, W.: Infinite trees and automaton-definable relations over \u03c9-words. Theoretical Computer Science\u00a0103, 143\u2013159 (1992)","journal-title":"Theoretical Computer Science"},{"key":"18_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-540-25984-8_9","volume-title":"Automated Reasoning","author":"T. Zhang","year":"2004","unstructured":"Zhang, T., Sipma, H.B., Manna, Z.: Decision procedures for recursive data structures with integer constraints. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS (LNAI), vol.\u00a03097, pp. 152\u2013167. Springer, Heidelberg (2004)"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-540-30142-4_23","volume-title":"Theorem Proving in Higher Order Logics","author":"T. Zhang","year":"2004","unstructured":"Zhang, T., Sipma, H.B., Manna, Z.: Term algebras with length function and bounded quantifier alternation. In: Slind, K., Bunker, A., Gopalakrishnan, G.C. (eds.) TPHOLs 2004. LNCS, vol.\u00a03223, pp. 321\u2013336. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11590156_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:49:06Z","timestamp":1619506146000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11590156_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540304951","9783540324195"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11590156_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}