{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T18:22:53Z","timestamp":1781893373844,"version":"3.54.5"},"reference-count":5,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2003,8]]},"abstract":"<jats:p> We present a generic aproach to the static analysis of concurrent programs with procedures. We model programs as communicating pushdown systems. It is known that typical dataflow problems for this model are undecidable, because the emptiness problem for the intersection of context-free languages, which is undecidable, can be reduced to them. In this paper we propose an algebraic framework for defining abstractions (upper approximations) of context-free languages. We consider two classes of abstractions: finite-chain abstractions, which are abstractions whose domains do not contain any infinite chains, and commutative abstractions corresponding to classes of languages that contain a word if and only if they contain all its permutations. We show how to compute such approximations by combining automata theoretic techniques with algorithms for solving systems of polynomial inequations in Kleene algebras. <\/jats:p>","DOI":"10.1142\/s0129054103001893","type":"journal-article","created":{"date-parts":[[2003,9,19]],"date-time":"2003-09-19T10:19:32Z","timestamp":1063966772000},"page":"551-582","source":"Crossref","is-referenced-by-count":22,"title":["A Generic Approach to the Static Analysis  of Concurrent Programs with Procedures"],"prefix":"10.1142","volume":"14","author":[{"given":"Ahmed","family":"Bouajjani","sequence":"first","affiliation":[{"name":"LIAFA, University of Paris 7, 2 place Jussieu, 75251 Paris cedex 5, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Javier","family":"Esparza","sequence":"additional","affiliation":[{"name":"Institute for Formal Methods in Computer Science, University of Stuttgart, Universit\u00e4tstr. 38, 70569 Stuttgart, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tayssir","family":"Touili","sequence":"additional","affiliation":[{"name":"LIAFA, University of Paris 7, 2 place Jussieu, 75251 Paris cedex 5, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf9","volume":"16","author":"Ginsburg S.","journal-title":"Pacific Journal of Mathematics"},{"key":"rf11","volume":"274","author":"Lugiez D.","journal-title":"TCS"},{"key":"rf14","volume":"22","author":"Ramalingam G.","journal-title":"ACM Transactions on Programming Languages and Systems (TOPLAS)"},{"key":"rf18","volume":"26","author":"Taylor R.","journal-title":"Communications of the ACM"},{"key":"rf19","volume":"36","author":"Yahav E.","journal-title":"ACM SIGPLAN Notices"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054103001893","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:37:45Z","timestamp":1565138265000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054103001893"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":5,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2003,8]]}},"alternative-id":["10.1142\/S0129054103001893"],"URL":"https:\/\/doi.org\/10.1142\/s0129054103001893","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}