Proceedings of the 2013 IEEE/ACM International Symposium on Code Generation and Optimization (CGO) 2013
DOI: 10.1109/cgo.2013.6494997
|View full text |Cite
|
Sign up to set email alerts
|

Profile-guided automated software diversity

Abstract: Code-reuse attacks are notoriously hard to defeat, and most current solutions to the problem focus on automated software diversity. This is a promising area of research, as diversity attacks the common denominator enabling code-reuse attacks-the software monoculture. Recent research in this area provides security, but at an unfortunate price: performance overhead.Leveraging previously collected profiling information, compilers can substantially improve subsequent code generation. Traditionally, profile-guided … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
71
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 93 publications
(71 citation statements)
references
References 23 publications
0
71
0
Order By: Relevance
“…1%) [25]. By diversifying the code, we can be confident that a remote attacker will not be able to accurately predict the locations of gadgets he or she needs to use.…”
Section: Diversifying Gadget Locationsmentioning
confidence: 99%
“…1%) [25]. By diversifying the code, we can be confident that a remote attacker will not be able to accurately predict the locations of gadgets he or she needs to use.…”
Section: Diversifying Gadget Locationsmentioning
confidence: 99%
“…Similarly to ASAP, the Multicompiler project [14] improves a program's security by focusing efforts on the cold parts of the program.…”
Section: Background and Related Workmentioning
confidence: 99%
“…Profile information is also used to direct many other optimization tasks. For instance, profile data was used to randomize/diversify cold code blocks to reduce overhead [Homescu et al, 2013], during profile-guided meta-programming [Bowman et al, 2015], to improve code cache management in JVMs [Robinson et al, 2016], to improve heap data locality in garbage collected runtimes [Huang et al, 2004], to guide object placement in partitioned hot/cold heaps to lower memory energy consumption [Jantz et al, 2015], etc. Our goal in this work is not to generate new or improve existing PGOs, but to determine how inaccuracy in profile data or static analysis based estimators can impact the effectiveness of PGOs.…”
Section: Background and Related Workmentioning
confidence: 99%