Extracting Safe and Precise Control Flow from Binaries (2000)
by
Henrik Theiling
| Venue: | IN PROC. 7TH CONFERENCE ON REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS |
| Citations: | 29 - 4 self |
BibTeX
@INPROCEEDINGS{Theiling00extractingsafe,
author = {Henrik Theiling},
title = {Extracting Safe and Precise Control Flow from Binaries},
booktitle = {IN PROC. 7TH CONFERENCE ON REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS},
year = {2000},
publisher = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
As a starting point for static program analysis a control flow graph (CFG) is needed. If only the binary executable is available, this CFG has to be reconstructed from sequences of instructions. The usual way to do this is a top-down approach: the executable 's information about routines is used to split the sequence into routines, and then, each instruction is analysed for branch targets in order to compute basic block boundaries. When
