Abstract
The monadic logics M2L-Str and WS1S have been successfully used for verification, although they are nonelementary decidable. Motivated by ideas from bounded model checking, we investigate procedures for bounded model construction for these logics. The problem is, given a formula φ and a bound k, does there exist a word model for φ of length k. We give a bounded model construction algorithm for M2L-Str that runs in a time exponential in k. For WS1S, we prove a negative result: bounded model construction is as hard as validity checking, i.e., it is nonelementary. From this, negative results for other monadic logics, such as S1S, follow. We present too preliminary tests using a SAT-based implementation of bounded model construction; for certain problem classes it can find counter-examples substantially faster than automata-based decision procedures.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Abrahamson, K.R., Ellis, J.A., Fellows, M.R., Mata, M.E.: On the complexity of fixed parameter problems (extended abstract). In: 30th Annual Symposium on Foundations of Computer Science. IEEE, Los Alamitos (1989)
Basin, D., Klarlund, N.: Automata based symbolic reasoning in hardware verification. The Journal of Formal Methods in Systems Design 13(3) (November 1998)
Ben-Ari, M.: Principles of Concurrent and Distributed Programming. Prentice Hall, Englewood Cliffs (1990)
Biere, A., Cimatti, A., Clarke, E., Zhu, Y.: Symbolic model checking without BDDs. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol. 1579, p. 193. Springer, Heidelberg (1999)
Büchi, J.R.: Weak second-order arithmetic and finite automata. Zeitschrift für mathematische Logik und Grundlagen der Mathematik 6 (1960)
Büchi, J.R.: On a decision method in restricted second-order arithmetic. In: Proc. 1960 Int. Congr. for Logic, Methodology, and Philosophy of Science. Stanford Univ. Press, Stanford (1962)
Büning, H.K., Karpinski, M., Flögel, A.: Resolution for quantified Boolean formulas. Information and Computation 117(1) (1995)
Cook, S.A.: The complexity of theorem-proving procedures. In: Third Annual ACM Symposium on Theory of Computing, Shaker Heights, Ohi, pp. 151–158 (1971)
Elgot, C.C.: Decision problems of finite automata design and related arithmetics. Transactions of the AMS 98 (1961)
Gordon, M.J.: Why higher-order logic is a good formalism for specifying and verifying hardware. In: Milne, G.J., Subrahmanyam, P.A. (eds.) Formal Aspects of VLSI Design. North-Holland, Amsterdam (1986)
Henriksen, J.G., Jensen, J., Jørgensen, M., Klarlund, N., Paige, B., Rauhe, T., Sandholm, A.: Mona: Monadic second-order logic in practice. In: Brinksma, E., Steffen, B., Cleaveland, W.R., Larsen, K.G., Margaria, T. (eds.) TACAS 1995. LNCS, vol. 1019. Springer, Heidelberg (1995)
Kelb, P., Margaria, T., Mendler, M., Gsottberger, C.: Mosel: A sound and efficient tool for M2L(Str). In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254. Springer, Heidelberg (1997)
Klarlund, N.: A theory of restrictions for logics and automata. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 406–417. Springer, Heidelberg (1999)
Klarlund, N., Møller, A.: MONA Version 1.3 User Manual. BRICS Notes Series NS-98-3 (second revision), Department of Computer Science, University of Aarhus (1998)
Manna, Z., Bjoerner, N., Browne, A., Chang, E.: STeP: The Stanford Temporal Prover. In: Mosses, P.D., Schwartzbach, M.I., Nielsen, M. (eds.) CAAP 1995, FASE 1995, and TAPSOFT 1995. LNCS, vol. 915. Springer, Heidelberg (1995)
Meyer, A.: Weak monadic second-order theory of successor is not elementaryrecursive. In: LOGCOLLOQ: Logic Colloquium, vol. 453. Springer, Heidelberg (1975)
Meyer, A.R., Stockmeyer, L.J.: Word problems requiring exponential time. In: ACM Symposium on Theory of Computing, New York, pp. 1–9. ACM Press, New York (1973)
Morawietz, F., Cornell, T.: On the recognizability of relations over a tree definable in a monadic second order tree description language. Research Report SFB 340-Report 85, Sonderforschungsbereich 340 of the Deutsche Forschungsgemeinschaft (1997)
Straubing, H.: Finite automata, formal logic, and circuit complexity. Birkhäuser, Basel (1994)
Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, ch. 4. Elsevier Science Publishers B. V., Amsterdam (1990)
Thomasfi, W.: Languages, automata and logic. In: Salomaa, A., Rozenberg, G. (eds.) Handbook of Formal Languages. Beyond Words, vol. 3, Springer, Berlin (1997)
Wilk, A., Pnueli, A.: Specification and verification of vlsi systems. In: IEEE/ACM International Conference on Computer-Aided Design (1989)
Zhang, H.: SATO: An efficient propositional prover. In: McCune, W. (ed.) CADE 1997. LNCS, vol. 1249. Springer, Heidelberg (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ayari, A., Basin, D. (2000). Bounded Model Construction for Monadic Second-Order Logics. In: Emerson, E.A., Sistla, A.P. (eds) Computer Aided Verification. CAV 2000. Lecture Notes in Computer Science, vol 1855. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10722167_11
Download citation
DOI: https://doi.org/10.1007/10722167_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67770-3
Online ISBN: 978-3-540-45047-4
eBook Packages: Springer Book Archive