Abstract
We investigate the possibility of developing a decidable logic which allows expressing a large variety of real world specifications. The idea is to define a decidable subset of many-sorted (typed) first- order logic. The motivation is that types simplify the complexity of mixed quantifiers when they quantify over different types. We noticed that many real world verification problems can be formalized by quantifying over different types in such a way that the relations between types remain simple.
Our main result is a decidable fragment of many-sorted first-order logic that captures many real world specifications.
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
The alloy analyzer home page, http://alloy.mit.edu
Abadi, A.: Decidable fragments of many-sorted logic. Master’s thesis, Tel-Aviv University (2007)
Beauquier, D., Slissenko, A.: Verification of timed algorithms: Gurevich abstract state machines versus first order timed logic. In: Proc. of ASM 2000 International Workshop (March 2000)
Beauquier, D., Slissenko, A.: Decidable verification for reducible timed automata specified in a first order logic with time. Theoretical Computer Science 275, 347–388 (2002)
Beauquier, D., Slissenko, A.: A first order logic for specification of timed algorithms: Basic properties and a decidable class. Annals of Pure and Applied Logic 113, 13–52 (2002)
Borger, E., Gradel, E., Gurevich, Y.: The Classical Decision Problem. Springer, Heidelberg (1997)
Clarke, E.M., Biere, A., Raimi, R., Zhu, Y.: Bounded model checking using satisfiability solving. Formal Methods in System Design 19(1), 7–34 (2001)
Goldfarb, W.D.: The unsolvability of the godel class with identity. The Journal of Symbolic Logic 49(4), 1237–1252 (1984)
Jackson, D.: Alloy: a lightweight object modelling notation. ACM Trans. Softw. Eng. Methodol. 11(2), 256–290 (2002)
Jackson, D.: Micromodels of software:lightweight modelling and analysis with alloy. Technical report, MIT Lab for Computer Science (2002)
Lev-Ami, T., Immerman, N., Reps, T.W., Sagiv, M., Srivastava, S., Yorsh, G.: Simulating reachability using first-order logic with applications to verification of linked data structures. In: CADE, pp. 99–115 (2005)
Mortimer, M.: On languages with two variables. Zeitschr. f. math. Logik u. Grundlagen d. Math., 135–140 (1975)
Riazanov, A., Voronkov, A.: The design and implementation of vampire. AI Communications 15(2-3), 91–110 (2002)
Spivey, J.M.: The Z notation: a reference manual. Prentice-Hall, Englewood Cliffs (1992)
Weidenbach, C., Gaede, B., Rock, G.: Spass & flotter version 0.42. In: CADE-13. Proceedings of the 13th International Conference on Automated Deduction, pp. 141–145. Springer, Heidelberg (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abadi, A., Rabinovich, A., Sagiv, M. (2007). Decidable Fragments of Many-Sorted Logic. In: Dershowitz, N., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2007. Lecture Notes in Computer Science(), vol 4790. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75560-9_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-75560-9_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75558-6
Online ISBN: 978-3-540-75560-9
eBook Packages: Computer ScienceComputer Science (R0)