A polynomial-time algorithm for global value numbering

DOI10.1016/J.SCICO.2006.03.005MaRDI QIDQ859961zbMATH OpenOpenAlexFDO

Authors Sumit Gulwani, George C. Necula

Publication date 22 January 2007

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.scico.2006.03.005

zbMATH Keywords

abstract interpretationglobal value numberingHerbrand equivalencesuninterpreted functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of compilers and interpreters (68N20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Static Analysis
• Global value numbering using random interpretation
• scientific article; zbMATH DE number 1487856
• A Fast and Usually Linear Algorithm for Global Flow Analysis
• Compiler Construction

Cited in

(3)

• Global value numbering using random interpretation
• Static Analysis
• Detection of redundant expressions: a precise, efficient, and pragmatic algorithm in SSA

This page was built for publication: A polynomial-time algorithm for global value numbering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q859961)