Skip to main content

and
  1. Chapter and Conference Paper

    Minimum Satisfying Assignments for SMT

    A minimum satisfying assignment of a formula is a minimum-cost partial assignment of values to the variables in the formula that guarantees the formula is true. Minimum satisfying assignments have applications in...

    Isil Dillig, Thomas Dillig, Kenneth L. McMillan, Alex Aiken in Computer Aided Verification (2012)

  2. Chapter and Conference Paper

    Interpolants as Classifiers

    We show how interpolants can be viewed as classifiers in supervised machine learning. This view has several advantages: First, we are able to use off-the-shelf classification techniques, in particular support ...

    Rahul Sharma, Aditya V. Nori, Alex Aiken in Computer Aided Verification (2012)

  3. Chapter and Conference Paper

    Simplifying Loop Invariant Generation Using Splitter Predicates

    We present a novel static analysis technique that substantially improves the quality of invariants inferred by standard loop invariant generation techniques. Our technique decomposes multi-phase loops, which requ...

    Rahul Sharma, Isil Dillig, Thomas Dillig, Alex Aiken in Computer Aided Verification (2011)

  4. Chapter and Conference Paper

    Saturn: A SAT-Based Tool for Bug Detection

    Saturn is a boolean satisfiability (SAT) based framework for static bug detection. Saturn targets software written in C and is designed to support a wide range of property checkers.

    Yichen **e, Alex Aiken in Computer Aided Verification (2005)