{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,24]],"date-time":"2026-09-24T07:53:48Z","timestamp":1790236428831,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":46,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540377566","type":"print"},{"value":"9783540377580","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11823230_11","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T13:46:30Z","timestamp":1155822390000},"page":"161-180","source":"Crossref","is-referenced-by-count":7,"title":["Beyond Iteration Vectors: Instancewise Relational Abstract Domains"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Amiranoff","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Albert","family":"Cohen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paul","family":"Feautrier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"11_CR1","volume-title":"Compilers: Principles, Techniques and Tools","author":"A. Aho","year":"1986","unstructured":"Aho, A., Sethi, R., Ullman, J.: Compilers: Principles, Techniques and Tools. Addison-Wesley, Reading (1986)"},{"key":"11_CR2","unstructured":"Amiranoff, P.: An Automata-Theoretic Modelization of Instancewise Program Analysis: Transducers as mappings from Instances to Memory Locations. PhD thesis, CNAM, Paris (December 2004)"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Berstel, J.: Transductions and Context-Free Languages. Teubner, Stuttgart, Germany (1979)","DOI":"10.1007\/978-3-663-09367-1"},{"issue":"4","key":"11_CR4","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. J. of Functional Programming\u00a02(4), 407\u2013423 (1992)","journal-title":"J. of Functional Programming"},{"key":"11_CR5","unstructured":"Cohen, A.: Program Analyse et transformation: from the Polytope Model to Formal Languages. PhD hesis, Universit\u00e9 de Versailles, France (December 1999)"},{"key":"11_CR6","first-page":"332","volume-title":"Parallel Architectures and Compilation Techniques (PACT 1998)","author":"A. Cohen","year":"1998","unstructured":"Cohen, A., Collard, J.-F.: Instancewise reaching definition analysis for recursive programs using context-free transductions. In: Parallel Architectures and Compilation Techniques (PACT 1998), Paris, France, pp. 332\u2013340. IEEE Computer Society, Los Alamitos (1998)"},{"key":"11_CR7","volume-title":"Reasoning About Program Transformations","author":"J.-F. Collard","year":"2002","unstructured":"Collard, J.-F.: Reasoning About Program Transformations. Springer, Heidelberg (2002)"},{"key":"11_CR8","volume-title":"Semantic foundations of programs analysis","author":"P. Cousot","year":"1981","unstructured":"Cousot, P.: Semantic foundations of programs analysis. Prentice-Hall, Englewood Cliffs (1981)"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: 5th ACM Symp. on Principles of Programming Languages, pp. 84\u201396 (January 1978)","DOI":"10.1145\/512760.512770"},{"key":"11_CR10","unstructured":"Creusillet, B.: Array Region Analyses and Applications. PhD thesis, \u00c9cole Nationale Sup\u00e9rieure des Mines de Paris (ENSMP), France (December 1996)"},{"key":"11_CR11","unstructured":"Deutsch, A.: Operational Models of Programming Languages and Representations of Relations on Regular Languages with Application to the Static Determination of Dynamic Aliasing Properties of Data. PhD thesis, \u00c9cole Polytechnique, France (April 1992)"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Deutsch, A.: Interprocedural may-alias analysis for pointers: beyond k-limiting. In: ACM Symp. on Programming Language Design and Implementation (PLDI 1994), Orlando, Florida, pp. 230\u2013241 (June 1994)","DOI":"10.1145\/178243.178263"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Elgot, C.C., Mezei, J.E.: On relations defined by generalized finite automata. IBM J. of Research and Development, 45\u201368 (1965)","DOI":"10.1147\/rd.91.0047"},{"key":"11_CR14","doi-asserted-by":"crossref","DOI":"10.1201\/9781439865699","volume-title":"Word Processing in Groups","author":"D.B.A. Epstein","year":"1992","unstructured":"Epstein, D.B.A., Cannon, J.W., Holt, D.F., Levy, S.V.F., Paterson, M., Thurston, W.: Word Processing in Groups. Jones and Bartlett Publishers, Boston (1992)"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/3-540-49019-1_2","volume-title":"Foundations of Software Science and Computation Structures","author":"J. Esparza","year":"1999","unstructured":"Esparza, J., Knoop, J.: An automata-theoretic approach to interprocedural data-flow analysis. In: Thomas, W. (ed.) FOSSACS 1999. LNCS, vol.\u00a01578, pp. 14\u201330. Springer, Heidelberg (1999)"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Esparza, J., Podelski, A.: Efficient algorithms for pre* and post* on interprocedural parallel flow graphs. In: ACM Symp. on Principles of Programming Languages (PoPL 2000), pp. 1\u201311 (2000)","DOI":"10.1145\/325694.325697"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Feautrier, P.: Array expansion. In: ACM Intl. Conf. on Supercomputing, St. Malo, France, pp. 429\u2013441 (July 1988)","DOI":"10.1145\/55364.55406"},{"issue":"1","key":"11_CR18","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF01407931","volume":"20","author":"P. Feautrier","year":"1991","unstructured":"Feautrier, P.: Dataflow analysis of scalar and array references. Intl. J. of Parallel Programming\u00a020(1), 23\u201353 (1991)","journal-title":"Intl. J. of Parallel Programming"},{"issue":"6","key":"11_CR19","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/BF01379404","volume":"21","author":"P. Feautrier","year":"1992","unstructured":"Feautrier, P.: Some efficient solutions to the affine scheduling problem, part II, multidimensional time. Intl. J. of Parallel Programming\u00a021(6), 389\u2013420 (1992); see also Part I, one dimensional time 21(5), 315\u2013348","journal-title":"Intl. J. of Parallel Programming"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","volume-title":"EuroPar 1998","author":"P. Feautrier","year":"1998","unstructured":"Feautrier, P.: A parallelization framework for recursive tree programs. In: EuroPar 1998, Southampton, UK. LNCS. Springer, Heidelberg (1998)"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Fradet, P., Metayer, D.L.: Shape types. In: ACM Symp. on Principles of Programming Languages (PoPL 1997), Paris, France, pp. 27\u201339 (January 1997)","DOI":"10.1145\/263699.263706"},{"issue":"1","key":"11_CR22","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1145\/200994.201003","volume":"17","author":"M.P. Gerlek","year":"1995","unstructured":"Gerlek, M.P., Stoltz, E., Wolfe, M.J.: Beyond induction variables: detecting and classifying sequences using a demand-driven ssa form. ACM Trans. on Programming Languages and Systems\u00a017(1), 85\u2013122 (1995)","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Ghiya, R., Hendren, L.J.: Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C. In: ACM Symp. on Principles of Programming Languages (PoPL 1996), St. Petersburg Beach, Florida, pp. 1\u201315 (January 1996)","DOI":"10.1145\/237721.237724"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Giavitto, J.-L., Michel, O., Sansonnet, J.-P.: Group-based fields. In: Proc. of the Parallel Symbolic Languages and Systems (October 1995); see also Design and Implementation of 81\/2, a Declarative Data-Parallel Language, RR 1012, Laboratoire de Recherche en Informatique, Universit\u00e9 Paris Sud 11, France (1995)","DOI":"10.1007\/BFb0023063"},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Hampapuram, H., Yang, Y., Das, M.: Symbolic path simulation in path-sensitive dataflow analysis. In: Proc. of the ACM Workshop on Program Analysis for Software Tools and Engineering (PASTE 2005), Lisbon, Portugal, pp. 52\u201358 (September 2005)","DOI":"10.1145\/1108792.1108808"},{"issue":"3","key":"11_CR26","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/BF01808954","volume":"2","author":"W.L. Harrison","year":"1989","unstructured":"Harrison, W.L.: The interprocedural analysis and automatic parallelisation of Scheme programs. Lisp and Symbolic Computation\u00a02(3), 176\u2013396 (1989)","journal-title":"Lisp and Symbolic Computation"},{"key":"11_CR27","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1145\/143095.143138","volume-title":"ACM Symp. on Programming Language Design and Implementation (PLDI 1992)","author":"L.J. Hendren","year":"1992","unstructured":"Hendren, L.J., Hummel, J., Nicolau, A.: Abstractions for recursive pointer data structures: improving the analysis and transformation of imperative programs. In: ACM Symp. on Programming Language Design and Implementation (PLDI 1992), pp. 249\u2013260. San Francisco, Calfifornia (1992)"},{"key":"11_CR28","doi-asserted-by":"crossref","unstructured":"Klarlund, N., Schwartzbach, M.I.: Graph types. In: ACM Symp. on Principles of Programming Languages (PoPL 1993), Charleston, South Carolina, pp. 196\u2013205 (January 1993)","DOI":"10.1145\/158511.158628"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Maydan, D.E., Amarasinghe, S.P., Lam, M.S.: Array dataflow analysis and its use in array privatization. In: 20th ACM Symp. on Principles of Programming Languages, Charleston, South Carolina, pp. 2\u201315 (January 1993)","DOI":"10.1145\/158511.158515"},{"key":"11_CR30","doi-asserted-by":"crossref","unstructured":"Might, M., Shivers, O.: Environment analysis via Delta CFA. In: ACM Symp. on Principles of Programming Languages (PoPL 2006), Charleston, South Carolina, pp. 127\u2013140 (January 2006)","DOI":"10.1145\/1111037.1111049"},{"key":"11_CR31","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03811-6","volume-title":"Principles of Program Analysis","author":"F. Nielson","year":"1999","unstructured":"Nielson, F., Nielson, H., Hankin, C.: Principles of Program Analysis. Springer, Heidelberg (1999)"},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"Okasaki, C.: Functional data structures. Advanced Functional Programming, 131\u2013158 (1996)","DOI":"10.1007\/3-540-61628-4_5"},{"issue":"1\u20132","key":"11_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(98)00179-0","volume":"225","author":"M. Pelletier","year":"1999","unstructured":"Pelletier, M., Sakarovitch, J.: On the representation of finite deterministic 2-tape automata. Theoretical Computer Science\u00a0225(1\u20132), 1\u201363 (1999)","journal-title":"Theoretical Computer Science"},{"key":"11_CR34","series-title":"Lecture Notes in Computer Science","volume-title":"The Data Parallel Programming Model","year":"1996","unstructured":"Perrin, G.-R., Darte, A. (eds.): The Data Parallel Programming Model. LNCS, vol.\u00a01132. Springer, Heidelberg (1996)"},{"key":"11_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/11587514_15","volume-title":"High Performance Embedded Architectures and Compilers","author":"S. Pop","year":"2005","unstructured":"Pop, S., Cohen, A., Silber, G.-A.: Induction variable analysis with delayed abstractions. In: Conte, T., Navarro, N., Hwu, W.-m.W., Valero, M., Ungerer, T. (eds.) HiPEAC 2005. LNCS, vol.\u00a03793, pp. 218\u2013232. Springer, Heidelberg (2005)"},{"issue":"8","key":"11_CR36","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/135226.135233","volume":"35","author":"W. Pugh","year":"1992","unstructured":"Pugh, W.: A practical algorithm for exact array dependence analysis. Communications of the ACM\u00a035(8), 27\u201347 (1992)","journal-title":"Communications of the ACM"},{"key":"11_CR37","doi-asserted-by":"crossref","unstructured":"Reps, T., Horwitz, S., Sagiv, M.: Precise interprocedural dataflow analysis via graph reachability. In: ACM Symp. on Principles of Programming Languages (PoPL 1995), San Francisco, CA (January 1995)","DOI":"10.1145\/199448.199462"},{"key":"11_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/3-540-44898-5_11","volume-title":"Static Analysis","author":"T.W. Reps","year":"2003","unstructured":"Reps, T.W., Schwoon, S., Jha, S.: Weighted pushdown systems and their application to interprocedural dataflow analysis. In: Cousot, R. (ed.) SAS 2003. LNCS, vol.\u00a02694, pp. 189\u2013213. Springer, Heidelberg (2003)"},{"key":"11_CR39","series-title":"Word Language Grammar","volume-title":"Handbook of Formal Languages","year":"1997","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Word Language Grammar, vol.\u00a01. Springer, Heidelberg (1997)"},{"key":"11_CR40","series-title":"Beyond Words","volume-title":"Handbook of Formal Languages","year":"1997","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Beyond Words, vol.\u00a03. Springer, Heidelberg (1997)"},{"key":"11_CR41","doi-asserted-by":"crossref","unstructured":"Sagiv, S., Reps, T.W., Wilhelm, R.: Parametric shape analysis via 3-valued logic. In: ACM Symp. on Principles of Programming Languages (PoPL 1999), San Antonio, Texas, pp. 105\u2013118 (January 1999)","DOI":"10.1145\/292540.292552"},{"key":"11_CR42","volume-title":"Two Approaches to Interprocedural Data Flow Analysis","author":"M. Sharir","year":"1981","unstructured":"Sharir, M., Pnueli, A.: Program Flow Analysis: Theory and Applications. In: Two Approaches to Interprocedural Data Flow Analysis. Prentice Hall, Englewood Cliffs (1981)"},{"key":"11_CR43","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)"},{"key":"11_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-540-27864-1_13","volume-title":"Static Analysis","author":"A. Venet","year":"2004","unstructured":"Venet, A.: A scalable nonuniform pointer analysis for embedded programs. In: Giacobazzi, R. (ed.) SAS 2004. LNCS, vol.\u00a03148, pp. 149\u2013164. Springer, Heidelberg (2004)"},{"key":"11_CR45","volume-title":"High Performance Compilers for Parallel Computing","author":"M.J. Wolfe","year":"1996","unstructured":"Wolfe, M.J.: High Performance Compilers for Parallel Computing. Addison-Wesley, Reading (1996)"},{"key":"11_CR46","doi-asserted-by":"crossref","unstructured":"Wu, P., Cohen, A., Padua, D., Hoeflinger, J.: Monotonic evolution: an alternative to induction variable substitution for dependence analysis. In: ACM Intl. Conf. on Supercomputing (ICS 2001), Sorrento, Italy (June 2001)","DOI":"10.1145\/377792.377809"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11823230_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:17:01Z","timestamp":1605644221000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11823230_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540377566","9783540377580"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/11823230_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}