{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:43:55Z","timestamp":1780994635186,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540272311","type":"print"},{"value":"9783540316862","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11513988_46","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:33:28Z","timestamp":1268400808000},"page":"462-475","source":"Crossref","is-referenced-by-count":47,"title":["A Policy Iteration Algorithm for Computing Fixed Points in Static Analysis of Programs"],"prefix":"10.1007","author":[{"given":"A.","family":"Costan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S.","family":"Gaubert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"E.","family":"Goubault","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M.","family":"Martel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S.","family":"Putot","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"4","key":"46_CR1","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1017\/S0956796800000496","volume":"2","author":"F. Bourdoncle","year":"1992","unstructured":"Bourdoncle, F.: Abstract interpretation by dynamic partitioning. Journal of Functional Programming\u00a02(4), 407\u2013435 (1992)","journal-title":"Journal of Functional Programming"},{"key":"46_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/BFb0039704","volume-title":"Formal Methods in Programming and Their Applications","author":"F. Bourdoncle","year":"1993","unstructured":"Bourdoncle, F.: Efficient chaotic iteration strategies with widenings. In: Pottosin, I.V., Bjorner, D., Broy, M. (eds.) FMP&TA 1993. LNCS, vol.\u00a0735, pp. 128\u2013141. Springer, Heidelberg (1993)"},{"key":"46_CR3","unstructured":"Le Charlier, B., Van Hentenryck, P.: A universal top-down fixpoint algorithm. Technical Report CS-92-25, Brown University (May 1992)"},{"key":"46_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/3-540-15975-4_28","volume-title":"Functional Programming Languages and Computer Architecture","author":"C. Clack","year":"1985","unstructured":"Clack, C., Peyton Jones, S.L.: Strictness Analysis \u2014 A Practical Approach. In: Jouannaud, J.-P. (ed.) FPCA 1985. LNCS, vol.\u00a0201, pp. 35\u201349. Springer, Heidelberg (1985)"},{"key":"46_CR5","unstructured":"Cochet-Terrasson, J.: Algorithmes d\u2019it\u00e9ration sur les politiques pour les applications monotones contractantes. Th\u00e8se, \u00c9cole des Mines (December 2001)"},{"issue":"4","key":"46_CR6","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1080\/026811199281967","volume":"14","author":"J. Cochet-Terrasson","year":"1999","unstructured":"Cochet-Terrasson, J., Gaubert, S., Gunawardena, J.: A constructive fixed point theorem for min-max functions. Dynamics and Stability of Systems\u00a014(4), 407\u2013433 (1999)","journal-title":"Dynamics and Stability of Systems"},{"key":"46_CR7","unstructured":"Cochet-Terrasson, J., Gaubert, S., Gunawardena, J.: Policy iteration algorithms for monotone nonexpansive maps. Draft (2001)"},{"key":"46_CR8","unstructured":"Costan, A.: Analyse statique et it\u00e9ration sur les politiques. Technical report, CEA Saclay, report DTSI\/SLA\/03-575\/AC, and Ecole Polytechnique (August 2003)"},{"key":"46_CR9","first-page":"238","volume":"4","author":"P. Cousot","year":"1977","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximations of fixed points. Principles of Programming Languages\u00a04, 238\u2013252 (1977)","journal-title":"Principles of Programming Languages"},{"key":"46_CR10","first-page":"107","volume-title":"JTASPEFL 1991","author":"P. Cousot","year":"1991","unstructured":"Cousot, P., Cousot, R.: Comparison of the Galois connection and widening\/narrowing approaches to abstract interpretation. In: JTASPEFL 1991, October 1991, vol.\u00a074, pp. 107\u2013110. BIGRE, Bordeaux (1991)"},{"key":"46_CR11","doi-asserted-by":"crossref","unstructured":"Damian, D.: Time stamps for fixed-point approximation. ENTCS, vol.\u00a045 (2001)","DOI":"10.1016\/S1571-0661(04)80955-1"},{"key":"46_CR12","unstructured":"Eo, H., Yi, K.: An improved differential fixpoint iteration method for program analysis (November 2002)"},{"key":"46_CR13","doi-asserted-by":"crossref","unstructured":"Fecht, C., Seidl, H.: Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems. pp. 90\u2013104 (1998)","DOI":"10.1007\/BFb0053565"},{"key":"46_CR14","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0764-4442(97)82710-3","volume":"326","author":"S. Gaubert","year":"1998","unstructured":"Gaubert, S., Gunawardena, J.: The duality theorem for min-max functions. C. R. Acad. Sci. Paris, 326, S\u00e9rie I:43\u201348 (1998)","journal-title":"C. R. Acad. Sci. Paris, S\u00e9rie I"},{"key":"46_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/3-540-45927-8_15","volume-title":"Programming Languages and Systems","author":"E. Goubault","year":"2002","unstructured":"Goubault, E., Martel, M., Putot, S.: Asserting the precision of floating-point computations: A simple abstract interpreter. In: Le M\u00e9tayer, D. (ed.) ESOP 2002. LNCS, vol.\u00a02305, pp. 209\u2013212. Springer, Heidelberg (2002)"},{"key":"46_CR16","unstructured":"Granger, P.: Analyse de congruences. PhD thesis, Ecole Polytechnique (1990)"},{"key":"46_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/3-540-53982-4_10","volume-title":"TAPSOFT \u201991. Proceedings of the International Joint Conference on Theory and Practice of Software Development, Brighton, UK, April 8-12, 1991","author":"P. Granger","year":"1991","unstructured":"Granger, P.: Static analysis of linear congruence equalities among variables of a program. In: Abramsky, S. (ed.) CAAP 1991 and TAPSOFT 1991. LNCS, vol.\u00a0493, pp. 169\u2013192. Springer, Heidelberg (1991)"},{"key":"46_CR18","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/BF01440235","volume":"4","author":"J. Gunawardena","year":"1994","unstructured":"Gunawardena, J.: Min-max functions. Discrete Event Dynamic Systems\u00a04, 377\u2013406 (1994)","journal-title":"Discrete Event Dynamic Systems"},{"key":"46_CR19","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0304-3975(02)00235-9","volume":"293","author":"J. Gunawardena","year":"2003","unstructured":"Gunawardena, J.: From max-plus algebra to nonexpansive maps: a nonlinear theory for discrete event systems. Theoretical Computer Science\u00a0293, 141\u2013167 (2003)","journal-title":"Theoretical Computer Science"},{"key":"46_CR20","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1287\/mnsc.12.5.359","volume":"12","author":"A.J. Hoffman","year":"1966","unstructured":"Hoffman, A.J., Karp, R.M.: On nonterminating stochastic games. Management Sci.\u00a012, 359\u2013370 (1966)","journal-title":"Management Sci."},{"key":"46_CR21","volume-title":"Dynamic Programming and Markov Processes","author":"R. Howard","year":"1960","unstructured":"Howard, R.: Dynamic Programming and Markov Processes. Wiley, Chichester (1960)"},{"key":"46_CR22","unstructured":"Hunt, L.S.: Abstract Interpretation of Functional Languages: From Theory to Practice. Ph.D. thesis, Department of Computing, Imperial College, London (1991)"},{"key":"46_CR23","doi-asserted-by":"crossref","unstructured":"Karr, M.: Affine relationships between variables of a program. Acta Informatica\u00a0(6), 133\u2013151 (1976)","DOI":"10.1007\/BF00268497"},{"key":"46_CR24","unstructured":"Kuncak, V., Rustan, K., Leino, M.: On computing the fixpoint of a set of boolean equations. Technical Report MSR-TR-2003-08, Microsoft Research (2003)"},{"key":"46_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/3-540-48294-6_7","volume-title":"Static Analysis","author":"L. Mauborgne","year":"1999","unstructured":"Mauborgne, L.: Binary decision graphs. In: Cortesi, A., Fil\u00e9, G. (eds.) SAS 1999. LNCS, vol.\u00a01694, pp. 101\u2013116. Springer, Heidelberg (1999)"},{"key":"46_CR26","doi-asserted-by":"crossref","unstructured":"Min\u00e9, A.: The octagon abstract domain in analysis, slicing and transformation. pp. 310\u2013319 (October 2001)","DOI":"10.1109\/WCRE.2001.957836"},{"key":"46_CR27","unstructured":"O\u2019Keefe, R.A.: Finite fixed-point problems. In: Lassez, J.-L. (ed.) ICLP 1987, Melbourne, Australia, May 1987, pp. 729\u2013743. MIT Press, Cambridge (1987)"},{"key":"46_CR28","unstructured":"Halbwachs, P.N.: Discovery of linear restraints among variables of a program"},{"key":"46_CR29","series-title":"Wiley Series in Probability and Mathematical Statistics: Applied Probability and Statistics","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316887","volume-title":"Markov decision processes: discrete stochastic dynamic programming","author":"M.L. Puterman","year":"1994","unstructured":"Puterman, M.L.: Markov decision processes: discrete stochastic dynamic programming. Wiley Series in Probability and Mathematical Statistics: Applied Probability and Statistics. John Wiley & Sons Inc., New York (1994)"},{"key":"46_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24738-8_18","volume-title":"Numerical Software with Result Verification","author":"S. Putot","year":"2004","unstructured":"Putot, S., Goubault, E., Martel, M.: Static analysis-based validation of floating-point computations. In: Alt, R., Frommer, A., Kearfott, R.B., Luther, W. (eds.) Dagstuhl Seminar 2003. LNCS, vol.\u00a02991. Springer, Heidelberg (2004)"},{"key":"46_CR31","first-page":"467","volume-title":"International Conference on Computer Design (ICCD 1999)","author":"K. Ravi","year":"1999","unstructured":"Ravi, K., Somenzi, F.: Efficient fixpoint computation for invariant checking. In: International Conference on Computer Design (ICCD 1999), Washington, Brussels, Tokyo, October 1999, pp. 467\u2013475. IEEE, Los Alamitos (1999)"},{"key":"46_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-45789-5_6","volume-title":"Static Analysis","author":"A. Venet","year":"2002","unstructured":"Venet, A.: Nonuniform alias analysis of recursive data structures and arrays. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol.\u00a02477, pp. 36\u201351. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11513988_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T12:06:29Z","timestamp":1739966789000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11513988_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540272311","9783540316862"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/11513988_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}