Skip to main content
SpringerLink
Log in

A Completion Algorithm for Lattice Tree Automata

  • Conference paper
Implementation and Application of Automata (CIAA 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7982))

Included in the following conference series:

Abstract

When dealing with infinite-state systems, Regular Tree Model Checking approaches may have some difficulties to represent infinite sets of data. We propose Lattice Tree Automata, an extended version of tree automata to represent complex data domains and their related operations in an efficient manner. Moreover, we introduce a new completion-based algorithm for computing the possibly infinite set of reachable states in a finite amount of time. This algorithm is independent of the lattice making it possible to seamlessly plug abstract domains into a Regular Tree Model Checking algorithm. As a first instance, we implemented a completion with an interval abstract domain. We provide some experiments showing that this implementation permits to scale up regular tree model-checking of Java programs dealing with integer arithmetics.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Abdulla, P.A., Jonsson, B., Mahata, P., d’Orso, J.: Regular tree model checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, p. 555. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press (1998)

    Google Scholar 

  3. Barré, N., Besson, F., Genet, T., Hubert, L., Le Roux, L.: Copster homepage (2009), http://www.irisa.fr/celtique/genet/copster

  4. Bauer, S.S., Fahrenberg, U., Juhl, L., Larsen, K.G., Legay, A., Thrane, C.: Quantitative refinement for weighted modal transition systems. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol. 6907, pp. 60–71. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  5. Boichut, Y., Boyer, B., Genet, T., Legay, A.: Equational Abstraction Refinement for Certified Tree Regular Model Checking. In: Aoki, T., Taguchi, K. (eds.) ICFEM 2012. LNCS, vol. 7635, pp. 299–315. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  6. Boichut, Y., Genet, T., Jensen, T., Le Roux, L.: Rewriting Approximations for Fast Prototyping of Static Analyzers. In: Baader, F. (ed.) RTA 2007. LNCS, vol. 4533, pp. 48–62. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  7. Boichut, Y., Héam, P.-C., Kouchnarenko, O.: Approximation-based tree regular model-checking. Nord. J. Comput. 14(3), 216–241 (2008)

    Google Scholar 

  8. Bouajjani, A., Touili, T.: Extrapolating tree transformations. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, p. 539. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  9. Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL, pp. 238–252 (1977)

    Google Scholar 

  10. Ésik, Z., Liu, G.: Fuzzy tree automata. Fuzzy Sets Syst. 158, 1450–1460 (2007)

    Article  MATH  Google Scholar 

  11. Feuillade, G., Genet, T., Viet Triem Tong, V.: Reachability Analysis over Term Rewriting Systems. JAR 33(3-4), 341–383 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  12. Figueira, D., Segoufin, L.: Bottom-up automata on data trees and vertical xpath. In: STACS (2011)

    Google Scholar 

  13. Genest, B., Muscholl, A., Wu, Z.: Verifying recursive active documents with positive data tree rewriting. In: FSTTCS (2010)

    Google Scholar 

  14. Timbuk, T.G.: http://www.irisa.fr/celtique/genet/timbuk/

  15. Genet, T., Le Gall, T., Legay, A., Murat, V.: Tree regular model checking for lattice-based automata. Technical Report RT-0424, INRIA (2012), http://hal.inria.fr/hal-00687310

  16. Genet, T., Rusu, V.: Equational approximations for tree automata completion. Journal of Symbolic Computation 45(5), 574–597 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  17. Genet, T., Salmon, Y.: Tree Automata Completion for Static Analysis of Functional Programs. Technical report, INRIA (2013), http://hal.archives-ouvertes.fr/hal-00780124/PDF/main.pdf

  18. Kaplan, S., Choppy, C.: Abstract rewriting with concrete operations. In: Dershowitz, N. (ed.) RTA 1989. LNCS, vol. 355, pp. 178–186. Springer, Heidelberg (1989)

    Chapter  Google Scholar 

  19. Kupferman, O., Lustig, Y.: Lattice automata. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol. 4349, pp. 199–213. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  20. Le Gall, T., Jeannet, B.: Lattice Automata: A Representation for Languages on Infinite Alphabets, and Some Applications to Verification. In: Riis Nielson, H., Filé, G. (eds.) SAS 2007. LNCS, vol. 4634, pp. 52–68. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  21. Leroux, J.: Structural Presburger digit vector automata. TCS 409(3) (2008)

    Google Scholar 

  22. Meseguer, J., Palomino, M., Martí-Oliet, N.: Equational Abstractions. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol. 2741, pp. 2–16. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  23. Otto, C., Brockschmidt, M., von Essen, C., Giesl, J.: Automated termination analysis of java bytecode by term rewriting. In: RTA. LIPIcs. Dagstuhl (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA/IRISA, Rennes, France

    Thomas Genet, Axel Legay & Valérie Murat

  2. LIST, Centre de recherche de Saclay, CEA, France

    Tristan Le Gall

Authors
  1. Thomas Genet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tristan Le Gall
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Axel Legay
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Valérie Murat
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computing Science, Saint Mary’s University, 923 Robie Street, NS B3H 3C3, Halifax, Canada

    Stavros Konstantinidis

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Genet, T., Le Gall, T., Legay, A., Murat, V. (2013). A Completion Algorithm for Lattice Tree Automata. In: Konstantinidis, S. (eds) Implementation and Application of Automata. CIAA 2013. Lecture Notes in Computer Science, vol 7982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39274-0_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39274-0_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39273-3

  • Online ISBN: 978-3-642-39274-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation