Name
Abstract | ||
|---|---|---|
There is increasing interest in applying verification tools to programs that have bitvector operations. SMT solvers, which serve as a foundation for these tools, have thus increased support for bitvector reasoning through bit-blasting and linear arithmetic approximations. In this paper we show that similar linear arithmetic approximation of bitvector operations can be done at the source level through transformations. Specifically, we introduce new paths that over-approximate bitvector operations with linear conditions/constraints, increasing branching but allowing us to better exploit the well-developed integer reasoning and interpolation of verification tools. We show that, for reachability of bitvector programs, increased branching incurs negligible overhead yet, when combined with integer interpolation optimizations, enables more programs to be verified. We further show this exploitation of integer interpolation in the common case also enables competitive termination verification of bitvector programs and leads to the first effective technique for linear temporal logic (LTL) verification of bitvector programs. Finally, we provide an in-depth case study of decompiled ("lifted") binary programs, which emulate X86 execution through frequent use of bitvector operations. We present a new tool DarkSea, the first tool capable of verifying reachability, termination and LTL of lifted binaries. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/978-3-030-89051-3_16 | PROGRAMMING LANGUAGES AND SYSTEMS, APLAS 2021 |
DocType | Volume | ISSN |
Conference | 13008 | 0302-9743 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
7 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuandong Cyrus Liu | 1 | 0 | 0.34 |
| Chengbin Pang | 2 | 4 | 1.77 |
| Daniel Dietsch | 3 | 80 | 13.53 |
| Eric Koskinen | 4 | 300 | 17.93 |
| Ton-Chanh Le | 5 | 0 | 1.35 |
| Georgios Portokalidis | 6 | 869 | 44.10 |
| Jun Xu | 7 | 65 | 10.29 |