{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:06:39Z","timestamp":1742378799475},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540610533"},{"type":"electronic","value":"9783540499398"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61053-7_56","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:13:43Z","timestamp":1330290823000},"page":"106-118","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Non-monotone fixpoint iterations to resolve second order effects"],"prefix":"10.1007","author":[{"given":"Alfons","family":"Geser","sequence":"first","affiliation":[]},{"given":"Jens","family":"Knoop","sequence":"additional","affiliation":[]},{"given":"Gerald","family":"L\u00fcttgen","sequence":"additional","affiliation":[]},{"given":"Oliver","family":"R\u00fcthing","sequence":"additional","affiliation":[]},{"given":"Bernhard","family":"Steffen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"issue":"2","key":"8_CR1","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1145\/322063.322067","volume":"25","author":"G. Baudet","year":"1978","unstructured":"G\u00e9rard Baudet. Asynchronous iterative methods for multiprocessors. Journal of the ACM, 25(2):226\u2013244, April 1978.","journal-title":"Journal of the ACM"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conf. Record of the 4th ACM Symp. on Principles of Programming Languages, pages 238\u2013252, Los Angeles, CA, 1977.","DOI":"10.1145\/512950.512973"},{"issue":"1","key":"8_CR3","doi-asserted-by":"crossref","first-page":"43","DOI":"10.2140\/pjm.1979.82.43","volume":"82","author":"P. Cousot","year":"1979","unstructured":"P. Cousot and R. Cousot. Constructive versions of Tarski's fixed point theorems. Pacific Journal of Mathematics, 82(1):43\u201387, 1979.","journal-title":"Pacific Journal of Mathematics"},{"key":"8_CR4","volume-title":"Technical Report 88","author":"P. Cousot","year":"1977","unstructured":"P. Cousot. Asynchronous iterative methods for solving a fixed point system of monotone equations in a complete lattice. Technical Report 88, Laboratoire d'Informatique, U.S.M.G., Grenoble, France, September 1977."},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"D. M. Dhamdhere, B. K. Rosen, and F. K. Zadeck. How to analyze large programs efficiently and informatively. In Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation'92, volume 27,7 of ACM SIGPLAN Notices, pages 212\u2013223, San Francisco, CA, June 1992.","DOI":"10.1145\/143103.143135"},{"key":"8_CR6","volume-title":"Flow Analysis of Computer Programs","author":"M. S. Hecht","year":"1977","unstructured":"M. S. Hecht. Flow Analysis of Computer Programs. Elsevier, North-Holland, 1977."},{"key":"8_CR7","first-page":"329","volume-title":"Lecture Notes in Computer Science 864","author":"N. J\u00f8rgensen","year":"1994","unstructured":"N. J\u00f8rgensen. Finding fixpoints in finite function spaces using needeness analysis and chaotic iteration. In First International Static Analysis Symposium(SAS'94), Lecture Notes in Computer Science 864, pages 329\u2013345, Namur, Belgium, 1994. Springer-Verlag."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"J. Knoop, O. R\u00fcthing, and B. Steffen. Lazy code motion. In Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation'92, volume 27,7 of ACM SIGPLAN Notices, pages 224\u2013234, San Francisco, CA, June 1992.","DOI":"10.1145\/143103.143136"},{"issue":"4","key":"8_CR9","doi-asserted-by":"crossref","first-page":"1117","DOI":"10.1145\/183432.183443","volume":"16","author":"J. Knoop","year":"1994","unstructured":"J. Knoop, O. R\u00fcthing, and B. Steffen. Optimal code motion: Theory and practice. ACM Transactions on Programming Languages and Systems, 16(4):1117\u20131155, 1994.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"J. Knoop, O. R\u00fcthing, and B. Steffen. Partial dead code elimination. In Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation'94, volume 29,6 of ACM SIGPLAN Notices, pages 147\u2013158, Orlando, FL, June 1994.","DOI":"10.1145\/773473.178256"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"J. Knoop, O. R\u00fcthing, and B. Steffen. The power of assignment motion. In Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation'95, volume 30,6 of ACM SIGPLAN Notices, pages 233\u2013245, La Jolla, CA, June 1995.","DOI":"10.1145\/223428.207150"},{"key":"8_CR12","first-page":"309","volume":"7","author":"J. B. Kam","year":"1977","unstructured":"J. B. Kam and J. D. Ullman. Monotone data flow analysis frameworks. Acta Informatica, 7:309\u2013317, 1977.","journal-title":"Acta Informatica"},{"issue":"3","key":"8_CR13","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1016\/0020-0190(82)90065-5","volume":"14","author":"J.-L. Lassez","year":"1982","unstructured":"J.-L. Lassez, V.L. Nguyen, and E.A. Sonnenberg. Fixed point theorems and semantics: A folk tale. Information Processing Letters, 14(3):112\u2013116, 1982.","journal-title":"Information Processing Letters"},{"key":"8_CR14","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/BF01178576","volume":"30","author":"K. Marriot","year":"1993","unstructured":"K. Marriot. Frameworks for abstract interpretation. Acta Informatica, 30:103\u2013129, 1993.","journal-title":"Acta Informatica"},{"volume-title":"Program Flow Analysis: Theory and Applications","year":"1981","key":"8_CR15","unstructured":"S. S. Muchnick and N. D. Jones, editors. Program Flow Analysis: Theory and Applications. Prentice Hall, Englewood Clifls, NJ, 1981."},{"issue":"2","key":"8_CR16","doi-asserted-by":"crossref","first-page":"223","DOI":"10.2307\/1968867","volume":"43","author":"M.H.A. Newman","year":"1942","unstructured":"M.H.A. Newman. On theories with a combinatorial definition of equivalence. Annals of Math., 43, 2:223\u2013243, 1942.","journal-title":"Annals of Math."},{"key":"8_CR17","volume-title":"Technical Report 58","author":"F. Robert","year":"1976","unstructured":"F. Robert. Convergence locale d'it\u00e9rations chaotiques non lin\u00e9aires. Technical Report 58, Laboratoire d'Informatique, U.S.M.G., Grenoble, France, December 1976."},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Global value numbers and redundant computations. In Conf. Record of the 15th ACM Symp. on Principles of Programming Languages, pages 12\u201327, San Diego, CA, 1988.","DOI":"10.1145\/73560.73562"},{"key":"8_CR19","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"A. Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics, 5:285\u2013309, 1955.","journal-title":"Pacific Journal of Mathematics"},{"key":"8_CR20","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0167-8191(89)90079-3","volume":"10","author":"A. \u00dcresin","year":"1989","unstructured":"Aydin \u00dcresin and Michel Dubois. Sufficient conditions for the convergence of asynchronous iterations. Parallel Computing, 10:83\u201392, 1989.","journal-title":"Parallel Computing"},{"key":"8_CR21","first-page":"314","volume-title":"Lecture Notes in Computer Science 864","author":"B. Vergauwen","year":"1994","unstructured":"B. Vergauwen, J. Wauman, and J. Lewi. Efficient fixpoint computation. In First International Static Analysis Symposium(SAS'94), Lecture Notes in Computer Science 864, pages 314\u2013328, Namur, Belgium, 1994. Springer-Verlag."},{"key":"8_CR22","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1016\/0167-8191(93)90072-S","volume":"19","author":"J. Wei","year":"1993","unstructured":"Jiawang Wei. Parallel asynchronous iterations of least fixed points. Parallel Computing, 19:887\u2013895, 1993.","journal-title":"Parallel Computing"}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61053-7_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:04:08Z","timestamp":1558267448000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61053-7_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540610533","9783540499398"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-61053-7_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"7 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}