Decidable fragments of many-sorted logic

Journal of Symbolic Computation

Volumn 45, Issue 2, 2010, Pages 153-172

  Abadi, Aharon ^a   Rabinovich, Alexander ^b   Sagiv, Mooly ^b  

^a IBM HAIFA RESEARCH LAB   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Decidable logic; Many sorted logic; The classical decision problem; Transitive closure; Verification

Indexed keywords

EID: 70350733923     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jsc.2009.03.003     Document Type: Article

References (17)

1. Abadi A., Rabinovich A., and Sagiv M. Decidable fragments of many-sorted logic. LPAR 2007. LNCS vol. 4790 (2007), Springer 17-31
2. Beauquier D., and Slissenko A. Decidable verification for reducible timed automata specified in a first order logic with time. Theoretical Computer Science 275 (2002) 347-388
3. Beauquier D., and Slissenko A. A first order logic for specification of timed algorithms: Basic properties and a decidable class. Annals of Pure and Applied Logic 113 (2002) 13-52
4. Boerger E., Graedel E., and Gurevich Y. The Classical Decision Problem (1996), Springer-Verlag
5. Boolos G., and Jeffrey R. Computability and Logic. 2nd ed. (1980), Cambridge University Press
6. Borger E., Gradel E., and Gurevich Y. The Classical Decision Problem (1997), Springer-Verlag
7. Chang C.C., and Jerome Keisler H. Model Theory. Studies in Logic and the Foundations of Mathematics vol. 73 (1973), North-Holland, Netherlands
8. Fontaine P., and Gribomont E.P. Decidability of invariant validation for parameterized systems. Tools and Algorithms for Construction and Analysis of Systems. TACAS. Lecture Notes in Computer Science (2003), Springer-Verlag 97-112
9. Goldfarb W.D. The unsolvability of the godel class with identity. The Journal of Symbolic Logic 49 4 (1984) 1237-1252
10. Immerman, N., Rabinovich, A., Reps, T., Sagiv, M., Yorsh, G., 2004. The boundary between decidability and undecidability for transitive-closure logics. In: Computer Science Logic, CSL, pp. 160-174
11. Jackson D. Alloy: A lightweight object modelling notation. ACM Transactions on Software Engineering and Methodology 11 2 (2002) 256-290
12. Jackson, D., 2002b. Micromodels of software: Lightweight modelling and analysis with alloy. Technical report, MIT Lab for Computer Science
13. Lahiri, Shuvendu K., Qadeer, Shaz, 2008. Back to the future: Revisiting precise program verification using smt solvers. In POPL, pp. 171-182
14. Momtahan L. Towards a small model theorem for data independent systems in alloy. Electronic Notes in Theoretical Computer Science 128 6 (2005) 37-52
15. Mortimer M. On languages with two variables. Zeitschrift für mathematische Logik und Grundlagen der Mathematik (1975) 135-140
16. Spivey J.M. The Z Notation: A Reference Manual (1992), Prentice-Hall
17. Trakhtenbrot B.A. The impossibility of an algorithm for the decidability problem on finite classes. Doklady AN SSR 70 4 (1950) 569-572