{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:41:26Z","timestamp":1725540086799},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642046384"},{"type":"electronic","value":"9783642046391"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04639-1_4","type":"book-chapter","created":{"date-parts":[[2009,11,3]],"date-time":"2009-11-03T13:37:25Z","timestamp":1257255445000},"page":"44-58","source":"Crossref","is-referenced-by-count":2,"title":["Visibly Pushdown Kleene Algebra and Its Use in Interprocedural Analysis of (Mutually) Recursive Programs"],"prefix":"10.1007","author":[{"given":"Claude","family":"Bolduc","sequence":"first","affiliation":[]},{"given":"B\u00e9chir","family":"Ktari","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/1007352.1007390","volume-title":"STOC 2004: Proc. of the 36th ACM symp. on Theory of computing","author":"R. Alur","year":"2004","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: STOC 2004: Proc. of the 36th ACM symp. on Theory of computing, pp. 202\u2013211. ACM, New York (2004)"},{"key":"4_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-78034-9","volume-title":"Iteration theories: the equational logic of iterative processes","author":"S.L. Bloom","year":"1993","unstructured":"Bloom, S.L., \u00c9sik, Z.: Iteration theories: the equational logic of iterative processes. Springer, New York (1993)"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/11734673_5","volume-title":"Relational Methods in Computer Science","author":"C. Bolduc","year":"2006","unstructured":"Bolduc, C., Desharnais, J.: Static analysis of programs using omega algebra with tests. In: MacCaull, W., Winter, M., D\u00fcntsch, I. (eds.) RelMiCS 2005. LNCS, vol.\u00a03929, pp. 60\u201372. Springer, Heidelberg (2006)"},{"key":"4_CR4","unstructured":"Bolduc, C., Ktari, B.: Visibly pushdown Kleene algebra. Technical Report DIUL-RR-0901, Laval university, QC, Canada (2009)"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/3-540-63141-0_10","volume-title":"CONCUR\u201997: Concurrency Theory","author":"A. Bouajjani","year":"1997","unstructured":"Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: Application to model-checking. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol.\u00a01243, pp. 135\u2013150. Springer, Heidelberg (1997)"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-540-73370-6_20","volume-title":"Model Checking Software","author":"S. Chaudhuri","year":"2007","unstructured":"Chaudhuri, S., Alur, R.: Instrumenting C programs with nested word monitors. In: Bo\u0161na\u010dki, D., Edelkamp, S. (eds.) SPIN 2007. LNCS, vol.\u00a04595, pp. 279\u2013283. Springer, Heidelberg (2007)"},{"issue":"2","key":"4_CR7","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1006\/inco.1994.1037","volume":"110","author":"D. Kozen","year":"1994","unstructured":"Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation\u00a0110(2), 366\u2013390 (1994)","journal-title":"Information and Computation"},{"issue":"3","key":"4_CR8","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/256167.256195","volume":"19","author":"D. Kozen","year":"1997","unstructured":"Kozen, D.: Kleene algebra with tests. Transactions on Programming Languages and Systems\u00a019(3), 427\u2013443 (1997)","journal-title":"Transactions on Programming Languages and Systems"},{"key":"4_CR9","unstructured":"Kozen, D.: Kleene algebras with tests and the static analysis of programs. Technical Report TR2003-1915, Cornell University, NY, USA (November 2003)"},{"issue":"2","key":"4_CR10","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.jlap.2005.04.004","volume":"66","author":"H. Lei\u00df","year":"2006","unstructured":"Lei\u00df, H.: Kleene modules and linear languages. Journal of Logic and Algebraic Programming\u00a066(2), 185\u2013194 (2006)","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/BFb0023771","volume-title":"Computer Science Logic","author":"H. Lei\u00df","year":"1992","unstructured":"Lei\u00df, H.: Towards Kleene algebra with recursion. In: Kleine B\u00fcning, H., J\u00e4ger, G., B\u00f6rger, E., Richter, M.M. (eds.) CSL 1991. LNCS, vol.\u00a0626, pp. 242\u2013256. Springer, Heidelberg (1992)"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.jlap.2006.11.003","volume":"73","author":"C. L\u00f6ding","year":"2007","unstructured":"L\u00f6ding, C., Lutz, C., Serre, O.: Propositional dynamic logic with recursive programs. Journal of Logic and Algebraic Programming\u00a073, 51\u201369 (2007)","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/11734673_15","volume-title":"Relational Methods in Computer Science","author":"V. Mathieu","year":"2006","unstructured":"Mathieu, V., Desharnais, J.: Verification of pushdown systems using omega algebra with domain. In: MacCaull, W., Winter, M., D\u00fcntsch, I. (eds.) RelMiCS 2005. LNCS, vol.\u00a03929, pp. 188\u2013199. Springer, Heidelberg (2006)"},{"key":"4_CR14","unstructured":"Schwoon, S.: Model-Checking Pushdown Systems. PhD thesis, Technische Universit\u00e4t M\u00fcnchen (2002)"}],"container-title":["Lecture Notes in Computer Science","Relations and Kleene Algebra in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04639-1_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:09:36Z","timestamp":1619780976000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04639-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642046384","9783642046391"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04639-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}