Campus Event Calendar
Event Entry
New for: D2, D3
What and Who
Efficient Interpolant Generation in Satisfiability Modulo Linear Integer Arithmetic
Alberto Griggio
Fondazione Bruno Kessler (FBK), Embedded Systems Unit
Talk
AG 1, AG 2, AG 3, AG 4, AG 5, SWS, RG1, MMCI
Public Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Thursday, 4 November 2010
13:30
60 Minutes
E1 4
019
Saarbrücken
Abstract
The problem of computing Craig interpolants in SAT and SMT has recently
received a lot of interest, mainly for its applications in formal
verification.
Efficient algorithms for interpolant generation have been presented for
some theories of interest ---including that of equality and
uninterpreted functions, linear arithmetic over the rationals, and their
combination--- and they are successfully used within model checking
tools.
For the theory of linear arithmetic over the integers (LA(Z)), however,
the problem of finding an interpolant is more challenging, and the task
of developing efficient interpolant generators for the full theory LA(Z)
is still the objective of ongoing research.
In this talk, we try to close this gap. We build on previous work and
present a novel interpolation algorithm for SMT(LA(Z)), which exploits
the full power of current state-of-the-art SMT(LA(Z)) solvers. We
demonstrate the potential of our approach with an extensive experimental
evaluation of our implementation of the proposed algorithm in the
MathSAT SMT solver.
received a lot of interest, mainly for its applications in formal
verification.
Efficient algorithms for interpolant generation have been presented for
some theories of interest ---including that of equality and
uninterpreted functions, linear arithmetic over the rationals, and their
combination--- and they are successfully used within model checking
tools.
For the theory of linear arithmetic over the integers (LA(Z)), however,
the problem of finding an interpolant is more challenging, and the task
of developing efficient interpolant generators for the full theory LA(Z)
is still the objective of ongoing research.
In this talk, we try to close this gap. We build on previous work and
present a novel interpolation algorithm for SMT(LA(Z)), which exploits
the full power of current state-of-the-art SMT(LA(Z)) solvers. We
demonstrate the potential of our approach with an extensive experimental
evaluation of our implementation of the proposed algorithm in the
MathSAT SMT solver.
Contact
Jennifer Müller
900
--email hidden
passcode not visible
logged in users only
Jennifer Müller, 10/20/2010 11:46
Anna-Lisa Overhoff, 10/20/2010 11:39 -- Created document.
Anna-Lisa Overhoff, 10/20/2010 11:39 -- Created document.