Beyond Iteration Vectors: Instancewise Relational Abstract Domains-Reference-Cited by-同舟云学术

Beyond Iteration Vectors: Instancewise Relational Abstract Domains

Published:2006 Issue: Volume: Page:161-180
ISSN:0302-9743
Container-title:Static Analysis
language:
Short-container-title:

Author:

Amiranoff Pierre,Cohen Albert,Feautrier Paul

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11823230_11.pdf

Reference46 articles.

1. Aho, A., Sethi, R., Ullman, J.: Compilers: Principles, Techniques and Tools. Addison-Wesley, Reading (1986)

2. Amiranoff, P.: An Automata-Theoretic Modelization of Instancewise Program Analysis: Transducers as mappings from Instances to Memory Locations. PhD thesis, CNAM, Paris (December 2004)

3. Berstel, J.: Transductions and Context-Free Languages. Teubner, Stuttgart, Germany (1979)

4. Bourdoncle, F.: Abstract interpretation by dynamic partitioning. J. of Functional Programming 2(4), 407–423 (1992)

5. Cohen, A.: Program Analyse et transformation: from the Polytope Model to Formal Languages. PhD hesis, Université de Versailles, France (December 1999)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. UniRec: a unimodular-like framework for nested recursions and loops;Proceedings of the ACM on Programming Languages;2022-10-31

2. Composable, sound transformations of nested recursion and loops;Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation;2019-06-08

3. TreeFuser: a framework for analyzing and fusing general recursive tree traversals;Proceedings of the ACM on Programming Languages;2017-10-12

4. Locality Transformations for Nested Recursive Iteration Spaces;ACM SIGOPS Operating Systems Review;2017-04-04

5. Efficiency, Precision, Simplicity, and Generality in Interprocedural Data Flow Analysis: Resurrecting the Classical Call Strings Method;Lecture Notes in Computer Science