An efficient method of computing static single assignment form

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

An efficient method of computing static single assignment form

Full text

Pdf (1.24 MB)

Source

Annual Symposium on Principles of Programming Languages archive
Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages table of contents

Austin, Texas, United States

Pages: 25 - 35

Year of Publication: 1989

ISBN:0-89791-294-2

Authors

R. Cytron	IBM Research Division, T. J. Watson Research Center, Yorktown Heights, NY
J. Ferrante	IBM Research Division, T. J. Watson Research Center, Yorktown Heights, NY
B. K. Rosen	IBM Research Division, T. J. Watson Research Center, Yorktown Heights, NY
M. N. Wegman	IBM Research Division, T. J. Watson Research Center, Yorktown Heights, NY
F. K. Zadeck	Computer Science Dept., Brown University, Providence, RI

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 25, Downloads (12 Months): 130, Citation Count: 102

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/75277.75280 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	ABC+88	Frances Allen , Michael Burke , Philippe Charles , Ron Cytron , Jeanne Ferreant, An overview for the PTRAN analysis system for multiprocessing, Journal of Parallel and Distributed Computing, v.5 n.5, p.617-640, October 1988 [doi>10.1016/0743-7315(88)90015-9]
	AJ88	R. Allen , S. Johnson, Compiling C for vectorization, parallelization, and inline expansion, Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation, p.241-249, June 20-24, 1988, Atlanta, Georgia, United States
	AWZ88	B. Alpern , M. N. Wegman , F. K. Zadeck, Detecting equality of variables in programs, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.1-11, January 10-13, 1988, San Diego, California, United States [doi>10.1145/73560.73561]
	CF87a	R. Cytron and J. Ferrante. An improved control dependence algorithm. Technical Report RC 13291, IBM, 1987.
	CF87b	R. Cytron and J. Ferrante. What's in a name? Proc. 1987 International Conf. on Parallel Processing, pages 19-27, August 1987.
	CLZ86	Ron Cytron , Andy Lowry , F. Kenneth Zadeck, Code motion of control structures in high-level languages, Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.70-85, January 01, 1986, St. Petersburg Beach, Florida [doi>10.1145/512644.512651]
	FOW87	Jeanne Ferrante , Karl J. Ottenstein , Joe D. Warren, The program dependence graph and its use in optimization, ACM Transactions on Programming Languages and Systems (TOPLAS), v.9 n.3, p.319-349, July 1987 [doi>10.1145/24039.24041]
	Har85	D Harel, A linear algorithm for finding dominators in flow graphs and related problems, Proceedings of the seventeenth annual ACM symposium on Theory of computing, p.185-194, May 06-08, 1985, Providence, Rhode Island, United States [doi>10.1145/22145.22166]
	HPR88	S. Horwitz , J. Prins , T. Reps, Integrating non-intering versions of programs, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.133-145, January 10-13, 1988, San Diego, California, United States [doi>10.1145/73560.73572]
	LT79	Thomas Lengauer , Robert Endre Tarjan, A fast algorithm for finding dominators in a flowgraph, ACM Transactions on Programming Languages and Systems (TOPLAS), v.1 n.1, p.121-141, July 1979 [doi>10.1145/357062.357071]
	RL86	John H Reif , Harry R Lewis, Efficient symbolic analysis of programs, Journal of Computer and System Sciences, v.32 n.3, p.280-314, June 1986 [doi>10.1016/0022-0000(86)90031-0]
	RT82	J.H. Keif and R. E. Tarjan. Symbolic program analysis in almost linear time. SIAM J. Computing, 11(1):81-93, February 1982.
	RWZ88	B. K. Rosen , M. N. Wegman , F. K. Zadeck, Global value numbers and redundant computations, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.12-27, January 10-13, 1988, San Diego, California, United States [doi>10.1145/73560.73562]
	SBD+76	B.T. Smith, J. M. Boyle, J. J. Dongarra, B. S. Garbow, Y. Ikebe, V. C. Klema, and C. B. Moler. Matrix Eigensystem Routines - Eispack Guide. Springer-Verlag, 1976.
	SS70	R.M. Shapiro and H. Saint. The representation of algorithms. Technical Report CA-7002-1432, Massachusetts Computer Associates, February 1970.
	Tar74	R.E. Tarjan. Finding dominators in directed graphs. SIAM J. Com?uting, 3(1):62-89, 1974.
	WZ85	Mark N. Wegman , Frank Kenneth Zadeck, Constant propagation with conditional branches, Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.291-299, January 14-16, 1985, New Orleans, Louisiana, United States [doi>10.1145/318593.318659]
	WZ88	Mark N. Wegman , F. K Zadeck, Constant Propagation with Conditional Branches, Brown University, Providence, RI, 1991

CITED BY 102

	Lori Carter , Beth Simon , Brad Calder , Larry Carter , Jeanne Ferrante, Path Analysis and Renaming for Predicated Instruction Scheduling, International Journal of Parallel Programming, v.28 n.6, p.563-588, December 2000
	Cliff Click, Global code motion/global value numbering, ACM SIGPLAN Notices, v.30 n.6, p.246-257, June 1995
	Siddhartha Chatterjee, Compiling nested data-parallel programs for shared-memory multiprocessors, ACM Transactions on Programming Languages and Systems (TOPLAS), v.15 n.3, p.400-462, July 1993
	K. Kennedy , K. S. McKinley , C. W. Tseng, Interactive Parallel Programming using the ParaScope Editor, IEEE Transactions on Parallel and Distributed Systems, v.2 n.3, p.329-341, July 1991
	William G. Griswold , David Notkin, Automated assistance for program restructuring, ACM Transactions on Software Engineering and Methodology (TOSEM), v.2 n.3, p.228-269, July 1993
	Patricia Prather Pineo , Mary Lou Soffa, Debugging parallelized code using code liberation techniques, ACM SIGPLAN Notices, v.26 n.12, p.108-119, Dec. 1991
	R. Cytron , M. Hind , W. Hsieh, Automatic generation of DAG parallelism, ACM SIGPLAN Notices, v.24 n.7, p.54-68, July 1989
	Preston Briggs , Linda Torczon, An efficient representation for sparse sets, ACM Letters on Programming Languages and Systems (LOPLAS), v.2 n.1-4, p.59-69, March–Dec. 1993
	Cliff Click , Keith D. Cooper, Combining analyses, combining optimizations, ACM Transactions on Programming Languages and Systems (TOPLAS), v.17 n.2, p.181-196, March 1995
	Keshav Pingali , Micah Beck , Richard Johnson , Mayan Moudgill , Paul Stodghill, Dependence flow graphs: an algebraic approach to program dependencies, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.67-78, January 21-23, 1991, Orlando, Florida, United States
	Benoît Dupont de Dinechin, StaCS: a Static Control Superscalar architecture, ACM SIGMICRO Newsletter, v.23 n.1-2, p.282-291, Dec. 1992
	Apostolos A. Kountouris , Christophe Wolinski, Efficient scheduling of conditional behaviors for high-level synthesis, ACM Transactions on Design Automation of Electronic Systems (TODAES), v.7 n.3, p.380-412, July 2002
	Dhananjay M. Dhamdhere , Barry K. Rosen , F. Kenneth Zadeck, How to analyze large programs efficiently and informatively, ACM SIGPLAN Notices, v.27 n.7, p.212-223, July 1992
	Jong-Deok Choi , Ron Cytron , Jeanne Ferrante, Automatic construction of sparse data flow evaluation graphs, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.55-66, January 21-23, 1991, Orlando, Florida, United States
	A. Rogers , K. Pingali, Compiling for Distributed Memory Architectures, IEEE Transactions on Parallel and Distributed Systems, v.5 n.3, p.281-298, March 1994
	Guido Araujo , Guilherme Ottoni , Marcelo Cintra, Global array reference allocation, ACM Transactions on Design Automation of Electronic Systems (TODAES), v.7 n.2, p.336-357, April 2002
	Shlomit S. Pinter , Ron Y. Pinter, Program optimization and parallelization using idioms, ACM Transactions on Programming Languages and Systems (TOPLAS), v.16 n.3, p.305-327, May 1994
	Joel Auslander , Matthai Philipose , Craig Chambers , Susan J. Eggers , Brian N. Bershad, Fast, effective dynamic compilation, ACM SIGPLAN Notices, v.31 n.5, p.149-159, May 1996
	Karl J. Ottenstein , Robert A. Ballance , Arthur B. MacCabe, The program dependence web: a representation supporting control-, data-, and demand-driven interpretation of imperative languages, ACM SIGPLAN Notices, v.25 n.6, p.257-271, Jun. 1990
	Silvius Rus , Lawrence Rauchwerger , Jay Hoeflinger, Hybrid analysis: static & dynamic memory reference analysis, Proceedings of the 16th international conference on Supercomputing, June 22-26, 2002, New York, New York, USA
	Andrew Begel , Steven McCanne , Susan L. Graham, BPF+: exploiting global data-flow optimization in a generalized packet filter architecture, ACM SIGCOMM Computer Communication Review, v.29 n.4, p.123-134, Oct. 1999
	Massimiliano Poletto , Vivek Sarkar, Linear scan register allocation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.21 n.5, p.895-913, Sept. 1999
	Raja Vallée-Rai , Phong Co , Etienne Gagnon , Laurie Hendren , Patrick Lam , Vijay Sundaresan, Soot - a Java bytecode optimization framework, Proceedings of the 1999 conference of the Centre for Advanced Studies on Collaborative research, p.13, November 08-11, 1999, Mississauga, Ontario, Canada
	Todd B. Knoblock , Jakob Rehof, Type elaboration and subtype completion for Java bytecode, Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.228-242, January 19-21, 2000, Boston, MA, USA
	Robert Bernecky, EGREGION: a branch coverage tool for APL, ACM SIGAPL APL Quote Quad, v.29 n.3, p.3-14, March 1999
	Monica S. Lam , Robert P. Wilson, Limits of control flow on parallelism, ACM SIGARCH Computer Architecture News, v.20 n.2, p.46-57, May 1992
	Denis Barthou , Albert Cohen , Jean-François Collard, Maximal static expansion, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.98-106, January 19-21, 1998, San Diego, California, United States
	Steven Lucco, A dynamic scheduling method for irregular parallel programs, ACM SIGPLAN Notices, v.27 n.7, p.200-211, July 1992
	Martin Odersky, How to make destructive updates less destructive, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.25-36, January 21-23, 1991, Orlando, Florida, United States
	Wuu Yang , Susan Horwitz , Thomas Reps, A program integration algorithm that accommodates semantics-preserving transformations, ACM SIGSOFT Software Engineering Notes, v.15 n.6, p.133-143, Dec. 1990
	Silvius Rus , Lawrence Rauchwerger , Jay Hoeflinger, Hybrid analysis: static & dynamic memory reference analysis, Proceedings of the 16th international conference on Supercomputing, June 22-26, 2002, New York, New York, USA
	Robert P. Wilson , Monica S. Lam, Efficient context-sensitive pointer analysis for C programs, ACM SIGPLAN Notices, v.30 n.6, p.1-12, June 1995
	V. Sarkar, Determining average program execution times and their variance, ACM SIGPLAN Notices, v.24 n.7, p.298-312, July 1989
	Cormac Flanagan , James B. Saxe, Avoiding exponential explosion: generating compact verification conditions, ACM SIGPLAN Notices, v.36 n.3, p.193-205, March 2001
	Brian Grant , Markus Mock , Matthai Philipose , Craig Chambers , Susan J. Eggers, Annotation-directed run-time specialization in C, ACM SIGPLAN Notices, v.32 n.12, p.163-178, Dec. 1997
	Donglin Liang , Mary Jean Harrold, Equivalence analysis: a general technique to improve the efficiency of data-flow analyses in the presence of pointers, ACM SIGSOFT Software Engineering Notes, v.24 n.5, p.39-46, Sept. 1999
	Rajiv Gupta, Generalized dominators and post-dominators, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.246-257, January 19-22, 1992, Albuquerque, New Mexico, United States
	William G. Griswold, Direct update of data flow representations for a meaning-preserving program restructuring tool, ACM SIGSOFT Software Engineering Notes, v.18 n.5, p.42-55, Dec. 1993
	Sorin Lerner , David Grove , Craig Chambers, Composing dataflow analyses and transformations, ACM SIGPLAN Notices, v.37 n.1, p.270-282, Jan. 2002
	Wolfram Amme , Niall Dalton , Jeffery von Ronne , Michael Franz, SafeTSA: a type safe and referentially secure mobile-code representation based on static single assignment form, ACM SIGPLAN Notices, v.36 n.5, p.137-147, May 2001
	Ron Cytron , Jeanne Ferrante , V. Sarkar, Compact representations for control dependence, ACM SIGPLAN Notices, v.25 n.6, p.337-351, Jun. 1990
	Ken Kennedy , Kathryn S. McKinley , Chau-Wen Tseng, Analysis and transformation in the ParaScope editor, Proceedings of the 5th international conference on Supercomputing, p.433-447, June 17-21, 1991, Cologne, West Germany
	David W. Goodwin, Interprocedural dataflow analysis in an executable optimizer, ACM SIGPLAN Notices, v.32 n.5, p.122-133, May 1997
	Rastislav Bodík , Rajiv Gupta, Partial dead code elimination using slicing transformations, ACM SIGPLAN Notices, v.32 n.5, p.159-170, May 1997
	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 (TOPLAS), v.17 n.1, p.85-122, Jan. 1995
	Vugranam C. Sreedhar , Guang R. Gao, A linear time algorithm for placing &phgr;-nodes, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.62-73, January 23-25, 1995, San Francisco, California, United States
	Michael Burke , Jong-Deok Choi, Precise and efficient integration of interprocedural alias information into data-flow analysis, ACM Letters on Programming Languages and Systems (LOPLAS), v.1 n.1, p.14-21, March 1992
	Kevin B. Theobald , Guang R. Gao , Laurie J. Hendren, Speculative execution and branch prediction on parallel machines, Proceedings of the 7th international conference on Supercomputing, p.77-86, July 19-23, 1993, Tokyo, Japan
	G. Ramalingam, On sparse evaluation representations, Theoretical Computer Science, v.277 n.1-2, p.119-147, April 28, 2002
	Jong-Deok Choi , R. Cytron , J. Ferrante, On the Efficient Engineering of Ambitious Program Analysis, IEEE Transactions on Software Engineering, v.20 n.2, p.105-114, February 1994
	Richard Johnson , Keshav Pingali, Dependence-based program analysis, ACM SIGPLAN Notices, v.28 n.6, p.78-89, June 1993
	David R. Chase , Mark Wegman , F. Kenneth Zadeck, Analysis of pointers and structures, ACM SIGPLAN Notices, v.25 n.6, p.296-310, Jun. 1990
	Wuu Yang , Susan Horwitz , Thomas Reps, A program integration algorithm that accommodates semantics-preserving transformations, ACM Transactions on Software Engineering and Methodology (TOSEM), v.1 n.3, p.310-354, July 1992
	Akira Koseki , Hideaki Komatsu , Yoshiaki Fukazawa, A register allocation technique using guarded PDG, Proceedings of the 10th international conference on Supercomputing, p.270-277, May 25-28, 1996, Philadelphia, Pennsylvania, United States
	Daniel Weise , Roger F. Crew , Michael Ernst , Bjarne Steensgaard, Value dependence graphs: representation without taxation, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.297-310, January 16-19, 1994, Portland, Oregon, United States
	Brian Grant , Matthai Philipose , Markus Mock , Craig Chambers , Susan J. Eggers, An evaluation of staged run-time optimizations in DyC, ACM SIGPLAN Notices, v.34 n.5, p.293-304, May 1999
	Christopher Lapkowski , Laurie J. Hendren, Extended SSA numbering: introducing SSA properties to languages with multi-level pointers, Proceedings of the 1996 conference of the Centre for Advanced Studies on Collaborative research, p.23, November 12-14, 1996, Toronto, Ontario, Canada
	David Callahan , Brian Koblenz, Register allocation via hierarchical graph coloring, ACM SIGPLAN Notices, v.26 n.6, p.192-203, June 1991
	Todd B. Knoblock , Jakob Rehof, Type elaboration and subtype completion for Java bytecode, ACM Transactions on Programming Languages and Systems (TOPLAS), v.23 n.2, p.243-272, March 2001
	David Bernstein , Michael Rodeh, Global instruction scheduling for superscalar machines, ACM SIGPLAN Notices, v.26 n.6, p.241-255, June 1991
	G. Ramalingam , Thomas Reps, An incremental algorithm for maintaining the dominator tree of a reducible flowgraph, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.287-296, January 16-19, 1994, Portland, Oregon, United States
	Ronald Veldema , J. H. Ceriel , F. H. Rutger , E. Henri, Object combining: A new aggressive optimization for object intensive programs, Proceedings of the 2002 joint ACM-ISCOPE conference on Java Grande, p.165-174, November 03-05, 2002, Seattle, Washington, USA
	Adam Kaplan , Philip Brisk , Ryan Kastner, Data communication estimation and reduction for reconfigurable systems, Proceedings of the 40th conference on Design automation, June 02-06, 2003, Anaheim, CA, USA
	Jason Cong , Yiping Fan , Guoling Han , Ashok Jagannathan , Glenn Reinman , Zhiru Zhang, Instruction set extension with shadow registers for configurable processors, Proceedings of the 2005 ACM/SIGDA 13th international symposium on Field-programmable gate arrays, February 20-22, 2005, Monterey, California, USA
	Susan Horwitz , Thomas Reps, The use of program dependence graphs in software engineering, Proceedings of the 14th international conference on Software engineering, p.392-411, May 11-15, 1992, Melbourne, Australia
	Susan Horwitz, Identifying the semantic and textual differences between two versions of a program, ACM SIGPLAN Notices, v.25 n.6, p.234-245, Jun. 1990
	Richard A. Huff, Lifetime-sensitive modulo scheduling, ACM SIGPLAN Notices, v.28 n.6, p.258-267, June 1993
	Allen Leung , Lal George, Static single assignment form for machine code, ACM SIGPLAN Notices, v.34 n.5, p.204-214, May 1999
	Soo-Mook Moon , Kemal Ebcioğlu, An efficient resource-constrained global scheduling technique for superscalar and VLIW processors, ACM SIGMICRO Newsletter, v.23 n.1-2, p.55-71, Dec. 1992
	Shlomit S. Pinter , Ron Y. Pinter, Program optimization and parallelization using idioms, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.79-92, January 21-23, 1991, Orlando, Florida, United States
	Brian Grant , Markus Mock , Matthai Philipose , Craig Chambers , Susan J. Eggers, The benefits and costs of DyC's run-time optimizations, ACM Transactions on Programming Languages and Systems (TOPLAS), v.22 n.5, p.932-972, Sept. 2000
	Donglin Liang , Mary Jean Harrold, Equivalence analysis and its application in improving the efficiency of program slicing, ACM Transactions on Software Engineering and Methodology (TOSEM), v.11 n.3, p.347-383, July 2002
	David Chase , Mark Wegman , F. Ken Zadeck, Analysis of pointers and structures, ACM SIGPLAN Notices, v.39 n.4, April 2004
	Brian Grant , Matthai Philipose , Markus Mock , Craig Chambers , Susan J. Eggers, A retrospective on: "an evaluation of staged run-time optimizations in DyC", ACM SIGPLAN Notices, v.39 n.4, April 2004
	David Binkley, Semantics Guided Regression Test Cost Reduction, IEEE Transactions on Software Engineering, v.23 n.8, p.498-516, August 1997
	Silvius Rus , Lawrence Rauchwerger , Jay Hoeflinger, Hybrid analysis: static & dynamic memory reference analysis, International Journal of Parallel Programming, v.31 n.4, p.251-283, August 2003
	Wolfram Amme , Peter Braun , François Thomasset , Eberhard Zehendner, Data Dependence Analysis of Assembly Code, International Journal of Parallel Programming, v.28 n.5, p.431-467, Oct. 2000
	K. Rustan M. Leino, Efficient weakest preconditions, Information Processing Letters, v.93 n.6, p.281-288, 31 March 2005
	Vijay S. Menon , Neal Glew , Brian R. Murphy , Andrew McCreight , Tatiana Shpeisman , Ali-Reza Adl-Tabatabai , Leaf Petersen, A verifiable SSA program representation for aggressive compiler optimization, ACM SIGPLAN Notices, v.41 n.1, p.397-408, January 2006
	Samuel Z. Guyer , Calvin Lin, Error checking with client-driven pointer analysis, Science of Computer Programming, v.58 n.1-2, p.83-114, October 2005
	Sebastian Hunt , David Sands, On flow-sensitive security types, ACM SIGPLAN Notices, v.41 n.1, p.79-90, January 2006
	Sebastian Hack , Gerhard Goos, Optimal register allocation for SSA-form programs in polynomial time, Information Processing Letters, v.98 n.4, p.150-155, 31 May 2006
	Ryan Kastner , Wenrui Gong , Xin Hao , Forrest Brewer , Adam Kaplan , Philip Brisk , Majid Sarrafzadeh, Layout driven data communication optimization for high level synthesis, Proceedings of the conference on Design, automation and test in Europe: Proceedings, March 06-10, 2006, Munich, Germany
	Lian Li , Quan Hoang Nguyen , Jingling Xue, Scratchpad allocation for data aggregates in superperfect graphs, ACM SIGPLAN Notices, v.42 n.7, July 2007
	Arnoldo José Müller Molina , Takeshi Shinohara, On approximate matching of programs for protecting libre software, Proceedings of the 2006 conference of the Center for Advanced Studies on Collaborative research, October 16-19, 2006, Toronto, Ontario, Canada
	Silvius Rus , Guobin He , Christophe Alias , Lawrence Rauchwerger, Region array SSA, Proceedings of the 15th international conference on Parallel architectures and compilation techniques, September 16-20, 2006, Seattle, Washington, USA
	Sigmund Cherem , Lonnie Princehouse , Radu Rugina, Practical memory leak detection using guarded value-flow analysis, ACM SIGPLAN Notices, v.42 n.6, June 2007
	David J. Pearce , Paul H. J. Kelly , Chris Hankin, Online Cycle Detection and Difference Propagation: Applications to Pointer Analysis, Software Quality Control, v.12 n.4, p.311-337, December 2004
	Aaron Smith , Jon Gibson , Bertrand Maher , Nick Nethercote , Bill Yoder , Doug Burger , Kathryn S. McKinle , Jim Burrill, Compiling for EDGE Architectures, Proceedings of the International Symposium on Code Generation and Optimization, p.185-195, March 26-29, 2006
	Mary Jean Harrold , James A. Jones , Gregg Rothermel, Empirical Studies of Control Dependence Graph Size forC Programs, Empirical Software Engineering, v.3 n.2, p.203-211, 1998
	Jason Cong , Yiping Fan , Guoling Han , Xun Yang , Zhiru Zhang, Architectural Synthesis Integrated with Global Placement for Multi-Cycle Communication, Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design, p.536, November 09-13, 2003
	Richard D. Ferrante , James R. Allard, Introducing a CPS style optimizer into an existing compiler, ACM SIGPLAN Notices, v.31 n.12, p.73-79, Dec. 1996
	Newton Cheung , Sri Parameswaran , Jörg Henkel , Jeremy Chan, MINCE: Matching INstructions Using Combinational Equivalence for Extensible Processor, Proceedings of the conference on Design, automation and test in Europe, p.21020, February 16-20, 2004
	Vugranam C. Sreedhar , Guang R. Gao , Yong-fong Lee, Incremental computation of dominator trees, ACM SIGPLAN Notices, v.30 n.3, p.1-12, March 1993
	Cliff Click , Michael Paleczny, A simple graph-based intermediate representation, ACM SIGPLAN Notices, v.30 n.3, p.35-49, March 1993
	Erik Ruf, Optimizing sparse representations for dataflow analysis, ACM SIGPLAN Notices, v.30 n.3, p.50-61, March 1993
	Ross Tate , Michael Stepp , Zachary Tatlock , Sorin Lerner, Equality saturation: a new approach to optimization, Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, January 21-23, 2009, Savannah, GA, USA
	Quan Hoang Nguyen , Bernhard Scholz, Computing SSA Form with Matrices, Electronic Notes in Theoretical Computer Science (ENTCS), v.190 n.1, p.121-132, July, 2007
	Yi Fang , Lenore D. Zuck, Improved Invariant Generation for Tvoc, Electronic Notes in Theoretical Computer Science (ENTCS), v.176 n.3, p.21-35, July, 2007
	Guoqing Xu , Atanas Rountev , Yan Tang , Feng Qin, Efficient checkpointing of java software using context-sensitive capture and replay, Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering, September 03-07, 2007, Dubrovnik, Croatia
	Robert Bernecky, Shape cliques, ACM SIGAPL APL Quote Quad, v.35 n.3, p.7-17, September 2007
	Nomair A. Naeem , Ondrej Lhoták, Efficient alias set analysis using SSA form, Proceedings of the 2009 international symposium on Memory management, June 19-20, 2009, Dublin, Ireland