{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T04:03:23Z","timestamp":1781064203267,"version":"3.54.1"},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":6053,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1997]]},"DOI":"10.1016\/s1571-0661(05)80426-8","type":"journal-article","created":{"date-parts":[[2005,5,19]],"date-time":"2005-05-19T09:46:30Z","timestamp":1116495990000},"page":"27-37","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":123,"special_numbering":"C","title":["A Direct Symbolic Approach to Model Checking Pushdown Systems (extended abstract)"],"prefix":"10.1016","volume":"9","author":[{"given":"Alain","family":"Finkel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bernard","family":"Willems","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pierre","family":"Wolper","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80426-8_BIBBG96","doi-asserted-by":"crossref","unstructured":"B. Boigelot and P. Godefroid. Symbolic verification of communication protocols with infinite state spaces using QDDs. In Proc. 8th Conference on Computer Aided Verification, volume 1102, pages 1-12, New Brunswick, August 1996. Lecture Notes in Computer Science, Springer-Verlag.B. Boigelot and P. Godefroid. Symbolic verification of communication protocols with infinite state spaces using QDDs. In Proc. 8th Conference on Computer Aided Verification, volume 1102, pages 1-12, New Brunswick, August 1996. Lecture Notes in Computer Science, Springer-Verlag.B. Boigelot and P. Godefroid. Symbolic verification of communication protocols with infinite state spaces using QDDs. In Proc. 8th Conference on Computer Aided Verification, volume 1102, pages 1-12, New Brunswick, August 1996. Lecture Notes in Computer Science, Springer-Verlag.B. Boigelot and P. Godefroid. Symbolic verification of communication protocols with infinite state spaces using QDDs. In Proc. 8th Conference on Computer Aided Verification, volume 1102, pages 1-12, New Brunswick, August 1996. Lecture Notes in Computer Science, Springer-Verlag.","DOI":"10.1007\/3-540-61474-5_53"},{"key":"10.1016\/S1571-0661(05)80426-8_BIBBM96","article-title":"Reachability analysis of pushdown automata","author":"Bouajjani","year":"1996","journal-title":"INFINITY workshop"},{"issue":"2","key":"10.1016\/S1571-0661(05)80426-8_BIBBS95","first-page":"89","article-title":"Composition, decomposition and model checking of pushdown processes","volume":"2","author":"Burkart","year":"1995","journal-title":"Nordic Journal of Computing"},{"key":"10.1016\/S1571-0661(05)80426-8_BIBBVW94","doi-asserted-by":"crossref","unstructured":"O. Bernholtz, M.Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. In Computer Aided Verification, Proc. 6th Int. Workshop, Stanford, California, June 1994. Lecture Notes in Computer Science, Springer-Verlag. Full version available from authors.","DOI":"10.1007\/3-540-58179-0_50"},{"key":"10.1016\/S1571-0661(05)80426-8_BIBCAU92","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0304-3975(92)90278-N","article-title":"On the regular structure of prefix rewriting","volume":"106","author":"Caucal","year":"1992","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80426-8_BIBCVWY92","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/BF00121128","article-title":"Memory efficient algorithms for the verification of temporal properties","volume":"1","author":"Courcoubetis","year":"1992","journal-title":"Formal Methods in System Design"},{"key":"10.1016\/S1571-0661(05)80426-8_BIBEL85","doi-asserted-by":"crossref","unstructured":"E.A. Emerson and C.-L. Lei. Modalities for model checking: Branching time logic strikes back. In Proceedings of the Twelfth ACM Symposium on Principles of Programming Languages, pages 84-96, New Orleans, January 1985.","DOI":"10.1145\/318593.318620"},{"key":"10.1016\/S1571-0661(05)80426-8_BIBEME90","first-page":"997","article-title":"Temporal and modal logic","author":"Emerson","year":"1990","journal-title":"Handbook of theoretical computer science"},{"key":"10.1016\/S1571-0661(05)80426-8_BIBGPVW95","doi-asserted-by":"crossref","unstructured":"R. Gerth, D. Peled, M. Y. Vardi, and P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. In Proc. 15th Work. Protocol Specification, Testing, and Verification, Warsaw, June 1995. North-Holland.","DOI":"10.1007\/978-0-387-34892-6_1"},{"key":"10.1016\/S1571-0661(05)80426-8_BIBGW91","doi-asserted-by":"crossref","unstructured":"P. Godefroid and P. Wolper. A partial approach to model checking. In Proc. 6th Symp. on Logic in Computer Science, pages 406-415, Amsterdam, July 1991.","DOI":"10.1109\/LICS.1991.151664"},{"key":"10.1016\/S1571-0661(05)80426-8_BIBHJM94","doi-asserted-by":"crossref","unstructured":"Yoram Hirshfeld, Mark Jerrum, and Faron Moller. A polynomial-time algorithm for deciding equivalence of normed context-free processes. In 35th Annual Symposium on Foundations of Computer Science, pages 623-631, Santa Fe, New Mexico, 20-22 November 1994. IEEE.","DOI":"10.1109\/SFCS.1994.365729"},{"key":"10.1016\/S1571-0661(05)80426-8_BIBHOL91","series-title":"Design and Validation of Computer Protocols","author":"Holzmann","year":"1991"},{"key":"10.1016\/S1571-0661(05)80426-8_BIBHR94","article-title":"Deciding emptiness for stack automata on infinite trees","volume":"113","author":"Harel","year":"1994","journal-title":"Information and Computation (formerly Information and Control)"},{"key":"10.1016\/S1571-0661(05)80426-8_BIBHS91","doi-asserted-by":"crossref","unstructured":"Hans H\u00fcttel and Colin Stirling. Actions speak louder than words: Proving bisimilarity for context-free processes. In Proceedings, Sixth Annual IEEE Symposium on Logic in Computer Science, pages 376-386, Amsterdam, The Netherlands, 15-18 July 1991. IEEE Computer Society Press.","DOI":"10.1109\/LICS.1991.151661"},{"key":"10.1016\/S1571-0661(05)80426-8_BIBHU69","series-title":"Formal Languages and their Relation to Automata","author":"Hopcroft","year":"1969"},{"key":"10.1016\/S1571-0661(05)80426-8_BIBMP92","series-title":"The Temporal Logic of Reactive and Concurrent Systems: Specification","author":"Manna","year":"1992"},{"key":"10.1016\/S1571-0661(05)80426-8_BIBMS85","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(85)90087-8","article-title":"The theory of ends, pushdown automata, and second-order logic","volume":"37","author":"Muller","year":"1985","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80426-8_BIBPP92","series-title":"In Colloquium on Trees in Algebra and Programming. LNCS 581","article-title":"Empty stack pushdown omega-tree automata","author":"Peng","year":"1992"},{"key":"10.1016\/S1571-0661(05)80426-8_BIBVW86","unstructured":"M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proceedings of the First Symposium on Logic in Computer Science, pages 322-331, Cambridge, June 1986."},{"key":"10.1016\/S1571-0661(05)80426-8_BIBWAL96","doi-asserted-by":"crossref","unstructured":"Igor Walukiewicz. Pushdown processes: Games and model checking:. In Proc. 8th Workshop on Computer Aided Verification, volume 1102 of Lecture Notes in Computer Science, pages 62-74, New Brunswick, NJ, USA, July\/August 1996. Springer-Verlag.","DOI":"10.1007\/3-540-61474-5_58"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105804268?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105804268?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:07:01Z","timestamp":1761610021000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105804268"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"references-count":20,"alternative-id":["S1571066105804268"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80426-8","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A Direct Symbolic Approach to Model Checking Pushdown Systems (extended abstract)","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80426-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1997 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}