A control-flow normalization algorithm and its complexity, IEEE Transactions on Software Engineering, vol.18, issue.3, pp.237-251, 1992. ,
DOI : 10.1109/32.126773
Modern Compiler Implementation, 1998. ,
DOI : 10.1017/cbo9781139174930
SSA is functional programming, ACM SIGPLAN Notices, vol.33, issue.4, pp.17-20, 1998. ,
DOI : 10.1145/278283.278285
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.3282
The Program Dependence Web: A Representation Supporting Control-, Data-, and Demand-Driven Interpretation of Imperative Languages, Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pp.257-271, 1990. ,
Algorithms for computing the static single assignment form, Journal of the ACM, vol.50, issue.3, pp.375-425, 2003. ,
DOI : 10.1145/765568.765573
Predicated static single assignment, 1999 International Conference on Parallel Architectures and Compilation Techniques (Cat. No.PR00425), pp.245-255, 1999. ,
DOI : 10.1109/PACT.1999.807561
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.7756
The Semantics of Program Dependence, Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pp.13-27, 1989. ,
Abstract interpretation, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '77, pp.238-252, 1977. ,
DOI : 10.1145/512950.512973
URL : https://hal.archives-ouvertes.fr/inria-00528590
Systematic design of program analysis frameworks, Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '79, pp.269-282, 1979. ,
DOI : 10.1145/567752.567778
An efficient method of computing static single assignment form, Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '89, pp.25-35, 1989. ,
DOI : 10.1145/75277.75280
Efficiently computing static single assignment form and the control dependence graph, ACM Transactions on Programming Languages and Systems, vol.13, issue.4, pp.451-490, 1991. ,
DOI : 10.1145/115372.115320
Utilisation de la sémantique dénotationnelle pour l'´ etude d'interprétations non-standard, 1978. ,
Enable unrolling/peeling/unswitching of arbitrary loops. GCC Patch Mailing List: http://gcc.gnu.org/ml/ gcc-patches, 2004. ,
Taming control flow: a structured approach to eliminating goto statements, Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94), pp.229-240, 1994. ,
DOI : 10.1109/ICCL.1994.288377
Dataflow analysis of array and scalar references, International Journal of Parallel Programming, vol.24, issue.4, pp.23-53, 1991. ,
DOI : 10.1007/BF01407931
The program dependence graph and its use in optimization, ACM Transactions on Programming Languages and Systems, vol.9, issue.3, pp.319-349, 1987. ,
DOI : 10.1145/24039.24041
An ASM Semantics for SSA Intermediate Representations, Proceedings of the International Workshop on Abstract State Machines (ASM), 2004. ,
DOI : 10.1007/978-3-540-24773-9_11
Common LISP: The Language, 1990. ,
Computability and Complexity from a Programming Perspective, 1997. ,
DOI : 10.1007/978-94-010-0413-8_4
In and Out of SSA Compilers in GNU Common Lisp ,
Semantic parallelization: a practical exercise in abstract interpretation, Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '87, pp.39-48, 1987. ,
DOI : 10.1145/41625.41629
A correspondence between continuation passing style and static single assignment form, ACM SIGPLAN Notices, vol.30, issue.3, pp.13-22, 1995. ,
DOI : 10.1145/202530.202532
Partial redundancy elimination in SSA form, ACM Transactions on Programming Languages and Systems, vol.21, issue.3, pp.627-676, 1999. ,
DOI : 10.1145/319301.319348
LLVM: A compilation framework for lifelong program analysis & transformation, International Symposium on Code Generation and Optimization, 2004. CGO 2004., 2004. ,
DOI : 10.1109/CGO.2004.1281665
Program slicing: methods and applications, Proceedings First IEEE International Workshop on Source Code Analysis and Manipulation, pp.142-149, 2001. ,
DOI : 10.1109/SCAM.2001.972675
Efficiently compiling a functional language on AMD64, Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming , PPDP '05, pp.176-186, 2005. ,
DOI : 10.1145/1069774.1069791
Advanced Compiler Design and Implementation, 1997. ,
Induction Variable Analysis with Delayed Abstractions, Proceedings of the International Conference on High Performance Embedded Architectures and Compilers (HiPEAC), pp.218-232, 2005. ,
DOI : 10.1007/11587514_15
URL : https://hal.archives-ouvertes.fr/hal-01257294
In and Out of SSA: a Denotational Specification, 32] L. Presser. Structured Languages. SIGPLAN Notices, pp.22-24, 1975. ,
URL : https://hal.archives-ouvertes.fr/hal-00915979
Inside the Intel Compiler, Linux Journal, vol.106, 2003. ,
Denotational Semantics: the Scott-Strachey Approach to Programming Languages Theory, 1977. ,
Gated SSA-based demand-driven symbolic analysis for parallelizing compilers, Proceedings of the 9th international conference on Supercomputing , ICS '95, pp.414-423, 1995. ,
DOI : 10.1145/224538.224648
Constant propagation with conditional branches, ACM Transactions on Programming Languages and Systems, vol.13, issue.2, pp.181-210, 1991. ,
DOI : 10.1145/103135.103136
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.4146
Loop Closed SSA Form ,
Static Single Assignment Form, GCC and GNU Toolchain Developers' Summit, 2004. ,