{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:25:06Z","timestamp":1725564306869},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540205364"},{"type":"electronic","value":"9783540400189"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-40018-9_11","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:03:20Z","timestamp":1283727800000},"page":"159-175","source":"Crossref","is-referenced-by-count":0,"title":["A Differential Fixpoint Evaluation Framework for Non-distributive Systems"],"prefix":"10.1007","author":[{"given":"Joonseon","family":"Ahn","sequence":"first","affiliation":[]},{"given":"Yong Jin","family":"Kwon","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Fong, C.A., Ullman, J.D.: Induction variables in very high-level languages. In: 6th ACM Symp. on Principles of Programming Languages, pp. 104\u2013112 (1976)","DOI":"10.1145\/800168.811544"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of program by construction of approximation of fixpoints. In: 4th ACM Symp. on Principles of Programming Languages, pp. 238\u2013252 (1977)","DOI":"10.1145\/512950.512973"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: 6th ACM Symp. on Principles of Programming Languages, pp. 269\u2013 282 (1979)","DOI":"10.1145\/567752.567778"},{"issue":"3","key":"11_CR4","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1145\/357172.357177","volume":"4","author":"R. Paige","year":"1982","unstructured":"Paige, R., Koenig, S.: Finite differencing of computable expressions. ACM Trans. on Programming Languages and Systems\u00a04(3), 402\u2013454 (1982)","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Jones, N., Mycroft, A.: Data flow analysis of applicative programs using minimal function graphs. In: 13th ACM Symp. on Principles of Programming Languages, pp. 296\u2013306 (1986)","DOI":"10.1145\/512644.512672"},{"issue":"3","key":"11_CR6","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1145\/27632.27649","volume":"18","author":"B.G. Ryder","year":"1986","unstructured":"Ryder, B.G., Paull, M.C.: Elimination algorithms for data flow analysis. ACM Computing Surveys\u00a018(3), 277\u2013316 (1986)","journal-title":"ACM Computing Surveys"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Bancilhon, F., Ramakrishnan, R.: An amateur\u2019s introduction to recursive query processing strategies. In: ACM SIGMOD Conference on Management of Data, pp. 16\u201352 (1986)","DOI":"10.1145\/16856.16859"},{"key":"11_CR8","unstructured":"Abramsky, S., Hankin, C. (eds.): Abstract Interpretation of Declarative Languages. Computers and Their Applications, Ellis Horwood (1987)"},{"key":"11_CR9","volume-title":"Compilers, principles, techniques, and tools","author":"A.V. Aho","year":"1988","unstructured":"Aho, A.V., Sethi, R., Ullman, J.D.: Compilers, principles, techniques, and tools. Addison Wesley, Reading (1988)"},{"key":"11_CR10","volume-title":"Languages and Compilers for Parallel Computing","author":"W. Ludwell Harrison III","year":"1992","unstructured":"Ludwell Harrison III, W., Ammarguellat, Z.: A program\u2019s eye view of MIPRAC. In: Gelernter, D., Nicolau, A., Padua, D. (eds.) Languages and Compilers for Parallel Computing, MIT Press, Cambridge (1992)"},{"key":"11_CR11","unstructured":"Yi, K.: Automatic Generation and Management of Program Analyses, Ph.D. Thesis, CSRD, University of Illinois at Urbana-Champaign (1993)"},{"issue":"1","key":"11_CR12","first-page":"31","volume":"3","author":"L.-l. Chen","year":"1995","unstructured":"Chen, L.-l., Harrison, L., Yi, K.: Efficient computation of fixpoints that arise in complex program analysis. Journal of Programming Languages\u00a03(1), 31\u201368 (1995)","journal-title":"Journal of Programming Languages"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/BFb0053565","volume-title":"Programming Languages and Systems","author":"C. Fecht","year":"1998","unstructured":"Fecht, C., Seidl, H.: Propagating differences: an efficient new fixpoint algorithm for distributive constraint systems. In: Hankin, C. (ed.) ESOP 1998. LNCS, vol.\u00a01381, pp. 90\u2013104. Springer, Heidelberg (1998)"},{"issue":"2","key":"11_CR14","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0167-6423(99)00009-X","volume":"35","author":"C. Fecht","year":"1999","unstructured":"Fecht, C., Seidl, H.: A faster solver for general systems of equations. Science of Computer Programming\u00a035(2), 137\u2013161 (1999)","journal-title":"Science of Computer Programming"},{"issue":"4","key":"11_CR15","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1023\/A:1026547031739","volume":"13","author":"Y.A. Liu","year":"2000","unstructured":"Liu, Y.A.: Efficiency by incrementalization: an introduction. Higher-Order and Symbolic Computation\u00a013(4), 289\u2013313 (2000)","journal-title":"Higher-Order and Symbolic Computation"},{"key":"11_CR16","unstructured":"Yi, K.: Yet another ensemble of abstract interpreter, higher-order dataflow equations, and model checking, Technical Memorandum ROPAS-2001-10, Research On Program Analysis System, KAIST (2001)"},{"key":"11_CR17","unstructured":"Ahn, J.: A Differential Evaluation of Fixpoint Iterations. In: Proc. of The Second Asian Workshop on Programming Language and Systems, Taejon, pp. 171\u2013182 (2001)"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-47813-2_10","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"A. Murawski","year":"2002","unstructured":"Murawski, A., Yi, K.: Static Monotonicity Analysis for Lambdadefinable Functions over Lattices. In: Cortesi, A. (ed.) VMCAI 2002. LNCS, vol.\u00a02294, pp. 139\u2013153. Springer, Heidelberg (2002)"},{"key":"11_CR19","unstructured":"Eo, H., Yi, K.: An Improved Differential Fixpoint Iteration Method for Program Analysis. In: Proc. of The Third Asian Workshop on Programming Language and Systems, Shanghai, China (2002)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-40018-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:40:34Z","timestamp":1558302034000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-40018-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540205364","9783540400189"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-40018-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}