Skip to main content
SpringerLink
Log in

LISA: A specification language based on WS2S

  • Conference paper
  • First Online:
Computer Science Logic (CSL 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1414))

Included in the following conference series:

Abstract

We integrate two concepts from programming languages into a specification language based on WS2S, namely high-level data structures such as records and recursively-defined datatypes (WS2S is the weak second-order monadic logic of two successors). Our integration is based on a new logic whose variables range over record-like trees and an algorithm for translating datatypes into tree automata. We have implemented LISA, a prototype system based on these ideas, which, when coupled with a decision procedure for WS2S like the MONA system, results in a verification tool that supports both high-level specifications and complexity estimations for the running time of the decision procedure.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Ait-Kaci, A. Podelski, and G. Smolka. A feature constraint system for logic programming with entailment. Theoretical Computer Science, 122(1–2):263–283, Jan. 1994.

    Article  Google Scholar 

  2. D. N. Arden. Delayed-logic and finite-state machines. In Proceedings of the Second Annual Symposium and Papers from the First Annual Symposium on Switching Circuit Theory and Logical Design, pages 133–151. American Institute of Electrical Engineers, 1961.

    Google Scholar 

  3. A. Ayari, D. Basin, and A. Podelski. Lisa: A specification language based on ws2s. Available at http://www.informatik.uni-freiburg.de/≈ayari/pubs/, 1998.

    Google Scholar 

  4. R. Backofen and G. Smolka. A complete and recursive feature theory. In Proceedings of the 31st ACL, pages 193–200, Columbus, Ohio, 1993. ACL. A full version has appeared as Research Report RR-92-30, Deutsches Forschungszentrum für Künstliche Intelligenz, Saarbrücken, Germany.

    Google Scholar 

  5. D. A. Basin and N. Klarlund. Hardware verification using monadic second-order logic. Lecture Notes in Computer Science, 939:31–41, 1995.

    Google Scholar 

  6. J. A. Brzozowski and E. Leiss. On equations for regular languages, finite automata, and sequential networks. Theoretical Computer Science, 10(1):19–35, Jan. 1980.

    Article  Google Scholar 

  7. A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer. Alternation. Journal of the ACM, 28(1):114–133, Jan. 1981.

    Article  Google Scholar 

  8. F. Gécseg and M. Steinby. Tree Automata. Akadémiai Kiadó, Budapest, 1984.

    Google Scholar 

  9. J. G. Henriksen, J. Jensen, M. Joergensen, and N. Klarlund. MONA: Monadic second-order logic in practice. Lecture Notes in Computer Science, 1019:89–101, 1995.

    Google Scholar 

  10. P. Kelb, T. Margaria, M. Mendler, and C. Gsottberger. MOSEL: A flexible toolset for monadic second-order logic. Lecture Notes in Computer Science, 1217:183–195, 1997.

    Google Scholar 

  11. Y. Kesten, O. Maler, M. Marcus, and A. Pnueli. Symbolic model checking with rich assertional languages. Lecture Notes in Computer Science, 1254:424–435, 1997.

    Google Scholar 

  12. N. Klarlund, M. Nielsen, and K. Sunesen. A case study in verification based on trace abstractions. Lecture Notes in Computer Science, 1169:341–353, 1996.

    Google Scholar 

  13. Z. Manna, N. Bjoerner, A. Browne, and E. Chang. STeP: The Stanford Temporal Prover. Lecture Notes in Computer Science, 915:793–794, 1995.

    Google Scholar 

  14. F. Morawietz and T. Cornell. On the recognizibility 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, Februar 1997.

    Google Scholar 

  15. G. Slutzki. Alternating tree automata. Theoretical Computer Science, 41(2-3):305–318, 1985.

    Article  Google Scholar 

  16. J. W. Thatcher and J. B. Wright. Generalized finite automata theory with an application to a decision problem in second-order logic. Math. Systems Theory, 2:57–81, 1968.

    Article  Google Scholar 

  17. W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 4, pages 133–191. Elsevier Science Publishers B. V., 1990.

    Google Scholar 

  18. M. Y. Vardi. An automata-theoretic approach to linear temporal logic. Lecture Notes in Computer Science, 1043:238–266, 1996.

    Google Scholar 

  19. S. Vorobyov. An improved lower bound for the elementary theories of trees. Lecture Notes in Computer Science, 1104:275–287, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Freiburg, Am Flughafen 17, 79110, Freiburg, Germany

    Abdelwaheb Ayari & David Basin

  2. Max-Planck-Institut für Informatik, Im Stadtwald, 66123, Saarbrücken, Germany

    Andreas Podelski

Authors
  1. Abdelwaheb Ayari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David Basin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andreas Podelski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Mogens Nielsen Wolfgang Thomas

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ayari, A., Basin, D., Podelski, A. (1998). LISA: A specification language based on WS2S. In: Nielsen, M., Thomas, W. (eds) Computer Science Logic. CSL 1997. Lecture Notes in Computer Science, vol 1414. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028005

Download citation

  • DOI: https://doi.org/10.1007/BFb0028005

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64570-2

  • Online ISBN: 978-3-540-69353-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation