Skip to main content
SpringerLink
Log in

ASERE: Assuring the Satisfiability of Sequential Extended Regular Expressions

  • Conference paper
Leveraging Applications of Formal Methods, Verification and Validation (ISoLA 2008)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 17))

  • 958 Accesses

Abstract

One purpose of Property Assurance is to check the satisfiability of properties. The Sequential Extended Regular Expressions (SEREs) play important roles in composing PSL properties. The SEREs are regular expressions with repetition and conjunction. Current assurance method for LTL formulas are not applicable to SEREs.

In this paper, we present a method for checking the satisfiability of SEREs. We propose an extension of Alternating Finite Automata with internal transitions and logs of universal branches (IAFA). The new representation enables memoryful synchronization of parallel words. The compilation from SEREs to IAFAs is in linear space. An algorithm, and two optimizations are proposed for searching satisfying words of SEREs. They reduce the stepwise search space to the product of universal branches’ guard sets. Experiments confirm their effectiveness.

This paper is supported by the “863” project (2007AA01302) of Ministry of Science and Technology of China, and the “Dengshan Project”(067062017) of the Science and Technology Commission of Shanghai Municipality.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ben-David, S., Bloem, R., Fisman, D., Griesmayer, A., Pill, I., Ruah, S.: Automata construction algorithm optimized for PSL. Technical Report Delivery 3.2/4, PROSYD (July 2005)

    Google Scholar 

  2. Benedetti, M., Cimatti, A.: Bounded model checking for past ltl. In: Proceedings of the International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp. 18–33 (2003)

    Google Scholar 

  3. Bloem, R., Cimatti, A., Pill, I., Roveri, M., Semprini, S.: Symbolic implementation of alternating automata. In: H. Ibarra, O., Yen, H.-C. (eds.) CIAA 2006. LNCS, vol. 4094, pp. 208–218. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  4. Bloem, R., Cavada, R., Esiner, C., Pill, I., Roveri, M., Semprini, S.: Manual for property simulation and assurance tool. Technical Report Deliverable D1.2/4-5, PROSYD (2005)

    Google Scholar 

  5. Chandra, A., Kozen, D., Stockmeyer, L.: Alternation. Journal of ACM 28(1), 113–114 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  6. Feikbeiner, B., Sipma, H.: Checking finite traces using alternating automata. Formal Methods in System Design 24(2), 101–127 (2004)

    Article  MATH  Google Scholar 

  7. Fisman, D., Eisner, C., Havlicek, J.: Formal syntax and Semantics of PSL: Appendix B of Accellera’s Property Specification Language Reference Manual, 1.1 edn. Accellera (March 2004)

    Google Scholar 

  8. Hammer, M.: Linear Weak Alternating Automata and The Model Checking. PhD thesis (2005)

    Google Scholar 

  9. Havlicek, J., Fisman, D., Eisner, C.: Basic results on the semantics of accellera PSL 1.1 foundation language (2004)

    Google Scholar 

  10. Heljanko, K., Junttila, T.A., Keinänen, M., Lange, M., Latvala, T.: Bounded model checking for weak alternating büchi automata. In: Proceedings of the 18th International Conference on Computer Aided Verification, pp. 95–108 (2006)

    Google Scholar 

  11. IEEE. IEEE 1850-2005 Standard for Property Specification Language (PSL) (2005)

    Google Scholar 

  12. Kupferman, O., Ta-Shma, A., Vardi, M.Y.: Concurrency counts (2001)

    Google Scholar 

  13. Kupferman, O., Vardi, M.Y.: Weak alternating automata and tree automata emptiness. In: Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, pp. 224–233 (1998)

    Google Scholar 

  14. Kupferman, O., Vardi, M.Y.: Weak alternating automata are not that weak. ACM Transactions on Computational Logic (TOCL) 2(3), 408–429 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  15. Kupferman, O., Vardi, M.Y., Wolper, P.: An automata-theoretic approach to branching-time model checking. Journal of the ACM 47(2), 312–360 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  16. Lange, M.: Linear time logics around PSL: Complexity, expressiveness, and a little bit of succinctness. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 90–104. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  17. Latvala, T., Biere, A., Heljanko, K., Junttila, T.: Simple is better: Efficient bounded model checking for past LTL. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 380–395. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  18. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient sat solver. In: Proceedings of the 38th Design Automation Conference (DAC 2001), pp. 530–535 (2001)

    Google Scholar 

  19. Prasad, M.R., Biere, A., Gupta, A.: A survey of recent advances in sat-based formal verification. International Journal on Software Tools for Technology Transfer 7, 156–173 (2005)

    Article  Google Scholar 

  20. Roveri, M.: Novel techniques for property assurance. Technical Report Deliverable D1.2/2, PROSYD (2004)

    Google Scholar 

  21. Vardi, M.Y.: Alternating automata and program verification. In: van Leeuwen, J. (ed.) Computer Science Today. LNCS, vol. 1000, pp. 471–485. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  22. Vardi, M.Y.: An automata-theoretic approach to linaer temporal logic. In: Moller, F., Birtwistle, G. (eds.) Logics for Concurrency. LNCS, vol. 1043, pp. 238–266. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  23. http://sites.sei.ecnu.edu.cn/Teachers/nyjin/e/asere_e.html

Download references

Author information

Authors and Affiliations

  1. Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, China

    Naiyong Jin & Huibiao Zhu

Authors
  1. Naiyong Jin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Huibiao Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universität Potsdam, August-Bebel-Str. 89, 14482, Potsdam, Germany

    Tiziana Margaria

  2. Technische Universität Dortmund, Otto-Hahn-Str. 14, 44227, Dortmund, Germany

    Bernhard Steffen

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jin, N., Zhu, H. (2008). ASERE: Assuring the Satisfiability of Sequential Extended Regular Expressions. In: Margaria, T., Steffen, B. (eds) Leveraging Applications of Formal Methods, Verification and Validation. ISoLA 2008. Communications in Computer and Information Science, vol 17. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88479-8_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88479-8_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88478-1

  • Online ISBN: 978-3-540-88479-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation