Abstract
Practical property specification languages such as the IEEE standard PSL use at their core Sequential Extended Regular Expressions (SERE). In order to enable the reuse of traditional verification techniques, it is necessary to translate SEREs into automata. SERE are regular expressions built over alphabets resulting from the state variables of the design under analysis. Thus, a traditional approach to generate the automaton would suffer from the fact that the size of the alphabet is exponential in the number of symbols in the design.
In this work, we tackle this problem by proposing non-deterministic finite automata with symbolic representation of transitions labels, by way of propositional formulas, while states and transitions are explicitly represented. We provide a symbolic version of the algorithms for all the major operations over non-deterministic finite automata. The approach has been implemented in the AutLib library, with Binary Decision Diagrams (BDD) used to represent transition labels.
We carried out a thorough experimental evaluation over a set of realistic benchmarks, comparing our library against Mona (which uses deterministic finite automata with BDD-based symbolic transitions), and against Graz (which features non-deterministic finite automata with a DNF-based representation of the labels). Experimental results over a realistic set of benchmarks show that both features of AutLib (the ability to deal with non-determinism, and a BDD-based treatment of labels) are fundamental to achieve acceptable performance.
S. Tonetta is supported by the Provincia Autonoma di Trento (project ANACONDA). The other authors are supported by EU grant FP7-2007-IST-1-217069 COCONUT.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
IEEE Standard for Property Specification Language (PSL). IEEE Std 1850-2005 (2005)
Aziz Abdulla, P., Deneux, J., Kaati, L., Nilsson, M.: Minimization of non-deterministic automata with large alphabets. In: Farré, J., Litovsky, I., Schmitz, S. (eds.) CIAA 2005. LNCS, vol. 3845, pp. 31–42. Springer, Heidelberg (2006)
Boule, M., Zilic, Z.: Efficient Automata-Based Assertion-Checker Synthesis of SEREs for Hardware Emulation. In: ASP-DAC, pp. 324–329 (2007)
Champarnaud, J.-M.: Evaluation of Three Implicit Structures to Implement Nondeterministic Automata From Regular Expressions. Int. J. Found. Comput. Sci. 13(1), 99–113 (2002)
Champarnaud, J.M., Hansel, G.: Automate, a computing package for automata and finite semigroups. J. Symb. Comput. 12(2), 197–220 (1991)
Champarnaud, J.-M., Ponty, J.-L., Ziadi, D.: From Regular Expressions to Finite Automata. International Journal of Computer Mathematics 72(4), 415–431 (1999)
Cimatti, A., Clarke, E.M., Giunchiglia, F., Roveri, M.: NUSMV: A New Symbolic Model Checker. STTT 2(4), 410–425 (2000)
Cimatti, A., Roveri, M., Tonetta, S.: Symbolic Compilation of PSL. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1737–1750 (2008)
Clarke, E.M., Grumberg, O., Peled, D.A.: Model checking. MIT Press, Cambridge (1999)
Henriksen, J.G., Jensen, J., Jørgensen, M., Klarlund, N., Paige, B., Rauhe, T., Sandholm, A.: Mona: Monadic second-order logic in practice (1995)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)
Ilie, L., Navarro, G., Yu, S.: On NFA Reductions. In: Theory is Forever, pp. 112–124 (2004)
Kell, V., Maier, A., Potthoff, A., Thomas, W., Wermuth, U.: AMORE: a system for computing automata, monoids and regular expressions. In: Cori, R., Monien, B. (eds.) STACS 1989. LNCS, vol. 349, pp. 537–538. Springer, Heidelberg (1989)
Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems, Specification. Springer Verlag, New York (1992)
Pill, I.: Requirements Engineering and Efficient Verification of PSL properties. PhD thesis, Graz Univeristy of Technology (2008)
Raymond, D., Wood, D.: Grail: a C++ library for automata and expressions. J. Symb. Comput. 17(4), 341–350 (1994)
van Noord, G., Gerdemann, D.: Finite State Transducers with Predicates and Identities. Grammars 4(3), 263–286 (2001)
Veanes, M., Grigorenko, P., de Halleux, P., Tillmann, N.: Rex: Symbolic Regular Expression Explorer. In: ICST (2010)
Vijayaraghavan, S., Ramanathan, M.: A Practical Guide for SystemVerilog Assertions. Springer, Heidelberg (2005)
Watson, B.W.: A Taxonomy of Finite Automata Construction Algorithms. Technical report, Eindohoven University of Technology – Mathematics and Computing Science (1994)
Yu, F., Bultan, T., Cova, M., Ibarra, O.H.: Symbolic String Verification: An Automata-Based Approach. In: Havelund, K., Majumdar, R. (eds.) SPIN 2008. LNCS, vol. 5156, pp. 306–324. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cimatti, A., Mover, S., Roveri, M., Tonetta, S. (2011). From Sequential Extended Regular Expressions to NFA with Symbolic Labels. In: Domaratzki, M., Salomaa, K. (eds) Implementation and Application of Automata. CIAA 2010. Lecture Notes in Computer Science, vol 6482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18098-9_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-18098-9_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-18097-2
Online ISBN: 978-3-642-18098-9
eBook Packages: Computer ScienceComputer Science (R0)