{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:13:32Z","timestamp":1725459212394},"publisher-location":"Berlin\/Heidelberg","reference-count":21,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354057316X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0039704","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T14:17:03Z","timestamp":1138198623000},"page":"128-141","source":"Crossref","is-referenced-by-count":123,"title":["Efficient chaotic iteration strategies with widenings"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois","family":"Bourdoncle","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Alfred V. Aho, Ravi Sethi and Jeffrey D. Ullman: \u201cCompilers \u2014 Principles, Techniques and Tools\u201d, Addison-Wesley Publishing Company (1986)"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Fran\u00e7ois Bourdoncle: \u201cInterprocedural Abstract Interpretation of Block Structured Languages with Nested Procedures, Aliasing and Recursivity\u201d, Proc. of the International Workshop PLILP'90, Lecture Notes in Computer Science 456, Springer-Verlag (1990)","DOI":"10.1007\/BFb0024192"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Fran\u00e7ois Bourdoncle: \u201cAbstract Interpretation By Dynamic Partitioning\u201d, Journal of Functional Programming, Vol. 2, No. 4 (1992)","DOI":"10.1017\/S0956796800000496"},{"key":"9_CR4","unstructured":"Fran\u00e7ois Bourdoncle: \u201cS\u00e9mantiques des langages imp\u00e9ratifs d'ordre sup\u00e9rieur et interpr\u00e9tation abstraite\u201d, Ph.D. dissertation, Ecole Polytechnique (1992)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Fran\u00e7ois Bourdoncle: \u201cAbstract Debugging of Higher-Order Imperative Languages\u201d, Proc. of SIGPLAN '93 Conference on Programming Language Design and Implementation (1993)","DOI":"10.1145\/155090.155095"},{"issue":"Num.3","key":"9_CR6","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/78969.78963","volume":"12","author":"M. Burke","year":"1990","unstructured":"Michael Burke: \u201cAn Interval-Based Approach to Exhaustive and Incremental Interprocedural Data-Flow Analysis\u201d, ACM Transactions on Programming Languages and Systems, Vol. 12, Num. 3 (1990) 341\u2013395","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"9_CR7","unstructured":"Patrick and Radhia Cousot: \u201cAbstract Interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints\u201d, Proc. of the 4th ACM Symp. on POPL (1977) 238\u2013252"},{"key":"9_CR8","unstructured":"Patrick Cousot: \u201cAsynchronous iterative methods for solving a fixpoint system of monotone equations\u201d, Research Report IMAG-RR-88, Universit\u00e9 Scientifique et M\u00e9dicale de Grenoble (1977)"},{"key":"9_CR9","unstructured":"Patrick Cousot and Nicolas Halbwachs: \u201cAutomatic discovery of linear constraints among variables of a program\u201d, Proc. of the 5th ACM Symp. on POPL (1978) 84\u201397"},{"key":"9_CR10","unstructured":"Patrick Cousot: \u201cM\u00e9thodes it\u00e9ratives de construction et d'approximation de points fixes d'op\u00e9rateurs monotones sur un treillis. Analyse s\u00e9mantique de programmes\u201d, Ph.D. dissertation, Universit\u00e9 Scientifique et M\u00e9dicale de Grenoble (1978)"},{"key":"9_CR11","unstructured":"Patrick Cousot: \u201cSemantic foundations of program analysis\u201d, in Muchnick and Jones Eds., Program Flow Analysis, Theory and Applications, Prentice-Hall (1981) 303\u2013343"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Alain Deutsch: \u201cOn determining lifetime and aliasing of dynamically allocated data in higher-order functional specifications\u201d, Proc. of the 17th ACM Symp. on POPL (1990)","DOI":"10.1145\/96709.96725"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Alain Deutsch: \u201cA Storeless Model of Aliasing and its Abstractions using Finite Representations of Right-Regular Equivalence Relations\u201d, Proc. of the IEEE' 92 International Conference on Computer Languages, IEEE Press (1992)","DOI":"10.1109\/ICCL.1992.185463"},{"key":"9_CR14","unstructured":"Michael. R. Garey and David S. Johnson: \u201cComputers and Intractability: A Guide to the Theory of NP-completeness\u201d, W.H. Freeman and Company (1979)"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Philippe Granger: \u201cStatic analysis of arithmetical congruences\u201d, International Journal of Computer Mathematics (1989) 165\u2013190","DOI":"10.1080\/00207168908803778"},{"issue":"Num.3","key":"9_CR16","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1145\/78969.78971","volume":"12","author":"L. G. Jones","year":"1990","unstructured":"Larry G. Jones: \u201cEfficient Evaluation of Circular Attribute Grammars\u201d, ACM Transactions on Programming Languages and Systems, Vol. 12, Num. 3 (1990) 429\u2013462","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"9_CR17","unstructured":"B. Le Charlier, K. Musumbu and P. Van Hentenryck: \u201cA generic abstract interpretation algorithm and its complexity analysis\u201d, in K. Furukawa editors, Proc. of the Eight International Conference on Logic Programming, MIT Press (1991) 64\u201378"},{"key":"9_CR18","volume-title":"Technical Report 92-1","author":"B. Charlier Le","year":"1992","unstructured":"B. Le Charlier and P. Van Hentenryck: \u201cA universal top-down fixpoint algorithm\u201d, Technical Report 92-1, Institute of Computer Science, University of Namur, Belgium (1992)"},{"key":"9_CR19","unstructured":"R.A. O'Keefe: \u201cFinite fixed-point problems\u201d, in J.-L. Lassez editor, Proc. of the Fourth International Conference of Logic Programming, MIT Press (1987) 729\u2013743"},{"key":"9_CR20","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R.E. Tarjan","year":"1972","unstructured":"R.E. Tarjan: \u201cDepth-first search and linear graph algorithms\u201d, SIAM J. Comput., 1 (1972) 146\u2013160","journal-title":"SIAM J. Comput."},{"key":"9_CR21","unstructured":"R.E. Tarjan: \u201cAn Improved Algorithm for Hierarchical Clustering Using Strong Components\u201d, Information Processing Letters 17, Elsevier Science Publishers B.V. (1983) 37\u201341"}],"container-title":["Lecture Notes in Computer Science","Formal Methods in Programming and Their Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0039704.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T22:26:11Z","timestamp":1607552771000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0039704"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354057316X"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/bfb0039704","relation":{},"subject":[]}}