Next: About this document
Up: Bibliographie : page principale
Previous: Abréviations
Références
- Aar92
-
C.J. Aarts.
Galois Connections Presented Calculationally.
Graduating Disertation, Eindhoven University of Technology, July 1992.
ftp://ftp.win.tue.nl/pub/math.prog.construction/galois.dvi.Z
- ABS94
-
T.M. Austin, S.E. Breach, G.S. Sohi.
Efficient Detection of All Pointer and Array Access Errors.
In PLDI, pages 290-301. ACM, 1994.
ftp://ftp.cs.wisc.edu/sohi/papers/1994/pldi.safe-c.ps.gz
- AC76
-
F.E. Allen, J. Cocke.
A Program Data Flow Analysis Procedure.
CACM, 19(3):137-147, 1976.
- ACG99
-
Isabelle Attali, Denis Caromel, Romain Guider.
Static Analysis of Java for Distributed and Parallel Programming.
Rapport de recherche de l'INRIA RR-3634, Mars 1999.
ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-3634.ps.gz
- AH87
-
Samson Abramsky and Chris Hankin, editors.
Abstract Interpretation of Declarative Languages.
Ellis Horwood series in computers and their applications. J. Wiley & sons, 1987.
- AHLT99
-
S. Alstrup, D. Harel, P.W. Lauridsen, M. Thorup.
Dominators in Linear Time.
SIAM Journal on Computing, 28(6):2117-2132, 1999.
- AJ90
-
Samson Abramsky, Thomas P. Jensen.
A Relational Approach to Strictness Analysis for Higher-Order Polynomial Functions.
In 18th POPL, pages 49-54. ACM, 1990.
- AL95
-
R.Z. Altucher, William Landi.
An Extended Form of Must Alias Analysis for Dynamic Allocation.
In POPL, pages 74-84. ACM, 1995.
- And94
-
Lars Ole Andersen.
Program Analysis and Specialization for the C Programming Language.
Ph.D. Thesis, DIKU, University of Copenhagen.
May 1994, DIKU Report # 94/19.
ftp://ftp.diku.dk/diku/semantics/papers/D-203.dvi.Z
- Ass96
-
Uwe Assmann.
How to Uniformly Specify Program Analysis and Transformation.
In P. Fritzson, editor, Compiler Construction (CC). Springer, 1996.
http://i44s11.info.uni-karlsruhe.de:80/~assmann/
- ASU86
-
A.V. Aho, R. Sethi, J.D. Ullman.
Compilers: Principles, Techniques and Tools.
Addison Wesley, 1986.
Traduction française :
`` Compilateurs : principes, techniques et outils'', Interéditions, 1989.
- AU76
-
A.V. Aho, J.D. Ullman.
Node Listings for Reducible Flow Graphs.
Journal of Computer and System Sciences, 13(3):286-299, December 1976.
- AWZ88
-
Bowen Alpern, Mark N. Wegman, F.K. Zadeck.
Detecting Equality of Variables in Programs.
In 15th POPL, pages 1-11. ACM, 1988.
- AZ96
-
Wolfram Amme, Eberhard Zehendner.
A/D Graphs : A Data Structure for Data Dependence Analysis in Programs with Pointers.
In Lecture Notes in Computer Science, Vol 1127, 1996.
- BA98
-
Rastislav Bodik, Sadun Anik.
Path-sensitive Value-Flow Analysis.
In 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Diego,
California}, pages 237-251. ACM, January 1998.
http://www.cs.wisc.edu/~bodik/research/popl98.ps
- BMO90
-
Robert A. Ballance, Arthur B. Maccabe, Karl J. Ottenstein.
The Program Dependence Web : a Representation Supporting Control-, Data-,
and Demand-Driven Interpretation of Imperative Languages.
Proceedings of the ACM SIGPLAN '90 Conference on Programming Language Design and Implementation (PLDI '90).
Pages 257-271, ACM Press, 1990.
- Ban79
-
John P. Banning.
An Efficient Way to find the Side Effects of Procedure Calls and the Aliases of Variables.
6th POPL, pages 29-41. ACM, 1979.
- Ban88
-
Utpal Banerjee.
Dependence Analysis for Supercomputing.
Kluwer Academic, 1988.
- Ban88a
-
Utpal Banerjee.
An Introduction to a Formal Theory of Dependence Analysis.
The Journal of Supercomputing, 2(2), pp. 133-149, October 1988
- BCC00
-
D. Barthou, A. Cohen, J.-F. Collard.
Maximal Static Expansion.
Int. Journal of Parallel Programming, 28(3):213-243, June 2000.
Ancienne version : Proceedings of POPL'98, pp. 98-106.
http://www.prism.uvsq.fr/~bad/ps/mse.ps.gz
- BB89
-
W. Baxter, H.R. Bauer.
The Program Dependence Graph and Vectorization.
In 16th POPL, pp 1-11, 1989.
- BCCH97
-
Michael Burke, Paul Carini, Jong-Deok Choi, Michael Hind.
Interprocedural Pointer Alias Analysis.
IBM Research Report #21055, 1997.
http://www.mcs.newpaltz.edu/~hind/papers/RC21055.ps
- BG95
-
Rastislav Bodik, Rajiv Gupta.
Array Data-Flow Analysis for Load-Store Optimizations in Superscalar Architectures.
In 8th Annual Workshop on Languages and Compilers for Parallel Computing,
pages 1-15. Springer Verlag, LNCS 1033, 1995.
http://www.cs.arizona.edu/people/gupta/research/Publications/Comp/lcpc95.ps
- BGS93
-
Rastislav Bodik, Rajiv Gupta, M.L. Soffa.
URSA: A Unified ReSource Allocator for Registers and Functional Units in VLIW Architectures.
In Conference on Architectures and Compilation Techniques for Fine and Medium Grain Parallelism,
IFIP Transactions A-23,
pages 243-254. Orlando, Florida, January 1993.
http://www.cs.arizona.edu/people/gupta/research/Publications/Comp/pact93.ps
- BGS94
-
D. F. Bacon, S. L. Graham, and O. J. Sharp.
Compiler transformations for high-performance computing.
ACM Computing Surveys, 26(4):345--420, December 1994.
ftp://ftp.cs.berkeley.edu/ucb/parallel/survey.ps
- BGS95
-
Rastislav Bodik, Rajiv Gupta, M.L. Soffa.
GURRR: A Global Unified Resource Requirements Representation.
In ACM SIGPLAN Workshop on Intermediate Representations,
San Francisco, California, January 1995.
http://www.cs.arizona.edu/people/gupta/research/Publications/Comp/gurr.ps
- BGS98
-
Rastislav Bodik, Rajiv Gupta, M.L. Soffa.
Complete Removal of Redundant Expressions.
ACM SIGPLAN Notices, 33(5):1-14, May 1998.
Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'98).
Montreal, Canada, 1998.
http://www.cs.arizona.edu/people/gupta/research/Publications/Comp/pldi98.ps
- BGS99
-
Rastislav Bodik, Rajiv Gupta, M.L. Soffa.
Load-reuse analysis: Design and evaluation.
ACM SIGPLAN Notices, 34(5):64-76, May 1999.
Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'99).
http://www.cs.wisc.edu/~bodik/research/pldi99.ps
- Bin93
-
David Binkley.
Precise Executable Interprocedural Slices.
ACM Letters on Programming Languages and Systems.
Vol. 2, No. 1-4 (March-Dec. 1993), Pages 31-45.
- BKRW98
-
A.L. Buchsbaum, H. Kaplan, A. Rogers, J.R. Westbrook.
ACM Transactions on Programming Languages and Systems, 20(6):1265-1296, November 1998.
- Bin94
-
David Binkley.
Interprocedural Constant Propagation using Dependence Graphs and a Data-Flow Model.
In Compiler Construction, P. Fritzson, editor, pp 374-388, 1994 (LNCS #786).
- BM94
-
Marc M. Brandis, HansPeter Mössenböck.
Single-Pass Generation of Static Single-Assignment form for Structured Languages.
ACM Transactions on Programming Languages and Systems,
16(6):1684-1698, November 1994.
Technical Report, Johannes Kepler University Linz, Austria, Number
CS-SSW-P94-11, November 1, 1994.
ftp://ftp.ssw.uni-linz.ac.at/pub/Reports/CS-SSW-P94-11.ps.Z
- Bou92
-
François Bourdoncle.
Sémantiques des Langages Impératifs d'Ordre Supérieur et Interprétation Abstraite.
Thèse, École Polytechnique, 1992.
http://www.ensmp.fr/~bourdonc/these.html
- Bou93
-
François Bourdoncle.
Abstract Debugging of Higher-Order Imperative Languages.
SIGPLAN Notices, 28(6):46-55, June 1993.
Proceedings of PLDI'93.
http://www.ensmp.fr/~bourdonc/pldi93.html
- BP96
-
Gianfranco Bilardi, Keshav Pingali.
A Framework for Generalized Control Dependence.
In Proceedings of the ACM SIGPLAN '96 conference on Programming
language design and implementation (PLDI'96),
pages 291--300, May 1996.
- BP00
-
Gianfranco Bilardi, Keshav Pingali.
The Static Single Assignment Form and its Computation.
Research report, Cornell University, 2000.
http://www.cs.cornell.edu/Info/Projects/Bernoulli/papers/ssa.ps
- BR90
-
M.G. Burke, Barbara G. Ryder.
A Critical Analysis of Incremental Iterative Data Flow Analysis Algorithms.
IEEE-TSE, 7(16):723-728, July 1990.
- BRS99
-
M. Benedikt, T. Reps, M. Sagiv.
A Decidable Logic for Describing Linked Data Structures.
European Symposium On Programming (ESOP'99).
Amsterdam 22-26 March 1999.
Springer, Lecture Notes in Computer Science #1576, pages 2-19.
http://www.math.tau.ac.il/~sagiv/esop99.ps
- BCHS98
-
P. Briggs, K. D. Cooper, T. J. Harvey, L. T. Simpson.
Practical Improvements to the Construction and Destruction of Static Single Assignment Form.
Software: Practice and Experience, 28(8), 859-881, July 1998.
http://www.cs.rice.edu/~harv/ssa.ps
- BT93
-
Preston Briggs, Linda Torczon.
An Efficient Representation for Sparse Sets.
In ACM Letters on Programming Languages and Systems, vol 2, n0. 1-4, pages 59-69,
March 1993.
- Bur90
-
Geoffrey L. Burn.
A Relationship between Abstract Interpretation and Projection Analysis.
In 17th POPL, pages 151-156. ACM, 1990.
- Bur91
-
Geoffrey L. Burn.
Lazy Functional Languages: Abstract Interpretation and Compilation.
Research Monographs in Parallel and Distributed Computing. Pitman, 1991.
- Cas97
-
Giuseppe Castagna.
Object-oriented programming, a unified foundation.
Birkhäuser (Progress in theoretical computer science), 1997.
- CBC93
-
J.D. Choi, M. Burke, P. Carini.
Efficient Flow-Sensitive Interprocedural Computation of Pointer-Induced Aliases and Side Effects.
In 20th POPL, pages 232-245, 1993.
- KCL+99
-
R. Kennedy, S. Chan, S.-M. Liu, R. Lo, Peng Tu, F. Chow.
Partial redundancy elimination in SSA form, 21(3): 627-676, May 1999.
http://www.acm.org/pubs/articles/journals/toplas/1999-21-3/p627-kennedy/p627-kennedy.pdf
- CCK+97
-
F. Chow, S. Chan, R. Kennedy, S.-M. Liu, R. Lo, Peng Tu.
A New Algorithm for Partial Redundancy Elimination based on SSA Form.
ACM SIGPLAN Notices, 32(5): 273-286, June 1997.
Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI-97).
- CC76a
-
Patrick Cousot, Radhia Cousot.
Abstract Interpretation:
a Unified Lattice Model for Static Analysis of Programs
by construction or Approximation of Fixpoints.
In POPL, Los Angeles, pages 238-252, 1976.
http://www.dmi.ens.fr/~cousot/COUSOTpapers/POPL77.shtml
- CC76b
-
Patrick Cousot, Radhia Cousot.
Static Determination of Dynamic Properties of Programs.
In Bernard Robinet, editor, Symposium on Programming, Paris,
pages 106-130. Dunod informatique, 1976.
http://www.dmi.ens.fr/~cousot/COUSOTpapers/ISOP76.shtml
- CC79
-
Patrick Cousot, Radhia Cousot.
Systematic Design of Program Analysis Frameworks.
In 6th POPL, San Antonio, Texas, pages 269-282, 1979.
http://www.dmi.ens.fr/~cousot/COUSOTpapers/POPL79.shtml
- CC92a
-
Patrick Cousot, Radhia Cousot.
Abstract Interpretation and Applications to Logic Programs.
Journal of Logic Programming, 13(2-3):103-180, July 1992.
http://www.dmi.ens.fr/~cousot/COUSOTpapers/JLP92.shtml
- CC92b
-
Patrick Cousot, Radhia Cousot.
Comparing the Galois Connection and Widening/Narrowing
Approaches to Abstract Interpretation.
PLILP'92, pages 269-295. Springer-Verlag, 1992. (LNCS#631).
http://www.dmi.ens.fr/~cousot/COUSOTpapers/PLILP92.shtml
- Cou96
-
Patrick Cousot.
Abstract Interpretation.
ACM Computing Surveys, 28(2):324-328, June 1996.
http://www.dmi.ens.fr/~cousot/COUSOTpapers/CS96.shtml
- Cou98
-
Patrick Cousot.
The Calculational Design of a Generic Abstract Interpreter.
In M. Broy and R. Steinbrüggen (eds) Calculational System Design. NATO ASI Series F.,
IOS Press, 1999.
http://www.dmi.ens.fr/~cousot/COUSOTpapers/Marktoberdorf98.shtml
- CDG96
-
Craig Chambers, Jeffrey Dean, David Grove.
Whole-program Optimization of Object-Oriented Languages.
Research Report UW-CSE-96-06-02, Department of Computer Science and Engineering,
University of Washington, 1996.
ftp://ftp.cs.washington.edu/homes/chambers/whole-program.ps.gz
- CCF91
-
J.D. Choi, R. Cytron, J. Ferrante.
Automatic Construction of Sparse Data Flow Evaluation Graphs.
In 8th POPL, pages 55-66. ACM, 1991.
- CFR89
-
Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, F.K. Zadeck.
An Efficient Method of Computing Static Single Assignment Form.
In 16th POPL, pages 25-35. ACM, 1989.
- CF89
-
Robert Cartwright, Matthias Felleisen.
The Semantics of Program Dependence.
In PLDI'89, pp.13-27, 1989.
http://www.cs.rice.edu/CS/PLT/Publications/pldi89-cf.ps.gz
- CF99
-
A. Cortesi, G. Filé (Editors).
Static Analysis, Proceedings of 6th International Symposium (SAS'99), Venice, Italy.
http://link.springer-ny.com/link/service/series/0558/tocs/t1694.htm
- CG93
-
Ron Cytron, Reid Gershbein.
Efficient Accomodation of May-Alias Information in SSA Form.
SIGPLAN Notices, 28(6):36-45, June 1993.
PLDI'93.
- CH78
-
Patrick Cousot, Nicolas Halbwachs.
Automatic Discovery of Linear Restraints among Variables of a Program.
In 5th POPL, 1978.
http://www.di.ens.fr/~cousot/COUSOTpapers/POPL78.shtml
- CI96
-
Béatrice Creusillet, François Irigoin.
Exact versus Approximate Array Region Analyses.
In Ninth International Workshop on Languages and Compilers for Parallel Computing.
LNCS, 1996.
http://www.cri.ensmp.fr:80/~creusil/
- CK88
-
David Callahan, Ken Kennedy.
Analysis of Interprocedural Side Effects in a Parallel Programming Environment.
Journal of Parallel and Distributed Computing, 5:517-550,1988
- CK94
-
Steven Carr, Ken Kennedy.
Improving the Ratio of Memory Operations to Floating-Point Operations in Loops.
ACM Transactions on Programming Languages and Systems, November 1994., 16(6):1768-1810,
Nov. 1994
ftp://cs.mtu.edu/pub/carr/unroll.ps.gz
- CMN91
-
Jong-Deok Choi, B.P. Miller, R.H.B. Netzer.
Techniques for Debugging Parallel Programs with Flowback Analysis.
ACM Transactions on Programming Languages and Systems.
13(4):491-530, April 1991.
- Cli95a
-
Clifford Click.
Global Code Motion, Global Value Numbering.
SIGPLAN Notices, 30(6):246-257, June 1995. (PLDI'95).
- Cli95b
-
Clifford Click.
Combining Analyses, Combining Optimizations.
Ph.D. Thesis, Rice University, February 1995.
http://www.cs.rice.edu/~cliffc/
- Col99
-
Jean-François Collard.
Array SSA for Explicitly Parallel Programs.
In Proceedings of Euro-Par'99. LNCS 1685, Springer-Verlag, pages 383-400.
Toulouse, France. Sept. 1999.
http://www.prism.uvsq.fr/~jfc/diff_europar99.ps.gz
- Col97
-
Christian S. Collberg.
Reverse Interpretation + Mutation Analysis = Automatic Retargeting.
In Proceedings of the ACM SIGPLAN Conference on Programming
Language Design and Implementation (PLDI-97).
pages 57-70. ACM, June 1997. ACM SIGPLAN Notices, Vol. 32, 5.
http://www.cs.auckland.ac.nz/~collberg/Research/Publications/
- Cou81
-
Patrick Cousot.
Semantic Foundations of Program Analysis.
In Steven S. Muchnick and Neil D. Jones, editors,
Program Flow Analysis: Theory and Applications,
chapter 10, pages 303-342. Prentice-Hall, 1981.
http://www.dmi.ens.fr/~cousot/COUSOTpapers/PFA81.shtml
- Cout86
-
Deborah S. Coutant.
Retargetable High Level Analysis.
In 13th POPL, pp 110-118, 1986.
- CP89
-
Jiazhen Cai, Robert Paige.
Program Derivation by Fixed Point Computation.
Science of Computer Programming, 11:197-261, 1989.
- CWZ90
-
David R. Chase, Mark Wegman, F.K. Zadeck.
Analysis of Pointers and Structures.
In 17th POPL, pages 296-310. ACM, 1990.
- DP90
-
B.A. Davey, H.A. Priestley.
Introduction to Lattices and Order.
Cambridge University Press, 1990.
- Deu90
-
Alain Deutsch.
On Determining Lifetime and Aliasing of Dynamically Allocated Data in
Higher-Order Functional Specifications.
In 7th POPL, pages 157-168. ACM Press, 1990.
- Deu92
-
Alain Deutsch.
A Storeless Model of Aliasing and its Abstractions
using Finite Representations of Right-Regular Equivalence Relations.
In International Conference on Computer Languages, pages 2-13. IEEE, 1992.
- Deu94
-
Alain Deutsch.
Interprocedural May-Alias Analysis for Pointers: beyond k-limiting.
SIGPLAN Notices, 6:230-241, 1994.
- DGS93
-
Evelyn Duesterwald, Rajiv Gupta, Mary Lou Soffa.
A Practical Data Flow Framework for Array Reference Analysis and its Application in Optimizations.
SIGPLAN Notices, 28(6):68-77, June 1993 (PLDI'93).
http://www.cs.arizona.edu/people/gupta/research/Publications/Comp/pldi93.ps
- DGS94
-
Evelyn Duesterwald, Rajiv Gupta, Mary Lou Soffa.
Reducing the Cost of Data Flow Analysis By Congruence Partitioning.
In Peter A. Fritzson, editor, Compiler Construction,
pages 357-373. Springer-Verlag, LNCS # 786, 1994.
http://www.cs.arizona.edu/people/gupta/research/Publications/Comp/cc94.ps
- DGS95
-
Evelyn Duesterwald, Rajiv Gupta, Mary Lou Soffa.
Demand-driven Computation of Interprocedural Data Flow.
In 22nd POPL, pages 37-48. ACM, 1995.
http://www.cs.arizona.edu/people/gupta/research/Publications/Comp/popl95.ps
- DGS96
-
Evelyn Duesterwald, Rajiv Gupta, Mary Lou Soffa.
A demand-driven Analyzer for Data Flow Testing at The Integration Level.
In IEEE International Conference on Software Engineering, pages 575-586, March 1996.
Berlin, Germany.
http://www.cs.arizona.edu/people/gupta/research/Publications/SE/icse96.ps
- DGS97
-
Evelyn Duesterwald, Rajiv Gupta, Mary Lou Soffa.
A Practical Framework for Demand-driven Interprocedural Data Flow Analysis.
ACM Transactions on Programming Languages and Systems,
19 (6), 992-1030, November 1997.
http://www.cs.arizona.edu/people/gupta/research/Publications/Comp/toplas98.ps
- Dha88
-
D.M. Dhamdhere.
A Fast Algorithm for Code Movement Optimization.
SIGPLAN Notices, 23(10):172-180, 1988.
PLDI'88.
- Dwy95
-
Matthew B. Dwyer.
Data Flow Analysis for Verifying Correctness Properties of Concurrent Programs.
Ph.D. Thesis, University of Massachusetts, Amherst, MA.
September 1995.
http://www.cis.ksu.edu/~dwyer/papers/thesis.ps
- EGH94
-
Maryam Emami, Rakesh Ghiya, Laurie J. Hendren.
Context-Sensitive Interprocedural Points-To Analysis in the Presence of Function Pointers.
SIGPLAN Notices, 6:242-256, 1994.
http://www-acaps.cs.mcgill.ca/~hendren/
- EH94
-
Ana M. Erosa Laurie J. Hendren.
Taming Control Flow: A Structured Approach to Eliminating GOTO Statements.
In International Conference on Computer Languages, pages 229-240, 1994.
ftp://ftp-acaps.cs.mcgill.ca/pub/doc/papers/ICCL94.ps.gz
- Fea88
-
Paul Feautrier.
Parametric Integer Programming.
RAIRO, Recherche Opérationnelle, 22(3):243-268, September 1988.
http://www.prism.uvsq.fr/public/paf/parmprog.ps
- Fea91
-
Paul Feautrier.
Dataflow Analysis of Array and Scalar References.
International Journal of Parallel Processing,
20(1):23-53, 1991.
http://www.prism.uvsq.fr/public/paf/dataflow.ps
- FGL96
-
Pascal Fradet, Ronan Gaugne, Daniel LeMetayer.
An Inference Algorithm for the Static Verification of Pointer Manipulation.
Rapport de Recherche RR-2895, IRISA, Rennes, Campus Universitaire de Beaulieu, Mai 1996.
http://zenon.inria.fr:8003/Equipes/LANDE-eng.html
- Flo67
-
Robert W. Floyd.
Assigning Meaning to Programs.
In Jacob T. Schwartz, editor, Mathematical Aspects of Computer Science,
pages 19-32, New York, 1967. American mathematical society.
- Fon77
-
Amelia C. Fong.
Generalized Common Subexpressions in Very High Languages.
In 4th POPL, pages 48-57, Los Angeles, Calif., 1977.
- FOW77
-
J. Ferrante, K.J. Ottenstein, J.D. Warren.
The Program Dependence Graph and its Use in Optimization.
ACM Transactions on Programming Languages and Systems,
9(3):319-349, July 1977.
- Gal96
-
Keith Gallagher.
A Survey of Program Slicing.
Loyola College, Computer Science Department.
Research Report, 1996.
http://www.cs.loyola.edu/~kbg/survey.ps.gz
- Gau97
-
Ronan Gaugne.
Techniques d'analyse statique pour l'aide à la mise au point de programmes
avec manipulation explicite de pointeurs.
Thèse, Université de Rennes 1, Octobre 1997.
ftp://ftp.irisa.fr/pub/techreports/theses/1997/gaugne.ps.gz
- Ger96
-
Michael P. Gerlek.
Beyond Induction Variables:
Detecting and Classifying Sequences Using a Demand-driven SSA Form.
Ph.D. Thesis, Oregon Graduate Institute of Science and Technology, Computer Science Dept., January 1996.
ftp://cse.ogi.edu/pub/tech-reports/1995/95-TH-004.ps.gz
- Ghi98
-
Rakesh Ghiya.
Putting Pointer Analysis to Work.
Ph.D. Thesis, School of Computer Science, McGill University.
January 1998.
http://www-acaps.cs.mcgill.ca/~ghiya/ftp/thesis.ps.gz
- GH95
-
Rakesh Ghiya, Laurie J. Hendren.
Connection Analysis: a Practical Interprocedural Heap Analysis for C.
In C.H. Huang, P. Sadayappan, U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua, editors,
8th Workshop on Languages and Compilers for Parallel Computing.
Springer-Verlag, LNCS # 1033, 1995.
ftp://ftp-acaps.cs.mcgill.ca/pub/doc/papers/lcpc95.ps.gz
- GH96
-
Rakesh Ghiya, Laurie J. Hendren.
Is it a Tree, a Dag, or a Cyclic Graph? A Shape Analysis for Heap-directed Pointers in C.
In 23rd POPL, pages 1-15. ACM, 1996.
ftp://ftp-acaps.cs.mcgill.ca/pub/doc/papers/POPL96.ps.gz
- GKT91
-
Gina Goff, Ken Kennedy, Chau-Wen Tseng.
Practical Dependence Testing.
In SIGPLAN '91 Conference on Programming Language Design and Implementation (PLDI'91)
SIGPLAN Notices, 26 (6), June 1991, pages 15-29
CRPC Technical Report CRPC-TR90103-S.
ftp://softlib.rice.edu/pub/CRPC-TRs/reports/CRPC-TR90103-S.ps.gz
- Gou97
-
Valérie Gouranton.
Dérivation d'analyseurs dynamiques et statiques à partir de spécifications opérationnelles.
Thèse, Université de Rennes I, Septembre 1997.
ftp://ftp.irisa.fr/pub/techreports/theses/1997/gouranton.ps.gz
- Gra89
-
Philippe Granger.
Static Analysis of Arithmetical Congruences.
Int. J. Computer. Math., 30:165-190, 1989.
- Gra90
-
Philippe Granger.
Static Analysis of Linear Congruence Equalities among Variables of a Program.
Rapport de Recherche 90/10, École Polytechnique, Laboratoire d'Informatique, Novembre 1990.
- GS90
-
Thomas Gross, Peter Steenkiste.
Structured Dataflow Analysis for Arrays and its use in an Optimizing Compiler.
Software - Practice and Experience,
20(2), 133-155 (February 1990).
- GSW95
-
Michael P. Gerlek, Eric Stoltz, Michael Wolfe.
Beyond Induction Variables: Detecting and Classifying Sequences Using a Demand-driven SSA Form.
ACM Transactions on Programming Languages and Systems, 17 (1), 85-122, 1995.
http://www.cse.ogi.edu/~stoltz/www.dir/papers/iv.ps
- Gup92
-
Rajiv Gupta.
Generalized Dominators and Post-Dominators.
In 19th POPL, pages 246-257. ACM, January 1992.
also: Information Processing Letters, Vol. 53, pages 193-200, 1995.
http://www.cs.arizona.edu/people/gupta/research/Publications/Comp/ipl.ps
- Gup94
-
Rajiv Gupta.
Optimizing Array Bound Checks using Flow Analysis.
ACM Letters on Programming Languages and Systems,
2(1-4):135-150, March 1994.
http://www.cs.pitt.edu/~gupta/research/Comp/loplas.ps
- Gup99
-
Rajiv Gupta, S. Pande, K. Psarris, V. Sarkar.
Compiling for Parallel Systems.
In Parallel Computing journal, North Holland, 1999 (invited paper).
http://www.cs.arizona.edu/people/gupta/research/Publications/Comp/parco.ps
- GW76
-
Susan L. Graham, Mark N. Wegman.
A Fast and Usually Linear Algorithm for Global Data Flow Analysis.
Journal of the ACM, 23(1):172-202, January 1976.
- GV95
-
Elana Granston, Alexander Veidenbaum.
Combining Flow and Dependence Analyses to Expose Redundant Array Accesses.
Research Report CRPC-TR95545, Center for Research on Parallel Computation, Rice University, May 1995.
ftp://softlib.rice.edu/pub/CRPC-TRs/reports/CRPC-TR95545.ps.gz
- Har77
-
William H. Harrison.
Compiler Analysis of the Value Ranges for Variables.
IEEE Transactions on Software Engineering, SE-3(3):243-250, May 1977.
- Hav93
-
Paul Havlak.
Construction of Thinned Gated Single-Assignment Form,
Proceedings of the 6th International Workshop on Languages and Compilers for Parallel Computing.
Lecture Notes in Computer Science 768, pages 477-499, Springer-Verlag, August 1993.
- Hav94
-
Paul Havlak.
Interprocedural Symbolic Analysis.
Ph.D. Thesis, CRPC, Rice University. May 1994.
ftp://softlib.rice.edu/pub/CRPC-TRs/reports/CRPC-TR94451-S.ps.gz
- Hav97
-
Paul Havlak.
Nesting of Reducible and Irreducible Loops.
ACM Transactions on Programming Languages and Systems.
19(4):557-567, July 1997.
- HDT87
-
Susan Horwitz, Alan Demers, Tim Teitelbaum.
An Efficient General Iterative Algorithm for Dataflow Analysis.
Acta Informatica, 24(6):679-694, 1987.
- HH98
-
R. Hasti, S. Horwitz.
Using static single assignment form to improve flow-insensitive pointer analysis.
An Efficient General Iterative Algorithm for Dataflow Analysis.
In PLDI'98, 1998.
http://www.cs.wisc.edu/wpis/papers/pldi98.ps
- HHN92
-
Laurie J. Hendren, Joseph Hummel, Alexandru Nicolau.
Abstractions for Recursive Pointer Data Structures:
Improving the Analysis and Transformation of Imperative Programs.
In PLDI, pages 249-260. ACM, 1992.
ftp://ftp-acaps.cs.mcgill.ca/pub/doc/papers/PLDI92.ps.gz
- HHN94
-
Joseph Hummel, Laurie J. Hendren, Alexandru Nicolau.
A General Data Dependence Test, Pointer-Based Data Structures.
In PLDI, pages 218-229. ACM, 1994.
ftp://ftp-acaps.cs.mcgill.ca/pub/doc/papers/PLDI94b.ps.gz
- HN90
-
Laurie J. Hendren, Alexandru Nicolau.
Parallelizing Programs with Recursive Data Structures.
IEEE, Transactions on Parallel and Distributed Systems,
1(1):35-47, January 1990.
- HP92
-
M. Haghighat, C. Polychronopoulos.
Symbolic program analysis and optimization for parallel compilers.
Technical Report 1237, CSRD, Univ. of Illinois, August 1992.
Presented at the 5th Annual Workshop on Languages and Compilers
for Parallel Computing, New Haven, CT, August 3-5, 1992.
- HP96
-
M. Haghighat, C. Polychronopoulos.
Symbolic analysis for parallelizing compilers.
ACM Transactions on Programming Languages and Systems, 18(4):477--518, July 1996.
- HPR88
-
Susan Horwitz, Jan Prins, Thomas Reps.
On the Adequacy of Program Dependence Graphs for Representing Programs.
15th POPL, pages 146-157. ACM, 1988.
http://www.cs.wisc.edu/wpis/papers/popl88b.ps
- HR81
-
L. Howard Holley, Barry K. Rosen.
Qualified Data Flow Problems.
IEEE Transactions on Software Engineering, SE-7(3):60-78,
January 1981.
- HRS95a
-
Susan Horwitz, Thomas Reps, Mooly Sagiv.
Demand Interprocedural Dataflow Analysis.
In SIGSOFT Symposium on Foundations of Software Engineering.
ACM, 1995.
http://www.cs.wisc.edu/wpis/papers/tr1283r.ps
- HRS95b
-
Susan Horwitz, Thomas Reps, Mooly Sagiv.
Precise Interprocedural Dataflow Analysis via Graph Reachability.
22nd POPL, pages 49-61. ACM, 1995.
http://www.cs.wisc.edu/wpis/papers/popl95.ps
- HU72
-
M.S. Hecht, J.D. Ullman.
Flow Graph Reducibility.
SIAM J. Comput., 1(2):188-202, June 1972.
- HU73
-
M.S. Hecht, J.D. Ullman.
Analysis of a Simple Algorithm for Global Data Flow Problems.
In POPL, pages 207-217. ACM, 1973.
- HU74
-
M.S. Hecht, J.D. Ullman.
Characterizations of Reducible Flow Graphs.
JACM, 21(3):367-375, July 1974.
- HV92
-
R. Nigel Horspool, Jan Vitek.
Static Analysis of Postcript Code.
In IEEE, International Conference on Computer Languages, pages 14-23, 1992.
- JC97
-
Johan Janssen, Henk Corporaal.
Making graphs reducible with controlled node splitting.
ACM Transactions on Programming Languages and Systems (TOPLAS),
vol 19, n0. 6, pp. 1031-1052, November 1997.
- JH94
-
J. Justiani, Laurie J. Hendren.
Supporting Array Dependence Testing for an Optimizing/Parallelizing C Compiler.
In Peter A. Fritzson, editor,
5th International Confrence on Compiler Construction (CC '94),
pages 309-323. Springer-Verlag, LNCS#786, 1994.
ACAPS Technical Memo 74, October 1993, McGill University
ftp://ftp-acaps.cs.mcgill.ca/pub/doc/memos/memo74.ps.gz
- JM86
-
N. Jones, A. Mycroft.
Data Flow Analysis of Applicative Programs using Minimal Functions Graphs.
In 13th POPL, pages 296-306. ACM, 1986.
- JN94
-
Neil D. Jones, Fleming Nielson.
Abstract Interpretation: a Semantics-Based Tool for Program Analysis.
In Handbook of Logic in Computer Science, Oxford University Press, 1994, 527-629.
ftp://ftp.diku.dk/diku/semantics/papers/D-58.ps
- JP93
-
Richard Johnson, Keshav Pingali.
Dependence-Based Program Analysis.
SIGPLAN Notices, 28(6), pages 78-89, June 1993. (PLDI'93).
http://simon.cs.cornell.edu/Info/Projects/Bernoulli/papers/pldi93.ps
- Joh94
-
Richard Johnson.
Efficient Program Analysis using Dependence Flow Graphs.
Ph.D. Thesis, Cornell University, August 1994.
http://simon.cs.cornell.edu/Info/Projects/Bernoulli/
- JR94
-
Daniel Jackson, Eugene J. Rollins.
A New Model of Program Dependences for Reverse Engineering.
SIGSOFT'94, pages 2-9. ACM, 1994.
- JT88
-
Suneel Jain, Carol Thompson.
An Efficient Approach to Data Flow Analysis in a Multiple Pass Global Optimizer.
SIGPLAN Notices, 23(7):154-163, July 1988. PLDI'88.
- Kar76
-
A. Karr.
Affine Relationships among Variables of a Program.
Acta Informatica, 6:133-151, 1976.
- Ken76
-
K. Kennedy.
A Comparison of Two Algorithms for Data Flow Analysis.
SIAM J. Comput., 5(1):158-180, March 1976.
- Kil73
-
G.A. Kildall.
A Unified Approach to Global Program Optimization.
In POPL, pages 194-206. ACM, 1973.
- Kno98
-
J. Knoop.
Optimal interprocedural program optimization: a new framework and its application.
Lecture notes in computer science, 0302-9743. Springer, 1998.
- Kno99
-
J. Knoop.
From DFA-frameworks to DFA-generators: A unifying multiparadigm approach.
In Proceedings of the 5th International Conference on Tools and Algorithms for the
Construction and Analysis of Systems (TACAS'99) (Amsterdam, The Netherlands),
Springer-Verlag, Heidelberg, LNCS 1579 (1999), 360 - 374.
http://guiness.cs.uni-dortmund.de/~knoop/publications.html
- KKS98
-
J. Knoop, D. Koschützki, B. Steffen.
Basic Blocks: Living Dinosaurs?.
In Compiler Construction, K. Koskimies, editor, pp 65-79, Springer, 1998.
- KRS92
-
J. Knoop, O. Rüthing, B. Steffen.
Lazy Code Motion.
SIGPLAN Notices, 27(7):224-234, 1992.
(PLDI'92).
ftp://ftp.uni-passau.de/pub/local/parallel/papers/lcm-9208-a4.ps.Z
- KRS93b
-
J. Knoop, O. Rüthing, B. Steffen.
Optimal Code Motion: Theory and Practice.
MIP-Bericht 9310, Fakultät für Mathematik und Informatik,
Universität Passau, December 1993.
ftp://ftp.uni-passau.de/pub/local/parallel/papers/ocm-9310-a4.ps.Z
- KRS94
-
J. Knoop, O. Rüthing, B. Steffen.
Partial Dead Code Elimination.
In PLDI, pages 147-158. ACM, 1994.
ftp://ftp.uni-passau.de/pub/local/parallel/papers/pde-pldi94-a4.ps.Z
- KRS95
-
J. Knoop, O. Rüthing, B. Steffen.
Lazy Strength Reduction.
Journal of Programming Languages, 1:71-91, 1993.
ftp://ftp.uni-passau.de/pub/local/parallel/papers/lsr-jpl-a4.ps.Z
- KRS96
-
J. Knoop, O. Rüthing, B. Steffen.
Towards a Tool Kit for the Automatic Generation of Interprocedural Data Flow Analyses.
Journal of Programming Languages, 4(4):211-246, 1996.
ftp://ftp.uni-passau.de/pub/local/parallel/papers/tk-9413-a4.ps.Z
http://www.thomson.com:8866/jp/pdfpapers/jp040402.pdf
- KS94
-
J. Knoop, B. Steffen.
The Interprocedural Coincidence Theorem.
In U. Kastens and P. Pfahler, editors,
Proceedings of the 4th International Conference on Compiler Construction (CC'92), Paderborn,
Germany, pages 124-13. Springer-Verlag, 1994.
ftp://ftp.uni-passau.de/pub/local/parallel/papers/ict-cc92-a4.ps.Z
- KS98
-
Kathleen Knobe, Vivek Sarkar.
Array SSA form and its use in parallelization.
25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
pages 107-120, January 1998.
- KSV94
-
J. Knoop, B. Steffen, J. Vollmer.
Parallelism for Free: Efficient and Optimal Bitvector Analyses for Parallel Programs.
Research Report MIP-9409, Universität Passau, August 1994.
- KU76
-
John B. Kam, Jeffrey D. Ullman.
Global Data Flow Analysis and Iterative Algorithms.
Journal of the ACM, 23(1):158-171, 1976.
- KU77
-
John B. Kam, Jeffrey D. Ullman.
Monotone Data Flow Frameworks.
Acta Informatica, 7:305-317, 1977.
- Lan92
-
William Landi.
Interprocedural Aliasing in the Presence of Pointers.
Ph.D. Thesis, Rutgers University, January 1992.
ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-174.ps.Z
- Lar94
-
Jean-Marie Larchevêque.
Interprocedural Type propagation for Object-Oriented Languages.
Science of Computer Programming, 22:257-282, 1994.
- LH88
-
J.R. Larus, P.N. Hilfinger.
Detecting Conflicts between Structure Accesses.
SIGPLAN Notices, 23(7):21-34, June 1988.
(PLDI'88).
- LH96
-
C. Lapkowski, Laurie J. Hendren.
Extended SSA Numbering: Introducing SSA Properties to Languages with Multi-Level Pointers.
In CASCON'96, ``Meeting of Minds'', pp 64-75, 1996.
http://www-acaps.cs.mcgill.ca/~lapkow/
- LR91
-
William Landi, Barbara G. Ryder.
Pointer-Induced Aliasing : a Clarification.
In 18th POPL, pages 93-103, 1991.
- LR92
-
William Landi, Barbara G. Ryder.
A Safe Approximate Algorithm for Interprocedural Pointer Aliasing.
SIGPLAN Notices, 27(7):235-248, July 1992.
Proceedings of PLDI'92.
ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-168.ps.Z
- LRZ93
-
William Landi, Barbara G. Ryder, Sean Zhang.
Interprocedural Modification Side Effect with Pointer Aliasing.
SIGPLAN Notices, 28(6):56-67, June 1993.
Proceedings of PLDI'93.
ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-168.ps.Z
- LT79
-
T. Lengauer, Robert Endre Tarjan.
A Fast Algorithm for Finding Dominators in a Flowgraph.
ACM Transactions on Programming Languages and Systems,
1(1):121-141, July 1979.
- Mar93
-
Kim Marriott.
Frameworks for Abstract Interpretation.
Acta Informatica, 30(2):103-129, 1993.
IBM Research Report RC18428 (March 1990).
- May92
-
Dror E. Maydan.
Accurate Analysis of Array References.
Ph.D. Thesis, Computer Systems Laboratory, Stanford University, September 1992.
http://suif.stanford.edu/papers/maydan92c.ps
- MCL93
-
T.J. Marlowe, Jong-Deok Choi, W.G. Landi, M.G. Burke, Barbara G. Ryder, P. Carini.
Pointer-Induced Aliasing: a Clarification.
ACM SIGPLAN Notices, 28(9):67-70, September 1993.
- MHT96
-
A. Matsumoto, D.S. Han, T. Tsuda.
Alias Analysis of Pointers in PASCAL and FORTRAN-90:
Dependence Analysis between Pointer References.
Acta Informatica, 33:99-130, 1996.
- MJ81
-
S.S. Muchnick, Neil D. Jones, editors.
Program Flow Analysis: Theory and Applications.
Prentice-Hall, 1981.
- Muc97
-
S.S. Muchnick.
Compiler Design Implementation..
Morgan and Kaufmann, 1997.
- MJ92
-
Carl McConnell and Ralph E. Johnson.
Using Static Single Assignment Form in a Code Optimizer.
ACM Letters on Programming Languages and Systems,
1(2), pp. 152-160, ACM Press, June 1992.
- MMR95
-
Stephen P. Masticola, Thomas J. Marlowe, Barbara G. Ryder.
Lattice Frameworks for Multisource and Bidirectional Data Flow Problems.
ACM Transactions on Programming Languages and Systems,
17(5):777-803, September 1995.
ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-241.ps.Z
- MN83
-
A. Mycroft, F. Nielson.
Strong Abstract Interpretation using Power Domains.
In J. Diaz, editor, 10th ICALP, pages 536-547. LNCS # 154, 1983.
- Mor97
-
John David Morgenthaler.
Static Analysis for a Software Transformation Tool.
Ph.D. Thesis, Department of Computer Science and Engineering, University of California, San Diego.
August 1997.
http://www-cse.ucsd.edu/users/jdm/Papers/thesis.ps.gz
- MR79
-
E. Morel, C. Renvoise.
Global Optimization by Suppression Partial Redundancies.
CACM, 22(2):96-103, February 1979.
- MR90
-
T.J. Marlowe, Barbara G. Ryder.
Properties of Data Flow Frameworks.
Acta Informatica, 28:121-163, 1990.
- MS76
-
Zohar Manna, Adi Shamir.
The Theoretical Aspects of the Optimal Fixed Point.
SIAM J.Comput., 5(3):414-426, September 1976.
- Mye81
-
E. W. Myers.
A Precise Interprocedural Data Flow Algorithm.
In 8th POPL, pages 219-230. ACM, 1981.
- NNH99
-
Flemming Nielson, Hanne Riis Nielson, Chris Hankin.
Principles of Program Analysis.
Springer-Verlag, 1999.
http://www.daimi.au.dk/~hrn/PPA/ppa.html
- OO84
-
Karl J. Ottenstein, Linda M. Ottenstein.
The Program Dependence Graph and its use in a Software Development Environment.
SIGPLAN Notices, 19(5):177-184, May 1984.
- PBJ90
-
K. Pingali, M. Beck, R. Johnson, M. Moudgill, P. Stodghill.
Dependence Flow Graphs: an Algebraic Approach to Program Dependencies.
In 18th POPL, pages 67-78. ACM, 1990.
http://simon.cs.cornell.edu/Info/Projects/Bernoulli/papers/popl91.ps
- PC90
-
Andy Podgurski, Lori A. Clarke.
A Formal Model of Program Dependences
and Its Implications for Software Testing, Debugging, and Maintenance.
IEEE Transactions on Software Engineering,
vol. 16, N0.9, pp 965-979, September 1990.
- PC94
-
John Plevyak, A. Chien.
Iterative Flow Analysis.
In Conf. Object-Oriented Programming Systems, 1994.
- PS89
-
L.L. Pollock, Mary Lou Soffa.
An Incremental Version of Iterative Data Flow Analysis.
IEEE-TSE, 15(12):1537-1549, December 1989.
- Pugh92
-
William Pugh.
The Omega Test: a Fast and Practical Integer Programming Algorithm for Dependence Analysis.
Communications of the ACM, 8:102-114, August 1992
- PW92
-
William Pugh, David Wonnacott.
Eliminating False Data Dependences using the Omega Test.
University of Maryland Institute for Advanced Computer Studies,
Dept. of Computer Science,
Univ. of Maryland, December 1992.
Technical Report UMIACS-TR-93-132.
ftp://ftp.cs.umd.edu/pub/papers/papers/ncstrl.umcp/CS-TR-3191/CS-TR-3191.ps.Z
- PW93
-
William Pugh, David Wonnacott.
An Exact Method for Analysis of Value-Based Array Data Dependence.
6th Intl. Workshop on Languages and Compilers for Parallel Computing,
pages 546-566, August 1993.
ftp://ftp.cs.umd.edu/pub/papers/papers/ncstrl.umcp/CS-TR-3196/CS-TR-3196.ps.Z
- PW94
-
William Pugh, David Wonnacott.
Counting Solutions to Presburger Formulas: How and Why.
Technical Report CS-TR-3234, University of Maryland Institute for
Advanced Computer Studies, March 1994.
http://www.cs.umd.edu/projects/omega/omega.html
ftp://ftp.cs.umd.edu/pub/papers/papers/3234/3234.ps.Z
- PW98
-
William Pugh, David Wonnacott.
Constraint-Based Array Dependence Analysis.
ACM Transactions on Programming Languages and Systems
20(3):635-678, May 1998.
http://triluminary.cs.haverford.edu/people/davew/array-analysis/WhatHowWhy.ps.gz
- QG97
-
Xiaolei Qian, Allen Goldberg.
Bounds Analysis by Abstract Interpretation.
in First Workshop on Automated Analysis of Programs, Paris, France, 1997.
ftp://ftp.kestrel.edu/pub/papers/goldberg/goldberg-AAS97.ps
- Rei79
-
John H. Reif.
Data Flow Analysis of Communicating Processes.
In 6th POPL, pages 257-268. ACM, 1979.
- Ram97
-
C. Ramalingam.
On sparse evaluation representations.
In Pascal Van Hentenryck, editor,
Proceedings from the 4th International Static Analysis Symposium,
number 1302 in Lecture Notes in Computer Science, pages 1--15. Springer-Verlag, 1997.
http://www.research.ibm.com/people/r/rama/Papers/ibmtr21245.ps
- Ram99
-
C. Ramalingam.
Identifying Loops in Almost Linear Time.
ACM Transactions on Programming Languages and Systems,
21(3):175-188, March 1999.
- RC87
-
Barbara G. Ryder, M.D. Carroll.
Incremental Data Flow Analysis via Attributes.
Technical Report LCSR-TR-93, Rutgers University, Dept. of Computer Science, New Jersey, June 1987.
- RHSR94
-
Thomas Reps, Susan Horwitz, Mooly Sagiv, Geneviève Rosay.
Speeding up Slicing.
SIGSOFT'94, pages 11-220. ACM, 1994.
http://www.cs.wisc.edu/wpis/papers/fse94.ps
- RK92
-
Uday S. Reddy, Samuel N. Kamin.
On the Power of Abstract Interpretation.
In IEEE, International Conference on Computer Languages, pages 24-33, 1992.
- RL77
-
John H. Reif, Harry R. Lewis.
Symbolic Evaluation and the Global Value Graph.
In 4th POPL, pages 104-118. ACM, 1977.
- RL86
-
John H. Reif, Harry R. Lewis.
Efficient Symbolic Analysis of Programs.
Journal of Computer and System Sciences, 32(3):280-314, June 1986.
- RLP90
-
Barbara G. Ryder, William Landi, Marvin C. Paull.
Profiling an Incremental Data Flow Analysis Algorithm.
IEEE-TSE, 16(6):129-140, February 1990.
- Ros77a
-
Barry K. Rosen.
Applications of High-Level Control Flow.
In 4th POPL, pages 38-47, Los Angeles, Calif., 1977.
- Ros77b
-
Barry K. Rosen.
High-Level Data Flow Frameworks.
CACM, 20(10):712-724, October 1977.
- Ros78
-
Barry K. Rosen.
Monoids for Rapid Data Flow Analysis.
In 5th POPL, pages 47-59, Tucson, 1978.
- Ros82
-
Barry K. Rosen.
A Lubricant for Data Flow Analysis.
SIAM J. Comput., 11(3), August 1982.
- RP86
-
Barbara G. Ryder, Marvin C. Paull.
Elimination Algorithms for Data Flow Analysis.
ACM Computing Surveys, 18(3):277-316, September 1986.
- RP88
-
Barbara G. Ryder, Marvin C. Paull.
Incremental Data Flow Analysis Algorithms.
ACM Transactions on Programming Languages and Systems,
10(1):1-50, January 1988.
- RR95
-
Thomas Reps, Geneviève Rosay.
Precise Interprocedural Slicing.
Software Engineering Notes, 20(4):41-52, October 1995.
- RT81
-
John H. Reif, Robert Endre Tarjan.
Symbolic Program Analysis in Almost Linear Time.
SIAM J. Comput., 11(1):81-93, February 1981.
- RWZ88
-
Barry K. Rosen, Mark N. Wegman, F.K. Zadeck.
Global Value Numbering and Redundant Computations.
In 15th POPL, pages 12-27. ACM, 1988.
- Ryd79
-
Barbara G. Ryder.
A Survey of Data Flow Analysis Techniques.
Technical Report DCS-TR-85, Rutgers University,
Dept. of Computer Science, New Jersey, December 1979.
- SAS98
-
Shamik Sharma, Anurag Acharya, Joel Saltz.
Deferred Data-Flow Analysis.
Technical Report TRCS98-38, University of California, Computer Science Department, Dec. 1998
ftp://ftp.cs.ucsb.edu/pub/techreports/TRCS98-38.ps
- SEFR89
-
S. Sagiv, O. Edelstein, N. Francez, M. Rodeh.
Resolving Circularity in Attribute Grammars with Application to Data Flow Analysis.
In 6th POPL, pages 36-48, 1989.
- SF94
-
A. Sabry, M. Felleisen.
Is Continuation-Passing Style Useful for Data Flow Analysis?
In PLDI, pages 1-12. ACM, 1994.
http://www.cs.uoregon.edu/~sabry/home.html
- SG95
-
Vugranam C. Sreedhar, Guang R. Gao.
A Linear Time Algorithm for Placing phi-nodes.
In POPL'95, pp 62-73, January 1995.
ACAPS Technical Memo 75, McGill University, October 1993.
ftp://ftp-acaps.cs.mcgill.ca/pub/doc/memos/memo75.ps.gz
- SGL93
-
Vugranam C. Sreedhar, Guang R. Gao, Yong-Fong Lee.
Efficient Data Flow Ananlysis Using DJ Graphs: Elimination Methods Revisited.
School of Computer Science, McGill University, Montréal.
ACAPS Technical Memo 93.
ftp://ftp-acaps.cs.mcgill.ca/pub/doc/memos/memo93.ps.gz
- SGL94
-
Vugranam C. Sreedhar, Guang R. Gao, Yong-Fong Lee.
An Efficient Incremental Algorithm for Maintaining Dominator Trees
and its Application to phi-Nodes Updates.
School of Computer Science, McGill University, Montréal.
ACAPS Technical Memo 77.
ftp://ftp-acaps.cs.mcgill.ca/pub/doc/memos/memo77.ps.gz
- SGL96
-
Vugranam C. Sreedhar, Guang R. Gao, Yong-Fong Lee.
Identifying Loops Using DJ Graphs.
TOPLAS, 18(6):649-658, November 1996.
ftp://ftp-acaps.cs.mcgill.ca/pub/doc/memos/memo98.ps.gz
- SMR90
-
R.C. Sekar, P. Misra, I.V. Ramakrishnan.
On the Power and Limitation of Strictness Based on Abstract Interpretation.
In 18th POPL, pages 37-48. ACM, 1990.
- SH97
-
Marc Shapiro, Susan Horwitz.
Fast and Accurate Flow-Insensitive Points-To Analysis.
In 24th POPL. ACM, 1997.
http://www.cs.wisc.edu/~horwitz/horwitz.html
- Sharir80
-
Micha Sharir.
Structural Analysis: a New Approach to Flow Analysis in Optimizing Compilers.
Computer Languages, 5(3-4):141-153, 1980.
- Sre95
-
Vugranam C. Sreedhar.
Efficient Program Analysis using DJ Graphs.
Ph.D. Thesis, School of Computer Science, McGill University, Montréal, September 1995.
http://www-acaps.cs.mcgill.ca/~sreedhar/
- SRW96
-
Mooly Sagiv, Thomas Reps, Reinhard Wilhelm.
Solving shape-analysis problems in languages with destructive updating.
In 23rd POPL, 1996.
http://www.cs.uchicago.edu/~sagiv/courses/shape.dvi
- SRW98
-
Mooly Sagiv, Thomas Reps, Reinhard Wilhelm.
Solving shape-analysis problems in languages with destructive updating.
ACM Transactions on Programming Languages and Systems, 20 (2), pp 1-50, March 1998.
http://www.cs.wisc.edu/wpis/papers/toplas98a.ps
- SS96
-
Jonas Skeppstedt, Per Stentrom.
Using Data Flow Analysis to Reduce Ownership Overhead in Cache Coherence Protocols.
TOPLAS, 18(6):659-682, November 1996.
- Ste91
-
Bernhard Steffen.
Generating Data Flow Analysis Algorithms from Modal Specifications.
Technical Report 91-31, RWTH Aachen, Fachgruppe Informatik, 1991.
ftp://ftp.uni-passau.de/pub/local/parallel/papers/dfams-scp.ps.Z
- Ste95
-
B. Steensgaard.
Sparse Functional Stores for Imperative Programs.
Technical Report MSR-TR-95-07, Microsoft Research, March 1995.
ftp://ftp.research.microsoft.com/pub/Tech-Reports/Winter94-95/TR-95-07.PS
- Ste96a
-
B. Steensgaard.
Points-to Analysis in Almost Linear Time.
POPL'96, pp 32-41, January 1996.
ftp://ftp.research.microsoft.com/users/rusa/popl96.ps
- Ste96b
-
B. Steensgaard.
Points-to Analysis by Type Inference of Programs with Structures and Unions.
International Conference on Compiler Construction,
pp 136-150, April 1996.
ftp://ftp.research.microsoft.com/users/rusa/cc96.ps
- Sto95
-
Eric James Stoltz.
Intermediate Compiler Analysis via Reference Chaining.
Ph.D. Thesis, Oregon Graduate Institute of Science and Technology,
Computer Science Department, January 1995.
Report N0.CS/E 95-TH-001
ftp://cse.ogi.edu/pub/tech-reports/1995/95-TH-001.ps.gz
- Str90
-
Jan Stransky.
A Lattice for Abstract Interpretation of Dynamic Lisp-like Structures.
Rapport de Recherche 90-03, École Polytechnique, Laboratoire d'Informatique, June 1990.
- Tar74
-
Robert Endre Tarjan.
Finding Dominators in Directed Graphs.
SIAM J. Comput., 3(1):62-89, March 1974.
- Tar81a
-
Robert Endre Tarjan.
Fast Algorithms for Solving Path Problems.
JACM, 28(3):594-614, July 1981.
- Tar81b
-
Robert Endre Tarjan.
A Unified Approach of Path Problems.
JACM, 28(3):577-593, July 1981.
- Tip95
-
Frank Tip.
A survey of program slicing techniques.
Journal of Programming Languages, 3(3), 1995.
ftp://ftp.cwi.nl/pub/gipe/reports/Tip94.ps.Z
- TH92
-
S. Tjiang, J. Hennessy.
Sharlit: A Tool for Building Optimizers.
SIGPLAN Notices, 27(7):82-93, July 1992. (PLDI'92).
http://suif.stanford.edu/papers/tjiang92.ps
- TP95
-
Peng Tu, David Padua.
Efficient Building and Placing of Gating Functions.
SIGPLAN Notices, 30(6):47-66, June 1995.
(PLDI'95).
http://polaris.cs.uiuc.edu/reports/1389.ps.gz
- Vol94
-
Jürgen Vollmer.
Dataflow Equations for Parallel Programs that Share Memory.
In POPL, 1994.
- Wad88
-
P. Wadler.
Strictness Analysis Aids Time Analysis.
In 15th POPL, pages 119-132. ACM, 1988.
- WCES94
-
D. Weise, R.F. Crew, M. Ernst, B. Steensgaard.
Value Dependence Graphs: Representations Without Taxation.
In 21st POPL. ACM, 1994.
ftp://ftp.research.microsoft.com/pub/analysts/vdg.ps
- Weg75
-
B. Wegbreit.
Property Extraction in Well-Founded Property Sets.
IEEE, Transactions on Software Engineering, SE-1(3):270-285,
1975.
- Weg83b
-
Mark N. Wegman.
Summarizing Graphs by Regular Expressions.
In 10th POPL, pages 203-216, Austin, Texas, January 1983.
- Weg83a
-
Mark N. Wegman.
Constant Propagation with Conditional Branches.
In 12th POPL, pages 203-216, Austin, Texas, January 1985.
- Wei80
-
W.E. Weihl.
Interprocedural Data Flow Analysis in the Presence of Pointers,
procedure variables, and label variables.
In 17th POPL, pages 83-94. ACM, 1980.
- Wei84
-
Mark Weiser.
Program Slicing.
IEEE Transactions on Software Engineering, SE-10(4):352-356, July 1984.
- Wis94
-
R. Wismüller.
Debugging of Globally Optimized Programs using Data Flow Analysis.
In PLDI, pages 278-289. ACM, 1994.
- WL95
-
Robert P. Wilson, Monica S. Lam.
Efficient Context-Sensitive Pointer Analysis for C programs.
In Programming Language Design and Implementation (PLDI), pages 1-12, 1995.
Paru dans SIGPLAN notices, vol 30, n0 6.
http://suif.stanford.edu/~bwilson/papers/pldi95/paper.html
http://suif.stanford.edu/papers/wilson95.ps
- Wil97
-
Robert P. Wilson.
Efficient Context-Sensitive Pointer Analysis For C Programs.
Ph.D. Thesis, Stanford University, Computer Systems Laboratory, December 1997.
http://suif.stanford.edu/papers/wilson97.ps
- WM94
-
Reinhard Wilhelm, Dieter Maurer.
Les compilateurs : théorie, construction, génération.
Masson, 1994.
- Wol91
-
Michael Wolfe.
Flow Graph Anomalies: What's in a Loop?.
Oregon Graduate Institute of Science and Technology
OGI Department of Computer Science and Engineering
February 1991, Technical Report CS/E 92-012
ftp://cse.ogi.edu/pub/tech-reports/1992/92-012.ps.gz
- Wol96
-
Michael Wolfe.
High Performance Compilers for Parallel Computing.
Addison-Wesley, 1996.
- Won99
-
David Wonnacott.
Constant propagation through Array Variables..
Technical Report 386, Rutgers University, June 1999.
ftp://www.cs.rutgers.edu/pub/technical-reports/dcs-tr-386.ps.Z
- WT92
-
Michael Wolfe, Chau-Wen Tseng.
The Power Test for Data Dependence.
IEEE Transactions on Parallel and Distributed Systems,
3(5), pp. 591-601, September 1992.
- WZ91
-
Mark N. Wegman, F.K. Zadeck.
Constant Propagation with Conditional Branches.
ACM Transactions on Programming Languages and Systems,
13(2):181-210, April 1991.
- Zad84
-
F.K. Zadeck.
Incremental Data Flow Analysis in a Structured Program Editor.
SIGPLAN Notices, 16(3):132-143, June 1984.
Proc. of ACM-SIGPLAN'84 Symposium on Compiler Construction.
- Zha98
-
Sean Zhang.
Practical Pointer Aliasing Analyses for C.
Ph.D. Thesis, Rutgers University, August 1998.
ftp://athos.rutgers.edu/pub/technical-reports/dcs-tr-367.ps.Z
- ZRL96
-
Sean Zhang, Barbara G. Ryder, William Landi.
Program Decomposition Pointer Analysis: a Step Toward Practical Analyses.
Software Engineering Notes, 21(6):81-92, November 1996.
SIGSOFT'96: 4th ACM-SIGSOFT Symposium on the Foundations of Software Programming.
http://www.prolangs.rutgers.edu/refs/docs/fse96.ps
ftp://athos.rutgers.edu/pub/technical-reports/lcsr-tr-259.ps.Z
François Thomasset