{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:36:32Z","timestamp":1759332992801},"reference-count":14,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3819,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s0304-3975(02)00397-3","type":"journal-article","created":{"date-parts":[[2003,2,28]],"date-time":"2003-02-28T19:20:13Z","timestamp":1046460013000},"page":"85-106","source":"Crossref","is-referenced-by-count":20,"title":["Automatic verification of recursive procedures with one integer parameter"],"prefix":"10.1016","volume":"295","author":[{"given":"Ahmed","family":"Bouajjani","sequence":"first","affiliation":[]},{"given":"Peter","family":"Habermehl","sequence":"additional","affiliation":[]},{"given":"Richard","family":"Mayr","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00397-3_BIB1","article-title":"Reachability analysis of pushdown automata","volume":"Vol. 1243","author":"Bouajjani","year":"1997"},{"key":"10.1016\/S0304-3975(02)00397-3_BIB2","first-page":"30","article-title":"Diophantine equations, presburger arithmetic and finite automata","volume":"Vol. 1059","author":"Boudet","year":"1996"},{"key":"10.1016\/S0304-3975(02)00397-3_BIB3","first-page":"98","article-title":"Pushdown processes","volume":"Vol. 836","author":"Burkart","year":"1994"},{"key":"10.1016\/S0304-3975(02)00397-3_BIB4","article-title":"Model checking the full modal mu-calculus for infinite sequential processes","volume":"Vol. 1256","author":"Burkart","year":"1997"},{"key":"10.1016\/S0304-3975(02)00397-3_BIB5","doi-asserted-by":"crossref","unstructured":"J. Esparza, D. Hansel, P. Rossmanith, S. Schwoon, Efficient algorithms for model checking pushdown systems, in: Proc. of CAV 2000, Lecture Notes in Computer Science, Vol. 1855, Springer, Berlin, 2000.","DOI":"10.1007\/10722167_20"},{"key":"10.1016\/S0304-3975(02)00397-3_BIB6","first-page":"14","article-title":"An automata-theoretic approach to interprocedural data-flow analysis","volume":"Vol. 1578","author":"Esparza","year":"1999"},{"key":"10.1016\/S0304-3975(02)00397-3_BIB7","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(82)90115-3","article-title":"The complexity of presburger arithmetic with bounded quantifier alternation depth","volume":"18","author":"Furer","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00397-3_BIB8","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0304-3975(88)90136-3","article-title":"Subclasses of presburger arithmetic and the polynomial-time hierarchy","volume":"56","author":"Gradel","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00397-3_BIB9","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/322047.322058","article-title":"Reversal-bounded multicounter machines and their decision problems","volume":"25","author":"Ibarra","year":"1978","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(02)00397-3_BIB10","article-title":"Reachability analysis for some models of infinite-state transition systems","volume":"Vol. 1877","author":"Ibarra","year":"2000"},{"key":"10.1016\/S0304-3975(02)00397-3_BIB11","doi-asserted-by":"crossref","unstructured":"R. Mayr, Undecidable problems in unreliable computations, in: Proc. of LATIN 2000, Lecture Notes in Computer Science, Vol. 1776, Springer, Berlin, 2000. Theoret. Comput. Sci., to appear.","DOI":"10.1007\/10719839_37"},{"issue":"4","key":"10.1016\/S0304-3975(02)00397-3_BIB12","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1145\/321356.321364","article-title":"On context-free languages","volume":"13","author":"Parikh","year":"1966","journal-title":"Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(02)00397-3_BIB13","doi-asserted-by":"crossref","unstructured":"J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science: Volume A, Algorithms and Complexity, Elsevier, Amsterdam, 1990.","DOI":"10.1016\/B978-0-444-88071-0.50015-1"},{"issue":"2","key":"10.1016\/S0304-3975(02)00397-3_BIB14","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1006\/inco.2000.2894","article-title":"Pushdown processes","volume":"164","author":"Walukiewicz","year":"2001","journal-title":"Inform. and Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502003973?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502003973?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T05:24:19Z","timestamp":1583990659000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502003973"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S0304397502003973"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00397-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}