Abstract
Most computer programs store elements of a given nature into container-based data structures such as lists, arrays, sets, and multisets. To verify the correctness of these programs, one needs to combine a theory S modeling the data structure with a theory T modeling the elements. This combination can be achieved using the classic Nelson-Oppen method only if both S and T are stably infinite.
The goal of this paper is to relax the stable infiniteness requirement. To achieve this goal, we introduce the notion of polite theories, and we show that natural examples of polite theories include those modeling data structures such as lists, arrays, sets, and multisets. Furthemore, we provide a method that is able to combine a polite theory S with any theory T of the elements, regardless of whether T is stably infinite or not.
The results of this paper generalize to many-sorted logic those recently obtained by Tinelli and Zarba concerning the combination of shiny theories with nonstably infinite theories in one-sorted logic.
This work is partly supported by grants NSF ITR CCR-0113611, NSF CCR-0098114, and projects ACI GECCOO, and QSL VALDA-2.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baader, F., Ghilardi, S.: Connecting many-sorted structures and theories through adjoint functions. In: Gramlich, B. (ed.) FroCos 2005. LNCS, vol. 3717, pp. 31–47. Springer, Heidelberg (2005)
Baader, F., Ghilardi, S.: Connecting many-sorted theories. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS, vol. 3632, pp. 278–294. Springer, Heidelberg (2005)
Bidoit, M., Hennicker, R.: Behavioural theories and the proof of behavioural properties. Theoretical Computer Science 165(1), 3–55 (1996)
Couchot, J.-F., Déharbe, D., Giorgetti, A., Ranise, S.: Scalable automated proving and debugging of set-based specifications. Journal of the Brazilian Computer Society 9(2), 17–36 (2004)
Déharbe, D., Ranise, S.: Light-weight theorem proving for debugging and verifying units of code. In: Software Engineering and Formal Methods, pp. 220–228. IEEE Computer Society Press, Los Alamitos (2003)
Fontaine, P., Gribomont, P.: Combining non-stably infinite, non-first order theories. In: Ranise, S., Tinelli, C. (eds.) Pragmatics of Decision Procedures in Automated Reasoning (2004)
Fontaine, P., Ranise, S., Zarba, C.G.: Combining lists with non-stably infinite theories. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS, vol. 3452, pp. 51–66. Springer, Heidelberg (2005)
Ganesh, V., Berezin, S., Dill, D.L.: A decision procedure for fixed-width bit-vectors (2005) (Unpublished)
Ganzinger, H.: Shostak light. In: Voronkov, A. (ed.) CADE 2002. LNCS, vol. 2392, pp. 332–346. Springer, Heidelberg (2002)
Ranise, S., Ringeissen, C., Zarba, C.G.: Combining data structures with nonstably infinite theories using many-sorted logic. Technical report, INRIA, Also published as Technical Report at Department of Computer Science, University of New Mexico (2005). Electronically available at http://www.inria.fr/rrrt/index.en.html , http://www.inria.fr/rrrt/index.en.html
Sofronie-Stokkermans, V.: Hierarchic reasoning in local theory extensions. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS, vol. 3632, pp. 219–234. Springer, Heidelberg (2005)
Tinelli, C., Zarba, C.G.: Combining decision procedures for sorted theories. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS, vol. 3229, pp. 641–653. Springer, Heidelberg (2004)
Tinelli, C., Zarba, C.G.: Combining nonstably infinite theories. Journal of Automated Reasoning (2005) (To appear)
Zarba, C.G.: Combining multisets with integers. In: Voronkov, A. (ed.) CADE 2002. LNCS, vol. 2392, pp. 363–376. Springer, Heidelberg (2002)
Zarba, C.G.: Combining sets with elements. In: Dershowitz, N. (ed.) Verification: Theory and Practice. LNCS, vol. 2772, pp. 762–782. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ranise, S., Ringeissen, C., Zarba, C.G. (2005). Combining Data Structures with Nonstably Infinite Theories Using Many-Sorted Logic. In: Gramlich, B. (eds) Frontiers of Combining Systems. FroCoS 2005. Lecture Notes in Computer Science(), vol 3717. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11559306_3
Download citation
DOI: https://doi.org/10.1007/11559306_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29051-3
Online ISBN: 978-3-540-31730-2
eBook Packages: Computer ScienceComputer Science (R0)