University of Oxford Logo University of OxfordDepartment of Computer Science - Home

Leopold Haller : Publications

By dateBy titleBy typeBibtex

[1]

Abstract Conflict Driven Learning

V. D'Silva‚ L. Haller and D. Kroening

In Proc. of the Symposium on Principles of Programming Languages. ACM. 2013.

[2]

An Abstract Interpretation of DPLL(T)

M. Brain‚ V. D'Silva‚ L. Haller‚ A. Griggio and D. Kroening

In Proc. of the conference on Verification‚ Model Checking and Abstract Interpretation. 2013.

[3]

Satisfiability Solvers are Static Analysers

V. D'Silva‚ L. Haller and D. Kroening

In Proc. of Static Analysis Symposium. Pages 317−333. Springer. 2012.

[4]

Deciding Floating−Point Logic with Systematic Abstraction

L. Haller‚ A. Griggio‚ M. Brain and D. Kroening

In FMCAD. 2012.

[5]

Numeric Bounds Analysis with Conflict−Driven Learning

Vijay D'Silva‚ Leopold Haller‚ Daniel Kroening and Michael Tautschnig

In TACAS. 2012.

[6]

Strengthening Induction−Based Race Checking with Lightweight Static Analysis

Alastair F. Donaldson‚ Leopold Haller and Daniel Kroening

In VMCAI. Pages 169−183. 2011.

[7]

Software Verification Using k−Induction

Alastair F. Donaldson‚ Leopold Haller‚ Daniel Kroening and Philipp Ruemmer

In SAS. Springer. 2011.

[8]

A SAT Solver for Circuits Based on the Tableau Method

Uwe Egly and Leopold Haller

In KI. Vol. 24. No. 1. Pages 15−23. 2010.

[9]

Relieving capacity limits on FPGA−based SAT−solvers

Leopold Haller and Satnam Singh

In FMCAD. Pages 217−220. 2010.

[10]

Finding Lean Induced Cycles in Binary Hypercubes

Yury Chebiryak‚ Thomas Wahl‚ Daniel Kroening and Leopold Haller

In SAT. Pages 18−31. 2009.