CIS 547 Dynamic Symbolic Execution

Algorithm 算法代写, Compiler 编译器代写, Programming Languages 编程语言代写, Software Analysis 软件分析代考 / C++ 代写, C语言代写

CIS 547 – Dynamic Symbolic Execution

CIS 547 – Software Analysis

Introduction to Software Analysis

The LLVM Framework

Random Input Generation

Delta Debugging

Statistical Debugging

Dataflow Analysis

Pointer Analysis

Constraint-Based Analysis

Dynamic Symbolic Execution

Introduction to Software Analysis

The LLVM Framework

Software Specifications

Random Testing

Delta Debugging

Statistical Debugging

Dataflow Analysis – Part I

Dataflow Analysis – Part II

Pointer Analysis

Constraint-Based Analysis

Automated Test Generation

Type Systems – Part I

Type Systems – Part II

Dynamic Symbolic Execution

Lab 9: Dynamic Symbolic Execution

Building a dynamic symbolic executor for C programs with LLVM and Z3.

In this lab, you will implement a dynamic symbolic execution (DSE) engine that automatically generates inputs to efficiently explore different program paths.
You will use an LLVM pass to encode C programs into our symbolic interpretation API that we have provided.
The resulting tool will find assignments for input variables that crash an input C program.

This lab is divided into three parts:

Complete the instrumentation functions in src/DSEInstrument.cpp.
Using Z3’s C++ API, write the constraint logic for dynamic symbolic interpretation in src/Runtime.cpp.
Implement a backtracking search algorithm for exploring new program paths in src/Strategy.cpp.

The skeleton code for Lab 9 is located under /lab9.
We will frequently refer to the top level directory for Lab 9 as lab9 when describing file locations for the lab.

The following commands setup the lab:

/lab9$ mkdir build && cd build
/lab9/build$ cmake ..
/lab9/build$ make

You should now see dse and InstrumentPass.so in the current directory (lab9/build).

dse is a tool that performs dynamic symbolic execution on an input program using Z3.
You can run the dse program with the following commands:

/lab9$ cd test
/lab9/test$ make simple0
/lab9/test$ ../build/dse ./simple0 N # where N is the number of iterations
/lab9/test$ timeout 10 ../build/dse ./simple0 # run for 10 seconds

Initially, you will see formula.smt2 not found since you have not implemented the instrumentation part yet.

Format of Input Programs

Input programs in this lab are assumed to have only sub-features of the C language as follows:

All values are integers (i.e., no floating points, pointers, structures, enums, arrays, etc).
You can ignore other types of values.
Assume that user inputs are only introduced via the DSE_Input function and other call instructions to other functions do not exist.

Example Input and Output

Your DSE engine should run on a given instrumented program.
For example, this will find a crashing input after 1 iteration with the input stored in input.txt:

/lab9$ cd test
/lab9/test$ make
/lab9/test$ ../build/dse ./simple0 5
Floating point exception
Crashing input found (1 iters)
/lab9/test$ cat input.txt

Lab Instructions

Dynamic symbolic execution (DSE) uses techniques from both randomized testing and symbolic execution to search all of a program’s execution paths for bugs.
DSE tracks both runtime values and symbolic constraints, and uses the former to simplify solving the latter during a backtracking search on program computation trees.

We have provided the backbone for a symbolic interpreter using Z3.
You will need to encode a C program into this symbolic interpreter API as well as write the code that drives the dynamic symbolic execution.
We provide several details on how to do this in the following sections.

This lab assumes that input programs only have integer variables (no pointers or other types of variables) and do not have functions (no CallInst).

Understanding Z3

Z3 is a theorem prover developed at Microsoft.
It’s a large and complex tool, so this will serve as a cursory guide for its capabilities and what it can do.
Consider a simple, generic system of equations such as the following, where X and Y are integers:

Although this example is trivial, think about how you might solve this using any programming language of your choice.
You may resort to using loops to check numbers or finding a library to handle matrix multiplication.
This is because most of these programming languages are imperatively-directed, meaning there’s a sequence of commands needed to solve the problem.

On the other hand, Z3 has a declarative interface, which in this case means all you need to give it is the list of constraints (in this case, X < Y and X > 2).
Plug the following into an online Z3 solver to see the results:

(declare-const x Int)
(declare-const y Int)
(assert (< x y)) (assert (> x 2))
(check-sat)
(get-model)

Z3 may not give you all possible results that match the constraints but importantly, it verifies satisfiability, which is the key factor that will be leveraged for this DSE engine.

If you’re curious about Z3 and want more information, you can check out the following resources:

https://github.com/Z3Prover/z3/wiki/Documentation
https://github.com/Z3Prover/z3/blob/master/examples/c%2B%2B/example.cpp
https://theory.stanford.edu/~nikolaj/programmingz3.html

Part 1: LLVM Instrumentation

The first component of this dynamic symbolic execution implementation is instrumentation of the input program, which is done in src/DSEInstrument.cpp.
This follows the familiar format and pattern seen in prior labs, except now this LLVM pass will inject various functions defined in src/Runtime.cpp, accompanied with the appropriate metadata from each valid LLVM Instruction.
This will enable DSE to interact with Z3 at runtime.
Specifically, these are the functions that will require instrumentation (from include/DSEInstrument.h):

static const char *DSEInitFunctionName = “__DSE_Init__”;
static const char *DSEAllocaFunctionName = “__DSE_Alloca__”;
static const char *DSEStoreFunctionName = “__DSE_Store__”;
static const char *DSELoadFunctionName = “__DSE_Load__”;
static const char *DSEConstFunctionName = “__DSE_Const__”;
static const char *DSERegisterFunctionName = “__DSE_Register__”;
static const char *DSEICmpFunctionName = “__DSE_ICmp__”;
static const char *DSEBranchFunctionName = “__DSE_Branch__”;
static const char *DSEBinOpFunctionName = “__DSE_BinOp__”;

Symbolic Inputs

The skeleton code provides an auxiliary function called DSE_Input for a user to specify symbolic inputs.
In target programs, you should first include the header file include/Runtime.h to use the function.
In the following example code, the dynamic symbolic execution engine will treat variable x and y to have symbolic inputs and z to have a concrete value 0:

#include “../include/Runtime.h”

int main() {
int x, y, z;
DSE_Input(x);
DSE_Input(y);

Note that DSE_Input is a macro and will be expanded with a unique ID.
See include/Runtime.h and src/SymbolicInterpreter.cpp for details.

Initially, the DSE engine will assign random numbers to the input variables.
After each iteration of DSE, new inputs are generated and stored in file input.txt in the form of comma-separated values (CSV).
The file will have a mapping from IDs to their integer values.
The following is an example of the symbolic mapping {X0 : 1, X1 : 10}:

If there exists an input.txt file, target programs instrumented with the methodologies below will use the integer values for inputs rather than random numbers.

Step 1: Instrumentation for DSE Initialization

You will first instrument the input program to invoke a function __DSE_Init__ at the beginning of main.
The skeleton code provides the definition of __DSE_Init__ in src/SymbolicInterpreter.cpp.
The function initializes inputs if input.txt exists and registers a callback function __DSE_Exit__ which will be invoked when the target program is terminated normally.
The skeleton code also provides the definition of __DSE_Exit__ that stores a list of covered branches (in branch.txt), path formula (in formula.smt2), and logs (in log.txt).
In short, your instrumentation module should transform the code on the left to the right:

define dso_local i32 @main() #0 {
%retval = alloca i32, align 4

define dso_local i32 @main() #0 {
call void @__DSE_Init__();
%retval = alloca i32, align 4

Step 2: Instrumentation for IR instructions

You will next instrument the remaining IR instructions.
In general, each operand in an instruction should be instrumented if it changes anything in the symbolic memory state.
Constants are instrumented with the __DSE_Const__ function and registers are instrumented with the __DSE_Register__ function (see the next section for details).
Additionally, the instrumented function calls for the Alloca instructions must appear after the instruction, whereas the instrumented function calls for all other instructions must appear before the instruction.
__DSE_ICmp__ and __DSE_BinOp__ take the ID of the register on the left hand side as their first argument and its LLVM opcode (llvm::CmpInst::Predicate and llvm::Instruction::BinaryOps, respectively) as the second argument.
We provide some example instrumentations (the function calls are simplified for readability):

%x = alloca i32, align 4

%x = alloca i32, align 4
__DSE_Alloca__(i32 1, i32* %x)

store i32 0, i32* %retval, align 4

__DSE_Const__(i32 0)
__DSE_Store__(i32* %retval)
store i32 0, i32* %retval, align 4

%cmp = icmp eq i32 %1, 1024

__DSE_Register__(i32 5)
__DSE_Const__(i32 1024)
__DSE_ICmp__(i32 6, i32 32)
%cmp = icmp eq i32 %1, 1024

Part 2: Runtime Symbolic Interpretation

The second component of this lab involves writing the runtime symbolic interpretation functions in src/Runtime.cpp.
In previous labs, the instrumentation functions have been provided, but this time you will be doing it yourself.
When each of these functions gets invoked at runtime, it will change the symbolic memory state and path conditions.
Here is where you’ll be using the Z3 API to add constraints for the symbolic interpreter class.

Symbolic Interpretation for LLVM Instructions

You will define symbolic manipulation functions for each LLVM instruction and instrument the input program to invoke these functions at runtime.
Following the real execution of the program, the DSE engine manipulates a symbolic memory state.
The SymbolicInterpreter class in include/SymbolicInterpreter.h maintains symbolic memory which is defined as a map from symbolic addresses to symbolic expressions.
It also maintains a stack of symbolic expressions.

An instance of the Address class represents a symbolic memory address.
A symbolic address is either a memory address or a register, following the definition of LLVM IR.
The Type field denotes the type of address.
For memory addresses (allocated via AllocaInstruction of LLVM), we will use their physical addresses as symbolic addresses.
For registers, we will assign unique register IDs via getRegisterID() in DSEInstrument.h.
For symbolic expressions, you will reuse Z3’s expressions, which are instances of the z3::expr class.

Symbolic manipulation of concrete execution is performed using two auxiliary functions __DSE_Const__, __DSE_Register__, each of which encodes concrete constants and registers to their symbolic counterparts.
The functions are defined in src/SymbolicInterpreter.cpp.
Function __DSE_Const__ takes a constant integer of LLVM IR, makes a symbolic expression for the number, and pushes the symbolic expression to a stack (the field Stack in class SymbolicInterpreter).
Function __DSE_Register__ takes an ID of an LLVM register, and pushes its symbolic counterpart to the stack.
Each element of the stack is either a constant or a register.
The symbolic expressions in the stack will be used for the succeeding instrumented function.

You will define the symbolic manipulation functions for LLVM instructions using the auxiliary functions.
Consider the following LLVM code equivalent to a simple C program int x = 1; int y = x; (types are
omitted for simplicity):

Instrumented Concrete Memory Stack Symbolic Memory
%x = alloca %x : 0x1000    
__DSE_Alloca__(0,%x)   [] Reg(0) : 0x1000
%y = alloca %y : 0x1004    
__DSE_Alloca__(1,%y)   [] Reg(1) : 0x1004
__DSE_Const__(1)   [Const(1)]  
__DSE_Store__(%x)   [] 0x1000 : 1
store 1, %x 0x1000 : 1    
__DSE_Load__(2,%x)   [] Reg(2) : 1
%a = load %x %a : 1    
__DSE_Register__(2)   [Reg(2)]  
__DSE_Store__(%y)   [] 0x1004 : 1
store %a, %y 0x1004 : 1    

__DSE_Alloca__ takes the ID of the register in the left hand side and the address of a newly allocated physical memory block.
In the above example, the ID of %x is 0 and the physical memory address is 0x1000.
The symbolic memory after line 2 will have entry Reg(0) : 0x1000.
__DSE_Store__ assumes that there exists a symbolic expression of its value operand (constant or register) on top of the stack.
It takes a physical memory address as a parameter and stores the symbolic expression at the address.
__DSE_Load__ takes the ID of the register in the left hand side and the address of the physical memory block of which value will be loaded to the register.

The behavior of other symbolic manipulation functions are defined in a similar way.
__DSE_ICmp__ and __DSE_BinOp__ take the ID of the register in the left hand side and its LLVM opcode (llvm::CmpInst::Predicate and llvm::Instruction::BinaryOps, respectively).
The skeleton code provides the implementation of __DSE_Branch__ in SymbolicInterpreter.cpp for a reference.

Working with Z3 Expressions

Instructions like llvm::Inst::CmpInst and llvm::BinaryOperator manipulate symbols and need to be represented equivalently in the constraints.
You will be working with Z3 Expressions to represent these manipulations.
The Z3 API uses a feature of C++ called operator-overloading to allow you to use C++ arithmetic and comparison operators with objects of type z3::expr.
We show some examples below to represent arithmetic and comparison expressions on z3::expr objects.
These examples assume that E1 and E2 are two objects of type z3::expr, and their result is stored in another object E of type z3::expr.

Operation Representation
Addition E = (E1 + E2)
Less-Than E = (E1 < E2) Part 3: Backtracking Strategy Recall from the “Example 1: Combined Approach” lecture video how conditions were handled in order for the DSE analysis to explore more paths of the input test program. Modify the searchStrategy() function in src/Strategy.cpp to perform this backtracking behavior. It should alter the current path formula that will be given to Z3 so that it will derive a new input. Path Formula and Search Strategy After each execution of an instrumented program, a path formula will be encoded and stored in formula.smt2. All the IDs of executed branch instructions will be stored in branch.txt in order of execution which may be useful to generate next inputs. Given the current satisfiable path formula, function searchStrategy will propose a formula to derive new inputs that can lead to exploring more paths. The main function in DSE.cpp will iteratively generate new inputs until a crashing input is found or a timeout occurs. Submission Once you are done with the lab, you can create a submission.zip file using the following command: lab9$ make submit submission.zip created successfully. Then upload the submission file to Gradescope.