Skip to Main content Skip to Navigation
New interface
Conference papers

Data Structures with Arithmetic Constraints: a Non-disjoint Combination

Enrica Nicolini 1 Christophe Ringeissen 1 Michael Rusinowitch 1 
1 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
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.
Document type :
Conference papers
Complete list of metadata
Contributor : Christophe Ringeissen Connect in order to contact the contributor
Submitted on : Wednesday, October 28, 2009 - 5:29:16 PM
Last modification on : Friday, January 21, 2022 - 3:09:01 AM

Links full text



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⟩



Record views