2018 23rd Asia and South Pacific Design Automation Conference (ASP-DAC) 2018
DOI: 10.1109/aspdac.2018.8297365
|View full text |Cite
|
Sign up to set email alerts
|

A mapping approach between IR and binary CFGs dealing with aggressive compiler optimizations for performance estimation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 14 publications
0
1
0
Order By: Relevance
“…IR-level back-annotation: Several groups have proposed mappings from binary to compiler IR (thus, only considering backend optimization) [8,21,32], or only from IR to source (thus, only considering high-level optimization), as in [31]. Both of these approaches have their place next to a full binary-to-source mapping as proposed here, since they can be used as fallback solutions, and are likely necessary to realize precise source-level cache models.…”
Section: Related Workmentioning
confidence: 99%
“…IR-level back-annotation: Several groups have proposed mappings from binary to compiler IR (thus, only considering backend optimization) [8,21,32], or only from IR to source (thus, only considering high-level optimization), as in [31]. Both of these approaches have their place next to a full binary-to-source mapping as proposed here, since they can be used as fallback solutions, and are likely necessary to realize precise source-level cache models.…”
Section: Related Workmentioning
confidence: 99%