From PSL to NBA: A modular symbolic encoding

Proceedings of Formal Methods in Computer Aided Design, FMCAD 2006

Volumn , Issue , 2006, Pages 125-133

  Cimatti, Alessandro ^a   Roveri, Marco ^a   Semprini, Simone ^a   Tonetta, Stefano ^b  

^a ITC IRST   (Italy)

^b UNIVERSITY OF LUGANO   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR TEMPORAL LOGIC (LTL); MODULAR ENCODING; SEQUENTIAL EXTENDED REGULAR EXPRESSIONS (SERE); VERIFICATION TOOLS;

AUTOMATA THEORY; ENCODING (SYMBOLS); TEMPORAL LOGIC; VERIFICATION;

SPECIFICATION LANGUAGES;

EID: 34547478831     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FMCAD.2006.19     Document Type: Conference Paper

References (31)

1. IEEE-Commission, "IEEE standard for Property Specification Language (PSL)," 2005, iEEE Std 1850-2005.
2. A. Pnueli, "The temporal logic of programs," in Proc. of 18th IEEE Symp. on Foundation of Computer Science, 1977, pp. 46-57.
3. D. Bustan, A. Flaisher, O. Grumberg, O. Kupferman, and M. Vardi, "Regular Vacuity," in CHARME, 2005, pp. 191-206.
4. P. Gastin and D. Oddoux, "Fast 111 to büchi automata translation," in Computer Aided Verification, Proc. of 13th International Conference, ser. LNCS, vol. 2102. Springer-Verlag, 2001, pp. 53-65.
5. C. Fritz, "Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata," in Proc. of the 8th International Conference on Implementation and Application of Automata, ser. LNCS, vol. 2759, 2003, pp. 35-48.
6. S. Ben-David, R. Bloem, D. Fisman, A. Griesmayer, I. Pill, and S. Ruah, "Automata Construction Algorithms Optimized for PSL," http://www.prosyd.org, 2005, PROSYD deliverable D 3.2/4.
7. K. Heljanko, T. Junttila, M. Keinänen, M. Lange, and T. Latvala, "Bounded Model Checking for Weak Alternating Büchi Automata," in Proc. of the 18th Int. Conf. on Computer Aided Verification. CAV'06, ser. LNCS, vol. 4144, Seattle (USA), 2006, pp. 95-108.
8. S. Miyano and T. Hayashi, "Alternating finite automata on omega-words," Theor. Compta. Sci., vol. 32, pp. 321-330, 1984.
9. th International Conference on Implementation and Application of Automata (CIAA06)., ser. LNCS, vol. 4094, 2006, pp. 208-218.
10. D. E. Muller, A. Saoudi, and P. E. Schupp, "Alternating automata, the weak monadic theory of trees and its complexity." Theor. Comput. Sci., vol. 97, no. 2, pp. 233-244, 1992.
11. F. Somenzi and R. Bloem, "Efficient Büchi Automata from LTL Formulae," in Proc. of the 12th International Conference on Computer-Aided Verification, ser. LNCS, vol. 1855. Springer-Verlag, 2000, pp. 247-263.
12. R. Sebastiani, S. Tonetta, and M. Vardi, "Symbolic Systems, Explicit Properties: On Hybrid Approaches for LTL Symbolic Model Checking," in Proc. of the 16th International Conference on Computer-Aided Verification (CAV'05), 2005, pp. 350-363.
13. A. Cimatti, E. Clarke, F. Giunchiglia, and M. Roveri, "NuSMV: a new Symbolic Model Verifier," in Proc. of the 11th International Conference on Computer-Aided Verification, ser. LNCS, vol. 1633. Springer-Verlag, 1999, pp. 495-499.
14. S. B. David and A. Orni, "Property-by-Example guide: a handbook of PSL/Sugar examples," http://www.prosyd.org, 2005, PROSYD deliverable D 1.1/3.
15. th International Symposium on Formal Methods (FM'06), ser. LNCS, vol. 4085, Hamilton, Ontario, Canada, 2006, pp. 573-586.
16. A. Cimatti, M. Roveri, S. Semprini, and S. Tonetta, "From PSL to NBA: a Modular Symbolic Encoding," ITC-irst, Tech. Rep. 18-08-06, August 2006.
17. R. Armoni, D. Bustan, O. Kupferman, and M. Y. Vardi, "Resets vs. aborts in linear temporal logic." in TACAS, 2003, pp. 65-80.
18. O. Lichtenstein, A. Pnueli, and L. Zuck, "The Glory of the Past," in Logic of Programs, 1985, pp. 196-218.
19. O. Kupferman and M. Y. Vardi, "Weak alternating automata are not that weak." in ISTCS, 1997, pp. 147-158.
20. Z. Manna and A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems, Specif ication. New York: Springer Verlag, 1992.
21. J. Hopcroft and J. Ullman, Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.
22. H. Yamamoto, "An Automata-Based Recognition Algorithm for Semi-extended Regular Expressions," in MFCS, 2000, pp. 699-708.
23. O. Kupferman and S. Zuhovitzky, "An Improved Algorithm for the Membership Problem for Extended Regular Expressions," in MFCS, 2002, pp. 446-458.
24. M. Vardi, "An Automata-Theoretic Approach to Linear Temporal Logic," in Banff Higher Order Workshop, 1995, pp. 238-266.
25. E. Clarke, O. Grumberg, and K. Hamaguchi, "Another Look at LTL Model Checking," Formal Methods in System Design, vol. 10, no. 1, pp. 47-71, 1997.
26. E. Clarke, O. Grumberg, and D. A. Peled, Model checking. MIT Press, 1999.
27. C. Courcoubetis, M. Vardi, P. Wolper, and M. Yannakakis, "Memory-Efficient Algorithms for the Verification of Temporal Properties," Formal Methods in System Design, vol. 1, no. 2/3, pp. 275-288, 1992.
28. E. Emerson and C. Lei, "Efficient Model Checking in Fragments of the Prepositional μ-Calculus," in Proc. of the Symposium on Logic in Computer Science. IEEE Computer Society, 1986, pp. 267-278.
29. K. Heljanko, T. A. Junttila, and T. Latvala, "Incremental and complete bounded model checking for full PLTL," in Proc. of the 17th Int. Conf. on Computer Aided Verification (CAV'05), ser. LNCS, vol. 3576. Springer, 2005, pp. 98-111.
30. N. Eén and N. Sörensson, "MiniSAT," 2005, http://www.cs.chalmers.se/Cs/Research/FormalMethods/MiniSat/Main.html.
31. V. Schuppan and A. Biere, "Efficient reduction of finite state model checking to reachability analysis," International Journal on Software Tools for Technology Transfer (STTT), vol. 5, no. 2-3, pp. 185-204, 2004.