Certified Self-Modifying Code
|Author||Hongxu Cai, Zhong Shao, Alexander Vaynberg|
|Description||Self-modifying code (SMC), in this paper, broadly refers to any program that loads, generates, or mutates code at runtime. It is widely used in many of the worldâ€™s critical software systems to support runtime code generation and optimization, dynamic loading and linking, OS boot loader, just-in-time compilation, binary translation, or dynamic code encryption and obfuscation. Unfortunately, SMC is also extremely difficult to reason about: existing formal verification techniques - including Hoare logic and type system â€” consistently assume that program code stored in memory is fixed and immutable; this severely limits their applicability and power.
This paper presents a simple but novel Hoare-logic-like framework that supports modular verification of general von-Neumann machine code with runtime code manipulation. By dropping the assumption that code memory is fixed and immutable, we are forced to apply local reasoning and separation logic at the very beginning, and treat program code uniformly as regular data structure. We address the interaction between separation and code memory and show how to establish the frame rules for local reasoning even in the presence of SMC. Our framework is realistic, but designed to be highly generic, so that it can support assembly code under all modern CPUs (including both x86 and MIPS). Our system is expressive and fully mechanized. We prove its soundness in the Coq proof assistant and demonstrate its power by certifying a series of realistic examples and applicationsâ€”all of which can directly run on the SPIM simulator or any stock x86 hardware.
|Image||no image available|
|Date||Sunday 17 March 2013 - 06:47:08|
0/5 : Not rated