Data Structures with Arithmetic Constraints: a Non-disjoint Combination - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Data Structures with Arithmetic Constraints: a Non-disjoint Combination

Abstract

We apply an extension of the Nelson-Oppen combination method to develop a decision procedure for the non-disjoint union of theories modeling data structures with a counting operator and fragments of arithmetic. We present some data structures and some fragments of arithmetic for which the combination method is complete and effective. To achieve effectiveness, the combination method relies on particular procedures to compute sets that are representative of all the consequences over the shared theory. We show how to compute these sets by using a superposition calculus for the theories of the considered data structures and various solving and reduction techniques for the fragments of arithmetic we are interested in, including Gauss elimination, Fourier-Motzkin elimination and Groebner bases computation.

Dates and versions

inria-00428421 , version 1 (28-10-2009)

Identifiers

Cite

Enrica Nicolini, Christophe Ringeissen, Michael Rusinowitch. Data Structures with Arithmetic Constraints: a Non-disjoint Combination. 7th International Symposium on Frontiers of Combining Systems - FroCoS'2009, Sep 2009, Trento, Italy. pp.335-350, ⟨10.1007/978-3-642-04222-5_20⟩. ⟨inria-00428421⟩
111 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More