Article

Free access

Detecting equality of variables in programs

Authors:

B. Alpern,

M. N. Wegman,

F. K. ZadeckAuthors Info & Claims

POPL '88: Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Pages 1 - 11

https://doi.org/10.1145/73560.73561

Published: 13 January 1988 Publication History

PDF eReader

References

[1]

M. Auslander and M. Hopkins. An overview of the PL.8 compiler. Proc. SIGPLAN'82 Syrup. on Compiler Constrnction, i7(6):22-31, June 1982.

Digital Library

Google Scholar

[2]

A.V. Aho, J. E. Hoperoft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.

Digital Library

Google Scholar

[3]

F.E. Allen. Control flow analysis. Sigplan Notices, July 1970.

Digital Library

Google Scholar

[4]

B.S. Baker. An algorithm for structuring flowgraphs. J. A CM, 98-120, January 1977.

Digital Library

Google Scholar

[5]

J. Cocke and J. T. Schwartz. Programming Languages and Their Compilers; Preliminary Notes. Courant Institute of Mathematical Sciences, New York University, April 1970.

Digital Library

Google Scholar

[6]

3. Ferrante, K. J. Ottenstein, and J. D. Warren. A program dependance graph and it's use in optimization. A CM Trans. on Programming Languages and Systems, 9(3):319-349, July 1987.

Digital Library

Google Scholar

[7]

S.L. Graham and M. Wegman. A fast and usually linear algorithm for global flow analysis. J. ACM, 23(1):172-202, January 1976.

Digital Library

Google Scholar

[8]

J. Hopcroft. An n log n algorithm for minimizing the states of a finite automaton. The Theory of Machines and Computations, 189-196, 1971.

Crossref

Google Scholar

[9]

L.L. Pollock. An Approach to Incremental Compilation of Optimized Code. PhD thesis, Department of Computer Science, University of Pittsburgh, Pittsburgh, Pa. 15260, 1986.

Digital Library

Google Scholar

[10]

J.H. Reif and H. R. Lewis. Symbolic evaluation and the global value graph. Conf. Rec. Fourth A CM Symp. on Principles of Programming Languages, 104-118, January 1977.

Digital Library

Google Scholar

[11]

J.H. Reif and H. R. Lewis. Efficen* Symbolic Analysis of Programs. Technical Report TR-37- 82, Harvard University, Aiken Computation Laboratory, 33 Oxford St.,Cambridge, Mass 02138, 1982.

Google Scholar

[12]

J.H. Reif and R. E. Tarjan. Symbolic program analysis in almost linear time. SIAM J. Computing, 11(1):81-93, February 1982.

Crossref

Google Scholar

[13]

B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Global value numbers and redundant computations. Conf. Rec. Fifteenth ACM Symp. on Principles of Programming Languages, Janaary 1988.

Digital Library

Google Scholar

[14]

M. Sharir. Structural analysis: a new approach to flow analysis in optimizing compilers. Computer Languages, 5:141-153, 1980.

Digital Library

Google Scholar

[15]

R.M. Shapiro and H. Saint. The Representation of Algorithms. Technical Report CA-7002-1432, Massachusetts Computer Associates, February 1970.

Google Scholar

[16]

B. Wegbreit. Property extraction in well-founded property sets. IEEE Trans. on Software Engineering, SE-1(3):270-285, September 1975.

Digital Library

Google Scholar

[17]

M. Wegman and F. K. Zadeck. Constant propagation with conditional branches. Conf. Rec. Twelfth A CM Symp. on Principles of Programming Languages, 291-299, january 1985.

Digital Library

Google Scholar

Cited By

View all

Li TBai JSui YHu S(2024)SPATA: Effective OS Bug Detection with Summary-Based, Alias-Aware, and Path-Sensitive Typestate AnalysisACM Transactions on Computer Systems10.1145/369525042:3-4(1-40)Online publication date: 6-Sep-2024
https://dl.acm.org/doi/10.1145/3695250
Venev HGehr TDimitrov DVechev M(2024)Modular Synthesis of Efficient Quantum UncomputationProceedings of the ACM on Programming Languages10.1145/36897858:OOPSLA2(2097-2124)Online publication date: 8-Oct-2024
https://dl.acm.org/doi/10.1145/3689785
Högberg JFernandez-Reyes KVoinea A(2024)Modeling Erlang Compiler IR as SMT FormulasProceedings of the 23rd ACM SIGPLAN International Workshop on Erlang10.1145/3677995.3678193(45-54)Online publication date: 28-Aug-2024
https://dl.acm.org/doi/10.1145/3677995.3678193
Show More Cited By

Index Terms

Detecting equality of variables in programs

Recommendations

Semismooth SQP method for equality-constrained optimization problems with an application to the lifted reformulation of mathematical programs with complementarity constraints
Advances in Shape and Topology Optimization: Theory, Numerics and New Applications Areas

We consider the sequential quadratic programming (SQP) algorithm applied to equality-constrained optimization problems, where the problem data is differentiable with Lipschitz-continuous first derivatives. For this setting, Dennis-More-type analysis of ...
Quasi-Newton acceleration for equality-constrained minimization

Optimality (or KKT) systems arise as primal-dual stationarity conditions for constrained optimization problems. Under suitable constraint qualifications, local minimizers satisfy KKT equations but, unfortunately, many other stationary points (including, ...
Iterative Optimization with Equality Constraints

<P>We discuss certain globally convergent iterative procedures for determining an “extremal” of a nonconvex optimization problem with a finite number of equality constraints and infinite-dimensional inclusion constraints. These procedures are designed ...

Comments

Information & Contributors

Information

Published In

POPL '88: Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

January 1988

329 pages

ISBN:0897912527

DOI:10.1145/73560

Chairmen:
J. Ferrante
IBM T. J. Watson Research Center
,
P. Mager

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 January 1988

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

POPL88

Sponsor:

POPL88: POPL'88 Symposium on Principles of Programming

January 10 - 13, 1988

California, San Diego, USA

Acceptance Rates

POPL '88 Paper Acceptance Rate 28 of 177 submissions, 16%;

Overall Acceptance Rate 824 of 4,130 submissions, 20%

Upcoming Conference

POPL '25

Sponsor:
sigplan

The 52nd Annual ACM SIGPLAN Symposium on Principles of Programming Languages

January 19 - 25, 2025

Denver , CO , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

275
Total Citations
View Citations
2,920
Total Downloads

Downloads (Last 12 months)208
Downloads (Last 6 weeks)27

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Li TBai JSui YHu S(2024)SPATA: Effective OS Bug Detection with Summary-Based, Alias-Aware, and Path-Sensitive Typestate AnalysisACM Transactions on Computer Systems10.1145/369525042:3-4(1-40)Online publication date: 6-Sep-2024
https://dl.acm.org/doi/10.1145/3695250
Venev HGehr TDimitrov DVechev M(2024)Modular Synthesis of Efficient Quantum UncomputationProceedings of the ACM on Programming Languages10.1145/36897858:OOPSLA2(2097-2124)Online publication date: 8-Oct-2024
https://dl.acm.org/doi/10.1145/3689785
Högberg JFernandez-Reyes KVoinea A(2024)Modeling Erlang Compiler IR as SMT FormulasProceedings of the 23rd ACM SIGPLAN International Workshop on Erlang10.1145/3677995.3678193(45-54)Online publication date: 28-Aug-2024
https://dl.acm.org/doi/10.1145/3677995.3678193
Li KXue YChen SLiu HSun KHu MWang HLiu YChen Y(2024)Static Application Security Testing (SAST) Tools for Smart Contracts: How Far Are We?Proceedings of the ACM on Software Engineering10.1145/36607721:FSE(1447-1470)Online publication date: 12-Jul-2024
https://dl.acm.org/doi/10.1145/3660772
Lesbre DLemerre M(2024)Compiling with Abstract InterpretationProceedings of the ACM on Programming Languages10.1145/36563928:PLDI(368-393)Online publication date: 20-Jun-2024
https://dl.acm.org/doi/10.1145/3656392
Li JGao WLi YHan L(2024)An Improved Method for Control Dependency in LLVM2024 5th International Conference on Intelligent Computing and Human-Computer Interaction (ICHCI)10.1109/ICHCI63580.2024.10808046(291-294)Online publication date: 27-Sep-2024
https://doi.org/10.1109/ICHCI63580.2024.10808046
McMichen TGreiner NZhong PSossai FPatel ACampanoni SGrosser TDubach CSteuwer MXue JOttoni GQuintão Pereira F(2024)Representing Data Collections in an SSA FormProceedings of the 2024 IEEE/ACM International Symposium on Code Generation and Optimization10.1109/CGO57630.2024.10444817(308-321)Online publication date: 2-Mar-2024
https://dl.acm.org/doi/10.1109/CGO57630.2024.10444817
Yanase YSumikawa Y(2023)Lazy Demand-driven Partial Redundancy EliminationJournal of Information Processing10.2197/ipsjjip.31.45931(459-468)Online publication date: 2023
https://doi.org/10.2197/ipsjjip.31.459
Sugita SKoizumi TShioya RIrie HSakai SVerbrugge CLhoták OShen X(2023)A Sound and Complete Algorithm for Code Generation in Distance-Based ISAProceedings of the 32nd ACM SIGPLAN International Conference on Compiler Construction10.1145/3578360.3580263(73-84)Online publication date: 17-Feb-2023
https://dl.acm.org/doi/10.1145/3578360.3580263
Herklotz YDemange DBlazy SKrebbers RTraytel DPientka BZdancewic S(2023)Mechanised Semantics for Gated Static Single AssignmentProceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs10.1145/3573105.3575681(182-196)Online publication date: 11-Jan-2023
https://dl.acm.org/doi/10.1145/3573105.3575681
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Semismooth SQP method for equality-constrained optimization problems with an application to the lifted reformulation of mathematical programs with complementarity constraints

Quasi-Newton acceleration for equality-constrained minimization

Iterative Optimization with Equality Constraints

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Semismooth SQP method for equality-constrained optimization problems with an application to the lifted reformulation of mathematical programs with complementarity constraints

Quasi-Newton acceleration for equality-constrained minimization

Iterative Optimization with Equality Constraints

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations