We study how to efficiently combine satisfiability procedures built by using a superposition calculus with satisfiability procedures for theories, for which the superposition calculus may not apply (e.g., for various decidable fragments of Arithmetic). Our starting point is the Nelson-Oppen combination method, where satisfiability procedures cooperate by exchanging entailed (disjunction of) equalities between variables. We show that the superposition calculus deduces sufficiently many such equalities for convex theories (e.g., the theory of equality and the theory of lists) and disjunction of equalities for non-convex theories (e.g., the theory of arrays) to guarantee the completeness of the combination method. Experimental results on proof obligations extracted from the certification of auto-generated aerospace software confirm the efficiency of the approach. Finally, we show how to make satisfiability procedures built by superposition both incremental and resettable by using a hierarchic variant of the Nelson-Oppen method. © Springer-Verlag Berlin Heidelberg 2005.

Kirchner H., Ranise S., Ringeissen C., Tran D.K.

705.pdf    Gửi cho bạn bè

Từ khóa : Combinatorial mathematics; Computer software; Digital arithmetic; Variational techniques; Calculas; Convex theories; Nelson-Oppen combination method; Superposition; Computer systems programming