© Quoc-Sang Phan; licensed under Creative Commons License CC-BY. Imperial College Computing Student Workshop (ICCSW’14). Editors: Rumyana Neykova and Nicholas Ng; pp. 58–65. OpenAccess Series in Informatics. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germanyurn: urn:nbn:de:0030-drops-47746urn: urn:nbn:de:0030-drops-4774

Phan, Q-S

English

Queen Mary Research Online

A concurrent portfolio approach to smt solving.

A decision procedure for bit-vectors and arrays.

A machine program for theoremproving.

Abstract model counting: A novel approach for quantification of information leaks.

An efficient method of computing static single assignment form.

Green: reducing, reusing and recycling constraints in program analysis.

Klee: unassisted and automatic generation of high-coverage tests for complex systems programs.

Lazy Satisfiability Modulo Theories.

Satisfiability modulo theories: introduction and applications.

Symbolic execution and program testing.

Symbolic execution for software testing in practice: Preliminary assessment.

Symbolic execution for software testing: Three decades later.

Symbolic pathfinder: symbolic execution of java bytecode.

Symbolic quantitative information flow.

th international conference on Tools and algorithms for the construction and analysis of systems,

The mathsat 4 smt solver.

Z3: an efficient smt solver.

Symbolic Execution as DPLL Modulo Theories

We show how Symbolic Execution can be understood as a variant of the DPLL(T) algorithm, which is the dominant technique for the Satisfiability Modulo Theories (SMT) problem. In other words, Symbolic Executors are SMT solvers. This view enables us to use an SMT solver, with the ability of generating all models with respect to a set of Boolean atoms, to explore all symbolic paths of a program. This results in a more lightweight approach for Symbolic Execution

Quoc-sang Phan

CiteSeerX

Symbolic execution as dpll modulo theories

We show how Symbolic Execution can be understood as a variant of the DPLL(T ) algorithm, which is the dominant technique for the Satisfiability Modulo Theories (SMT) problem. In other words, Symbolic Executors are SMT solvers. This view enables us to use an SMT solver, with the ability of generating all models with respect to a set of Boolean atoms, to explore all symbolic paths of a program. This results in a more lightweight approach for Symbolic Execution

Phan, Quoc-Sang

DROPS Dagstuhl Research Online Publication Server

http://www.eecs.qmul.ac.uk/%7Eqsp30/papers/iccsw14.pdf

Symbolic Execution as DPLL Modulo Theories

Abstract

Similar works

Full text

Available Versions

Queen Mary Research Online

CiteSeerX

DROPS Dagstuhl Research Online Publication Server