From Strong Amalgamability to Modularity of Quantifier-Free Interpolation

Details From Strong Amalgamability to Modularity of Quantifier-Free Interpolation From Strong Amalgamability to Modularity of Quantifier-Free Interpolation

2012-03-16

arxiv.org/abs/1203.3730v2

Computer Science

Logic in Computer Science

Scientific paper

The use of interpolants in verification is gaining more and more importance. Since theories used in applications are usually obtained as (disjoint) combinations of simpler theories, it is important to modularly re-use interpolation algorithms for the component theories. We show that a sufficient and necessary condition to do this for quantifier-free interpolation is that the component theories have the 'strong (sub-)amalgamation' property. Then, we provide an equivalent syntactic characterization, identify a sufficient condition, and design a combined quantifier-free interpolation algorithm capable of handling both convex and non-convex theories, that subsumes and extends most existing work on combined interpolation.

Affiliated with

Also associated with

No associations

Rating

From Strong Amalgamability to Modularity of Quantifier-Free Interpolation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with From Strong Amalgamability to Modularity of Quantifier-Free Interpolation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and From Strong Amalgamability to Modularity of Quantifier-Free Interpolation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-352027