{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:05:24Z","timestamp":1743138324289,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642214608"},{"type":"electronic","value":"9783642214615"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21461-5_9","type":"book-chapter","created":{"date-parts":[[2011,6,10]],"date-time":"2011-06-10T09:25:36Z","timestamp":1307697936000},"page":"138-152","source":"Crossref","is-referenced-by-count":2,"title":["Galois Connections for Flow Algebras"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Filipiuk","sequence":"first","affiliation":[]},{"given":"Micha\u0142","family":"Terepeta","sequence":"additional","affiliation":[]},{"given":"Hanne Riis","family":"Nielson","sequence":"additional","affiliation":[]},{"given":"Flemming","family":"Nielson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","first-page":"1009","volume-title":"Compilers: principles, techniques, and tools","author":"A.V. Aho","year":"2007","unstructured":"Aho, A.V., Lam, M.S., Sethi, R., Ullman, J.D.: Compilers: principles, techniques, and tools, 2nd edn., p. 1009. Pearson\/Addison Wesley, Boston, MA, USA (2007)","edition":"2"},{"key":"9_CR2","volume-title":"Principles of Model Checking (Representation and Mind Series)","author":"C. Baier","year":"2008","unstructured":"Baier, C., Katoen, J.P.: Principles of Model Checking (Representation and Mind Series). The MIT Press, Cambridge (2008)"},{"issue":"4","key":"9_CR3","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1142\/S0129054103001893","volume":"14","author":"A. Bouajjani","year":"2003","unstructured":"Bouajjani, A., Esparza, J., Touili, T.: A generic approach to the static analysis of concurrent programs with procedures. Int. J. Found. Comput. Sci.\u00a014(4), 551 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"3","key":"9_CR4","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1145\/136035.136043","volume":"24","author":"R.E. Bryant","year":"1992","unstructured":"Bryant, R.E.: Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Comput. Surv.\u00a024(3), 293\u2013318 (1992)","journal-title":"ACM Comput. Surv."},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL, pp. 238\u2013252 (1977)","DOI":"10.1145\/512950.512973"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: POPL, pp. 269\u2013282 (1979)","DOI":"10.1145\/567752.567778"},{"key":"9_CR7","series-title":"Monographs in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-642-01492-5_1","volume-title":"Handbook of Weighted Automata","author":"M. Droste","year":"2009","unstructured":"Droste, M., Kuich, W.: Semirings and formal power series. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata. Monographs in Theoretical Computer Science. An EATCS Series, pp. 3\u201328. Springer, Heidelberg (2009)"},{"issue":"2","key":"9_CR8","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.entcs.2010.09.015","volume":"267","author":"P. Filipiuk","year":"2010","unstructured":"Filipiuk, P., Nielson, H.R., Nielson, F.: Explicit versus symbolic algorithms for solving ALFP constraints. Electr. Notes Theor. Comput. Sci.\u00a0267(2), 15\u201328 (2010)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BF00290339","volume":"7","author":"J.B. Kam","year":"1977","unstructured":"Kam, J.B., Ullman, J.D.: Monotone data flow analysis frameworks. Acta Inf.\u00a07, 305\u2013317 (1977)","journal-title":"Acta Inf."},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Kildall, G.A.: A unified approach to global program optimization. In: POPL, pp. 194\u2013206 (1973)","DOI":"10.1145\/512927.512945"},{"issue":"8","key":"9_CR11","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1145\/361082.361093","volume":"17","author":"L. Lamport","year":"1974","unstructured":"Lamport, L.: A new solution of Dijkstra\u2019s concurrent programming problem. Commun. ACM\u00a017(8), 453\u2013455 (1974)","journal-title":"Commun. ACM"},{"key":"9_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03811-6","volume-title":"Principles of Program Analysis","author":"F. Nielson","year":"1999","unstructured":"Nielson, F., Nielson, H.R., Hankin, C.: Principles of Program Analysis. Springer-Verlag New York, Inc., Secaucus (1999)"},{"issue":"4","key":"9_CR13","first-page":"335","volume":"9","author":"F. Nielson","year":"2002","unstructured":"Nielson, F., Seidl, H., Nielson, H.R.: A succinct solver for ALFP. Nord. J. Comput.\u00a09(4), 335\u2013372 (2002)","journal-title":"Nord. J. Comput."},{"issue":"1-2","key":"9_CR14","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1016\/j.scico.2005.02.009","volume":"58","author":"T.W. Reps","year":"2005","unstructured":"Reps, T.W., Schwoon, S., Jha, S., Melski, D.: Weighted pushdown systems and their application to interprocedural dataflow analysis. Sci. Comput. Program.\u00a058(1-2), 206\u2013263 (2005)","journal-title":"Sci. Comput. Program."},{"issue":"1","key":"9_CR15","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1137\/0209015","volume":"9","author":"B.K. Rosen","year":"1980","unstructured":"Rosen, B.K.: Monoids for rapid data flow analysis. SIAM J. Comput.\u00a09(1), 159\u2013196 (1980)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21461-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T11:45:40Z","timestamp":1553773540000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21461-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642214608","9783642214615"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21461-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}