Abstract
In this chapter we show that we can detect copy constants and eliminate faint code in parallel flow graphs completely–relative to the non-atomic semantics of Chapter 6. The basic idea is to evaluate the constraint system for bridging runs from Chapter 5 over the complete lattice (AD,\(\sqsubseteq\)) from the previous chapter and to exploit this information.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Müller-Olm, M. (2006). 8. Detecting Copy Constants and Eliminating Faint Code. In: Variations on Constants. Lecture Notes in Computer Science, vol 3800. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11871743_8
Download citation
DOI: https://doi.org/10.1007/11871743_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45385-7
Online ISBN: 978-3-540-45386-4
eBook Packages: Computer ScienceComputer Science (R0)