On the complexity of constant propagation

DOI10.1007/3-540-45309-1_13MaRDI QIDQ2763673zbMATH OpenFDO

Authors Markus Müller-Olm, Oliver Rüthing

Publication date 21 January 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2028/20280190

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Polynomial constants are decidable
• scientific article; zbMATH DE number 17825
• Precise interprocedural dependence analysis of parallel programs
• Finite constants: Characterizations of a new decidable set of constants
• Precise interprocedural dataflow analysis with applications to constant propagation

Cited in

(8)

• Finite constants: Characterizations of a new decidable set of constants
• Computing polynomial program invariants
• Analysing All Polynomial Equations in ${\mathbb Z_{2^w}}$
• scientific article; zbMATH DE number 17825 (Why is no real title available?)
• Polynomial constants are decidable
• Anytime possibilistic propagation algorithm
• Precise interprocedural dataflow analysis with applications to constant propagation
• Abstract semantic dependency

This page was built for publication: On the complexity of constant propagation

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