Staff View
Constant propagation through array variables

Descriptive

Language
LanguageTerm (authority = ISO 639-3:2007); (type = text)
English
Genre (authority = RULIB-FS)
Other
Genre (authority = marcgt)
technical report
PhysicalDescription
InternetMediaType
application/pdf
Extent
1 online resource (13 pages)
Note (type = special display note)
Technical report DCS-TR-386
Name (authority = RutgersOrg-School); (type = corporate)
NamePart
School of Arts and Sciences (SAS) (New Brunswick)
Name (authority = RutgersOrg-Department); (type = corporate)
NamePart
Computer Science (New Brunswick)
TypeOfResource
Text
TitleInfo
Title
Constant propagation through array variables
Subject (authority = local)
Topic
Constant propagation
Subject (authority = local)
Topic
Dead code elimination
Subject (authority = local)
Topic
Forward substitution
Subject (authority = local)
Topic
Static analysis
Subject (authority = local)
Topic
Value-based array dependences
Abstract (type = abstract)
Constant propagation and provide significant improvements in program speed, both by directly enabling optimizations such as constant folding and algebraic simplification and by providing information that in- releases the effectiveness of other compile-time analyses. This technique has generally not been applied to arrays, as it relies on information about the ow of values, but standard array analysis produces only memory aliasing information. The development of techniques for analyzing the ow of values in array variables raises the possibility of applying constant propagation (as well as other traditional value-based scalar analyses and optimizations) to values in arrays. In the use of constant propagation, an analysis may benet from an extension of our definition of what constitutes a constant. In this work, we propose a definition of the constant array that subsumes those used for scalar and in previous work on constant propagation for arrays. We then show that this definition lets us perform analysis of arrays that fall outside the domain of previous work on constant propagation. We also discuss generalizations of dead code elimination and forward substitution.
Name (type = personal)
NamePart (type = family)
Wonnacott
NamePart (type = given)
David
Affiliation
Haverford College
Role
RoleTerm (authority = marcrt); (type = text)
author
OriginInfo
DateCreated (encoding = w3cdtf); (keyDate = yes); (qualifier = exact)
1999-03
RelatedItem (type = host)
TitleInfo
Title
Computer Science (New Brunswick)
Identifier (type = local)
rucore21032500001
Location
PhysicalLocation (authority = marcorg); (displayLabel = Rutgers, The State University of New Jersey)
NjNbRU
Identifier (type = doi)
doi:10.7282/T3P272RB
Genre (authority = ExL-Esploro)
Technical Documentation
Back to the top

Rights

RightsDeclaration (AUTHORITY = rightsstatements.org); (TYPE = IN COPYRIGHT); (ID = http://rightsstatements.org/vocab/InC/1.0/)
This Item is protected by copyright and/or related rights.You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use.For other uses you need to obtain permission from the rights-holder(s).
Copyright
Status
Copyright protected
Availability
Status
Open
Reason
Permission or license
Back to the top

Technical

RULTechMD (ID = TECHNICAL1)
ContentModel
Document
CreatingApplication
Version
1.4
ApplicationName
GPL Ghostscript 9.07
DateCreated (point = start); (encoding = w3cdtf); (qualifier = exact)
2018-06-06T12:28:52
DateCreated (point = start); (encoding = w3cdtf); (qualifier = exact)
2018-06-06T12:28:52
Back to the top
Version 8.3.13
Rutgers University Libraries - Copyright ©2020