Skip to content

Assignment 3

Jump to bottom
Yulei Sui edited this page Apr 13, 2021 · 31 revisions

Assignment-3 folder layout

$tree Assignment-3
|-- Assignment-3.cpp
|-- Assignment-3.h
|-- CMakeLists.txt
|-- Test3.cpp
`-- testcase
    |-- bc
    |   |-- CI-global.ll
    |   `-- CI-local.ll
    `-- src
        |-- CI-global.c
        `-- CI-local.c

1. Get the latest assignment-3 code template

* Before coding, please type cd $HOME/SVF-Teaching and git pull in your terminal to make sure you always have the latest version of the code template before each assignment.

If git pull fails due to the conflict with your local changes, type git stash to store your current code in a temporal branch and type git pull again. If you want to retrieve your code back, type git stash pop.

2. Assignment 3 task

  1. Implement the solveWorklist method of class AndersenPTA in Assignment-3.cpp
  2. Pass the test without any assertion by Test3.cpp
  3. Submit Assignment-3.cpp to canvas

*You will be working on Assignment-3.cpp only and there is NO need to modify other files under the Assignment-3 folder

3. Debugging and test cases.

Please follow SVF APIs including worlist operations, points-to sets operations (e.g., union/add operations), retrieving the attributes of ConstraintGraph, ConstraintNode and ConstraintEdge in your Andersen's analysis implementation.

We provided two test cases with their corresponding LLVM bc files.

You are encouraged to write more test cases by writing your own C programs. Similar to our test cases, a C program you write will need to use MAYALIAS or NOALIAS methods to indicate the ground truth or oracle of a correct analysis (see here). Once after executing Andersen's analysis, SVF will automatically check the points-to results from Andersen against the ground truth you provided (via MAYALIAS or NOALIAS).

Clone this wiki locally