A polynomial-time algorithm for global value numbering

DOI10.1016/j.scico.2006.03.005zbMath1171.68420OpenAlexW2154811764MaRDI QIDQ859961

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) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

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