ABSTRACT
We extend the weak monadic second-order logic of one successor on finite strings (M2L-STR) to symbolic alphabets by allowing character predicates to range over decidable quantifier free theories instead of finite alphabets. We call this logic, which is able to describe sequences over complex and potentially infinite domains, symbolic M2L-STR (S-M2L-STR). We then present a decision procedure for S-M2L-STR based on a reduction to symbolic finite automata, a decidable extension of finite automata that allows transitions to carry predicates and can therefore model symbolic alphabets. The reduction constructs a symbolic automaton over an alphabet consisting of pairs of symbols where the first element of the pair is a symbol in the original formula’s alphabet, while the second element is a bit-vector. To handle this modified alphabet we show that the Cartesian product of two decidable Boolean algebras (e.g., the formula’s one and the bit-vector’s one) also forms a decidable Boolean algebras. To make the decision procedure practical, we propose two efficient representations of the Cartesian product of two Boolean algebras, one based on algebraic decision diagrams and one on a variant of Shannon expansions. Finally, we implement our decision procedure and evaluate it on more than 10,000 formulas. Despite the generality, our implementation has comparable performance with the state-of-the-art M2L-STR solvers.
- P. Abdulla, J. Deneux, L. Kaati, and M. Nilsson. Minimization of non-deterministic automata with large alphabets. In Implementation and Application of Automata, volume 3845 of LNCS, pages 31–42. Springer, 2006. Google ScholarDigital Library
- S. B. Akers. On a theory of boolean functions. Journal of the Society for Industrial and Applied Mathematics, 7(4):487–498, December 1959.Google ScholarCross Ref
- S. B. Akers. Binary decision diagrams. IEEE Transactions on Computers, 27(6):509–516, June 1978. Google ScholarDigital Library
- R. Alur, L. D’Antoni, S. Gulwani, D. Kini, and M. Viswanathan. Automated grading of DFA constructions. In Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI ’13, pages 1976–1982. AAAI Press, 2013. Google ScholarDigital Library
- Automata. https://github.com/AutomataDotNet/Automata, 2015.Google Scholar
- R. I. Bahar, E. A. Frohm, C. M. Gaona, G. D. Hachtel, E. Macii, A. Pardo, and F. Somenzi. Algebraic decision diagrams and their applications. Formal Methods in Systems Design, 10(2/3):171–206, 1997. Google ScholarDigital Library
- D. Basin and N. Klarlund. Automata based symbolic reasoning in hardware verification. Formal Methods In System Design, 13:255– 288, 1998. Google ScholarDigital Library
- Extended version of: “Hardware verification using monadic second-order logic,” CAV ’95, LNCS 939.Google Scholar
- R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, 35(8):677–691, 1986. Google ScholarDigital Library
- J. Buchi. Weak second-order arithmetic and finite automata. Zeit. Math. Logik und Grundl. Math., 6:66–92, 1960.Google ScholarCross Ref
- C. C. Chang and H. J. Keisler. Model Theory, volume 73 of Studies in Logic and the Foundation of Mathematics. North Holland, third edition, 1990.Google Scholar
- E. Clarke, M. Fujita, P. McGeer, K. McMillan, and J. Yang. Multiterminal binary decision diagrams: An efficient data structure for matrix representation. In IWLS93: International Workshop on Logic Synthesis, pages 6a:1–15, Lake Tahoe, CA, May 1993.Google Scholar
- E. Clarke, K. McMillan, X. Zhao, M. Fujita, and J. Yang. Spectral transforms for large boolean functions with applications to technology mapping. In Design Automation, 1993. 30th Conference on, pages 54– 60, June 1993. Google ScholarDigital Library
- E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. MIT Press, 1999. Google ScholarDigital Library
- B. Courcelle. Monadic second-order definable graph transductions: a survey. Theoretical Computer Science, 126(1):53 – 75, 1994. Google ScholarDigital Library
- M. Daniele, F. Giunchiglia, and M. Y. Vardi. Improved automata generation for linear temporal logic. In Proceedings of the 11th International Conference on Computer Aided Verification, CAV ’99, pages 249–260, London, UK, UK, 1999. Springer-Verlag. Google ScholarDigital Library
- L. D’Antoni and M. Veanes. Minimization of symbolic automata. In POPL’14. ACM, 2014. Google ScholarDigital Library
- L. D’antoni, M. Veanes, B. Livshits, and D. Molnar. Fast: A transducer-based language for tree manipulation. volume 38, pages 1:1–1:32, New York, NY, USA, Oct. 2015. ACM. Google ScholarDigital Library
- G. De Giacomo and M. Y. Vardi. Linear temporal logic and linear dynamic logic on finite traces. In Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI ’13, pages 854–860. AAAI Press, 2013. Google ScholarDigital Library
- L. de Moura and N. Bjørner. Z3: An Efficient SMT Solver. In TACAS’08, LNCS. Springer, 2008. Google ScholarDigital Library
- L. de Moura and N. Bjørner. Satisfiability modulo theories: Introduction and applications. Comm. ACM, 54(9):69–77, 2011. Google ScholarDigital Library
- M. De Wulf, L. Doyen, N. Maquet, and J. F. Raskin. TACAS 2008, chapter Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking, pages 63–77. Springer Berlin Heidelberg, Berlin, Heidelberg, 2008. Google ScholarDigital Library
- T. Fiedor, L. Hol´ık, O. Lengál, and T. Vojnar. Nested antichains for WS1S. In TACAS 2015, pages 658–674, 2015. Google ScholarDigital Library
- M. Fujita, P. McGeer, and J.-Y. Yang. Multi-terminal binary decision diagrams: An efficient data structure for matrix representation. Formal Methods in System Design, 10:149–169, 1997. Google ScholarDigital Library
- A. Harding. Symbolic strategy synthesis for games with LTL winning conditions. Technical report, 2005.Google Scholar
- J. Henriksen, J. Jensen, M. Jørgensen, N. Klarlund, B. Paige, T. Rauhe, and A. Sandholm. Mona: Monadic second-order logic in practice. In TACAS ’95, volume 1019 of LNCS. Springer, 1995. Google ScholarDigital Library
- P. Hooimeijer, B. Livshits, D. Molnar, P. Saxena, and M. Veanes. Fast and precise sanitizer analysis with Bek. In USENIX Security, August 2011. Google ScholarDigital Library
- J. L. Jensen, M. E. Joergensen, N. Klarlund, and M. I. Schwartzbach. Automatic verification of pointer programs using monadic secondorder logic. In PLDI ’97, 1997. Google ScholarDigital Library
- K. Karplus. Using if-then-else DAGs for multi-level logic minimization. In Proceedings of the Decennial Caltech Conference on VLSI on Advanced Research in VLSI, pages 101–117. MIT Press, 1989. Google ScholarDigital Library
- N. Klarlund and A. Møller. MONA Version 1.4 User Manual. BRICS, Department of Computer Science, University of Aarhus, January 2001.Google Scholar
- N. Klarlund, A. Møller, and M. I. Schwartzbach. MONA implementation secrets. International Journal of Foundations of Computer Science, 13(4):571–586, 2002.Google ScholarDigital Library
- D. Kozen. Automata on guarded strings and applications. Matématica Contemporˆanea, 24:117–139, 2003.Google Scholar
- C. Y. Lee. Representation of switching circuits by binary-decision programs. Bell Systems Technical Journal, 38:985–999, 1959.Google ScholarCross Ref
- P. Madhusudan and X. Qiu. Efficient Decision Procedures for Heaps Using STRAND, pages 43–59. Springer Berlin Heidelberg, Berlin, Heidelberg, 2011. Google ScholarDigital Library
- K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993. Google ScholarDigital Library
- A. R. Meyer. Weak monadic second order theory of successor is not elementary-recursive. Technical report, Cambridge, MA, USA, 1973. Google ScholarDigital Library
- F. Neven, T. Schwentick, and V. Vianu. Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Logic, 5(3):403– 435, 2004. Google ScholarDigital Library
- B. Reed. The height of a random binary search tree. Journal of the ACM, 50(3):306–332, May 2003. Google ScholarDigital Library
- K. Y. Rozier and M. Y. Vardi. LTL Satisfiability Checking, pages 149– 167. Springer Berlin Heidelberg, Berlin, Heidelberg, 2007. Google ScholarDigital Library
- R. Sebastiani, S. Tonetta, and M. Y. Vardi. Symbolic systems, explicit properties: on hybrid approaches for LTL symbolic model checking. International Journal on Software Tools for Technology Transfer, 13(4):319–335, 2011. Google ScholarDigital Library
- W. Thomas. Languages, automata, and logic. In Handbook of Formal Languages, pages 389–455. Springer, 1996.Google Scholar
- D. Traytel. A coalgebraic decision procedure for WS1S. In 24th EACSL Annual Conference on Computer Science Logic, CSL 2015, September 7-10, 2015, Berlin, Germany, pages 487–503, 2015.Google Scholar
- M. Veanes. Implementation and Application of Automata: 18th International Conference, CIAA 2013, Halifax, NS, Canada, July 16- 19, 2013. Proceedings, chapter Applications of Symbolic Finite Automata, pages 16–23. Springer Berlin Heidelberg, Berlin, Heidelberg, 2013. Google ScholarDigital Library
- B. W. Watson. Implementing and using finite automata toolkits. In Extended finite state models of language, pages 19–36, New York, NY, USA, 1999. Cambridge University Press. Google ScholarDigital Library
Index Terms
- Monadic second-order logic on finite sequences
Recommendations
Monadic second-order logic on finite sequences
POPL '17We extend the weak monadic second-order logic of one successor on finite strings (M2L-STR) to symbolic alphabets by allowing character predicates to range over decidable quantifier free theories instead of finite alphabets. We call this logic, which is ...
Two-Way Finite State Transducers and Monadic Second-Order Logic
ICAL '99: Proceedings of the 26th International Colloquium on Automata, Languages and ProgrammingDeterministic two-way finite state transductions are exactly the mso definable string transductions. Nondeterministic mso definable string transductions equal compositions of nondeterministic two-way finite state transductions that have the finite visit ...
Extended symbolic finite automata and transducers
Symbolic finite automata and transducers augment classic automata and transducers with symbolic alphabets represented as parametric theories. This extension enables to succinctly represent large and potentially infinite alphabets while preserving ...
Comments