Lazy Decomposition for Distributed Decision Procedures

Details Lazy Decomposition for Distributed Decision Procedures Lazy Decomposition for Distributed Decision Procedures

2011-11-02

arxiv.org/abs/1111.0371v1

EPTCS 72, 2011, pp. 43-54

Computer Science

Logic in Computer Science

In Proceedings PDMC 2011, arXiv:1111.0064

Scientific paper

10.4204/EPTCS.72.5

The increasing popularity of automated tools for software and hardware verification puts ever increasing demands on the underlying decision procedures. This paper presents a framework for distributed decision procedures (for first-order problems) based on Craig interpolation. Formulas are distributed in a lazy fashion, i.e., without the use of costly decomposition algorithms. Potential models which are shown to be incorrect are reconciled through the use of Craig interpolants. Experimental results on challenging propositional satisfiability problems indicate that our method is able to outperform traditional solving techniques even without the use of additional resources.

Affiliated with

Also associated with

No associations

Rating

Lazy Decomposition for Distributed Decision Procedures 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 Lazy Decomposition for Distributed Decision Procedures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lazy Decomposition for Distributed Decision Procedures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-327452