News for hackers. Stuff that matters.
Re:KLEE LLVM Execution Engine by senatorobama on Monday April 16, 2018 @07:45PM (#16854050)
What is CS 101 explanation for this project?
Re:KLEE LLVM Execution Engine by modeless on Monday April 16, 2018 @08:08PM (#16854201)
I found a blog post with a succinct explanation.

> KLEE [runs] a program considering its input(or some other variables) to be symbols instead of concrete values like 100 or “cacho”. In very few words, a symbolic execution runs through the code propagating symbols and conditions; forking execution at symbol dependant branches and asking the companion SMT solver for path feasibility or counter-examples.

https://feliam.wordpress.com/2010/10/07/the-symbolic-maze/

Re:KLEE LLVM Execution Engine by cryptonector on Tuesday April 17, 2018 @12:51AM (#16855560)
Finally, a succint, pithy explanation.

This is great. Makes me want to use it.

Re:KLEE LLVM Execution Engine by doomjunky on Wednesday April 18, 2018 @10:59AM (#16867897)
KLEE is a symbolic execution engine. You can use it to analyse your program. A symbolic execution considers all possible values for all variables. E.g.:

   int x = readIntFromIO(); // -2147483648 to 2147483647
On branches constraints are added.

    if(x < 3) {
        // -2147483648 to 2
    } else {
        // 3 to 2147483647
    }
In this way all possible paths of the program are considered. When the execution terminates, e.g. on reaching a abort() or fail() statemant, a constraint solver calculates the input values to reach this statement. This values could be considers as test cases.

You can add assert() statements to your code for expressions (e.g. assert(x != 3) ) that you assume to be an inconsistent states and solver will give you test cases for this.