作者: Johannes Kinder , Florian Zuleger , Helmut Veith
DOI: 10.1007/978-3-540-93900-9_19
关键词: Indirect branch 、 Compiler 、 Algorithm 、 Control flow graph 、 Computer science 、 Domain (software engineering) 、 Theoretical computer science 、 Control flow analysis 、 Abstract interpretation 、 Control flow 、 Data-flow analysis
摘要: Due to indirect branch instructions, analyses on executables commonly suffer from the problem that a complete control flow graph of program is not available. Data analysis has been proposed before statically determine targets in many cases, yet generic strategy without assumptions compiler idioms or debug information lacking. We have devised an abstract interpretation-based framework for low level programs with jumps which safely combines pluggable domain notion partial graphs. Using our framework, we are able show reconstruction algorithm disassembly tool Jakstab produces most precise overapproximation respect used domain.