Over the last several years a new theory of Nevanlinna-Pick interpolation with complexity constraint has been developed for scalar interpolants. In this paper we generalize this theory to the matrix-valued case, also allowing for multiple interpolation points. We parameterize a class of interpolants consisting of “most interpolants” of no higher degree than the central solution in terms of spec...

abstract Evaluating and comparing the quality of surface interpolants is an important problem in computer graphics, computer aided geometric design and scientiic visualization. We introduce geometric uncertainty as a measure of interpolation error, level of conndence or quality of an interpolant. Geometric uncertainty can be estimated as a scalar or a vector-valued function that depends upon ge...

Abstraction is a successful technique in software verification, and interpolation on infeasible error paths is a successful approach to automatically detect the right level of abstraction in counterexample-guided abstraction refinement. Because the interpolants have a significant influence on the quality of the abstraction, and thus, the effectiveness of the verification, an algorithm for deriv...

We treat interpolation for various logics. In the full non-monotonic case, we connect the existence of interpolants to laws about abstract size, and to generalized Hamming relations. We also mention revision a la Parikh.