Sciweavers

8 search results - page 1 / 2
» Rewriting Interpolants
Sort
View
ENTCS
2008
93views more  ENTCS 2008»
13 years 4 months ago
Rewriting Interpolants
Abstract. We give a method of constructing an interpolant for linear equality, and inequality constraints over the rational numbers. Our method is based on efficient rewriting tech...
Christopher Lynch, Yuefeng Tang
ADCM
2008
71views more  ADCM 2008»
13 years 5 months ago
Solvability of partial differential equations by meshless kernel methods
This paper first provides a common framework for partial differential equation problems in both strong and weak form by rewriting them as generalized interpolation problems. Then ...
Y. C. Hon, Robert Schaback
SAT
2010
Springer
125views Hardware» more  SAT 2010»
13 years 8 months ago
Two Techniques for Minimizing Resolution Proofs
Some SAT-solvers are equipped with the ability to produce resolution proofs for problems which are unsatisfiable. Such proofs are used in a variety of contexts, including finding...
Scott Cotton
TACAS
2007
Springer
108views Algorithms» more  TACAS 2007»
13 years 11 months ago
State of the Union: Type Inference Via Craig Interpolation
The ad-hoc use of unions to encode disjoint sum types in C programs and the inability of C’s type system to check the safe use of these unions is a long standing source of subtle...
Ranjit Jhala, Rupak Majumdar, Ru-Gang Xu
ICCAD
2007
IEEE
102views Hardware» more  ICCAD 2007»
14 years 1 months ago
Scalable exploration of functional dependency by interpolation and incremental SAT solving
Functional dependency is concerned with rewriting a Boolean function f as a function h over a set of base functions {g1, …, gn}, i.e. f = h(g1, …, gn). It plays an important r...
Chih-Chun Lee, Jie-Hong Roland Jiang, Chung-Yang H...