{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:49:01Z","timestamp":1772164141210,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2003,1,15]],"date-time":"2003-01-15T00:00:00Z","timestamp":1042588800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2003,1,15]]},"DOI":"10.1145\/604131.604137","type":"proceedings-article","created":{"date-parts":[[2003,6,2]],"date-time":"2003-06-02T13:12:42Z","timestamp":1054559562000},"page":"62-73","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":83,"title":["A generic approach to the static analysis of concurrent programs with procedures"],"prefix":"10.1145","author":[{"given":"Ahmed","family":"Bouajjani","sequence":"first","affiliation":[{"name":"University of Paris"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Javier","family":"Esparza","sequence":"additional","affiliation":[{"name":"University of Edinburgh"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tayssir","family":"Touili","sequence":"additional","affiliation":[{"name":"University of Paris"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2003,1,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/646579.697746"},{"key":"e_1_3_2_1_2_1","series-title":"LNCS","volume-title":"CONCUR'97","author":"Bouajjani A.","year":"1997","unstructured":"A. Bouajjani , J. Esparza , and O. Maler . Reachability Analysis of Pushdown Automata: Application to Model Checking . In CONCUR'97 , volume 1243 of LNCS , 1997 . A. Bouajjani, J. Esparza, and O. Maler. Reachability Analysis of Pushdown Automata: Application to Model Checking. In CONCUR'97, volume 1243 of LNCS, 1997."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/120807.120811"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/193173.195295"},{"key":"e_1_3_2_1_6_1","series-title":"LNCS","volume-title":"CAV'00","author":"Esparza J.","year":"2000","unstructured":"J. Esparza , D. Hansel , P. Rossmanith , and S. Schwoon . Efficient algorithm for model checking pushdown systems . In CAV'00 , volume 1885 of LNCS , 2000 . J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. Efficient algorithm for model checking pushdown systems. In CAV'00, volume 1885 of LNCS, 2000."},{"key":"e_1_3_2_1_7_1","series-title":"Lecture Notes in Computer Science","volume-title":"Proc of Foundations of Software Science and Computation Structure, FoSSaCS'99","author":"Esparza J.","year":"1999","unstructured":"J. Esparza and J. Knoop . An automata-theoretic approach to interprocedural data-flow analysis . In W. Thomas, editor, Proc of Foundations of Software Science and Computation Structure, FoSSaCS'99 , volume 1578 of Lecture Notes in Computer Science . Springer , 1999 . J. Esparza and J. Knoop. An automata-theoretic approach to interprocedural data-flow analysis. In W. Thomas, editor, Proc of Foundations of Software Science and Computation Structure, FoSSaCS'99, volume 1578 of Lecture Notes in Computer Science. Springer, 1999."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/325694.325697"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/788021.788976"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00306-6"},{"key":"e_1_3_2_1_11_1","series-title":"LNCS","first-page":"312","volume-title":"Mathematical Foundations of Programming Semantics","author":"Mercouroff N.","year":"1991","unstructured":"N. Mercouroff . An algorithm for analyzing communicating processes . In Mathematical Foundations of Programming Semantics , volume 598 of LNCS , pages 312 -- 325 , 1991 . N. Mercouroff. An algorithm for analyzing communicating processes. In Mathematical Foundations of Programming Semantics, volume 598 of LNCS, pages 312--25, 1991."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/288195.288213"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/349214.349241"},{"key":"e_1_3_2_1_14_1","series-title":"LNCS","volume-title":"Proc. of the 8th International Symposium on Static Analysis, SAS","author":"Rinard M.","year":"2001","unstructured":"M. Rinard . Analysis of multithreaded programs . In P. Cousot, editor, Proc. of the 8th International Symposium on Static Analysis, SAS 2001 , volume 2126 of LNCS , 2001. M. Rinard. Analysis of multithreaded programs. In P. Cousot, editor, Proc. of the 8th International Symposium on Static Analysis, SAS 2001, volume 2126 of LNCS, 2001."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/69586.69587"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/373243.360206"}],"event":{"name":"POPL03: POPL '03 - The 30th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"New Orleans Louisiana USA","acronym":"POPL03","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/604131.604137","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/604131.604137","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:44:43Z","timestamp":1750254283000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/604131.604137"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1,15]]},"references-count":15,"alternative-id":["10.1145\/604131.604137","10.1145\/604131"],"URL":"https:\/\/doi.org\/10.1145\/604131.604137","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/640128.604137","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2003,1,15]]},"assertion":[{"value":"2003-01-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}