Skip to main content
SpringerLink
Log in

Composition of Accelerations to Verify Infinite Heterogeneous Systems

  • Conference paper
Automated Technology for Verification and Analysis (ATVA 2004)

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

Abstract

Symbolic representations and acceleration algorithms are emerging methods to extend model-checking to infinite state space systems. However until now, there is no general theory of acceleration, and designing acceleration algorithms for new data types is a complex task. On the other hand, protocols rarely manipulate new data types, rather new combinations of well-studied data types. For this reason, in this paper we focus on the automatic construction of symbolic representations and acceleration algorithms from existing ones.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Annichini, A., Asarin, E., Bouajjani, A.: Symbolic techniques for parametric reasoning about counter and clock systems. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 419–434. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  2. Abdulla, P.A., Bouajjani, A., Jonsson, B.: On-thefly analysis of systems with unbounded, lossy FIFO channels. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol. 1427, pp. 305–318. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  3. Annichini, A., Bouajjani, A., Sighireanu, M.: TReX: a Tool for Reachability analysis of Complex Systems. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 368–372. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Boudet, A., Comon, H.: Diophantine equations, Presburger arithmetic and finite automata. In: Kirchner, H. (ed.) CAAP 1996. LNCS, vol. 1059, pp. 30–43. Springer, Heidelberg (1996)

    Google Scholar 

  5. Bardin, S., Finkel, A., Leroux, J.: FASTer acceleration of counter automata in practice. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 576–590. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Bardin, S., Finkel, A., Leroux, J., Petrucci, L.: FAST: Fast Acceleration of Symbolic Transition systems. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 118–121. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  7. Boigelot, B., Godefroid, P., Willems, B., Wolper, P.: The power of QDDs. In: Van Hentenryck, P. (ed.) SAS 1997. LNCS, vol. 1302, pp. 172–186. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  8. Bouajjani, A., Habermehl, P.: Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations. Theoretical Computer Science 221(1-2), 211–250 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  9. Boigelot, B., Herbreteau, F., Jodogne, S.: Hybrid acceleration using real vector automata. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 193–205. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  10. Boigelot, B., Jodogne, S., Wolper, P.: On the use of weak automata for deciding linear arithmetic with integer and real variables. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, pp. 588–603. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. Boigelot, B.: Symbolic Methods for Exploring Infinite State Spaces. PhD thesis, Université de Liège (1998)

    Google Scholar 

  12. Bouajjani, A.: Languages, rewriting systems, and verification of infinite-state systems. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 24–39. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  13. Bryant, R.E.: Symbolic boolean manipulation with ordered binarydecision diagrams. ACM Computing Surveys 24(3), 293–318 (1992)

    Article  Google Scholar 

  14. Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Proc. 4th ACM Symp. Principles of Programming Languages, Los Angeles, CA, USA, January 1977, pp. 238–253. ACM, New York (1977)

    Google Scholar 

  15. Dill, D.L.: Timing assumption and verification of finite-state concurrent systems. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol. 407, pp. 197–212. Springer, Heidelberg (1990)

    Google Scholar 

  16. Finkel, A., Leroux, J.: How to compose Presburger-accelerations: Applications to broadcast protocols. In: Agrawal, M., Seth, A.K. (eds.) FSTTCS 2002. LNCS, vol. 2556, pp. 145–156. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  17. Finkel, A., Purushothaman Iyer, S., Sutre, G.: Wellabstracted transition systems: Application to FIFO automata. Information and Computation 181(1), 1–31 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  18. Halbwachs, N., Proy, Y.E., Roumanoff, P.: Verification of real-time systems using linear relation analysis. Formal Methods in System Design 11(2), 157–185 (1997)

    Article  Google Scholar 

  19. lash homepage, http://www.montefiore.ulg.ac.be/~boigelot/research/lash/

  20. Leroux, J.: The affine hull of a binary automaton is computable in polynomial time. In: Proc. 5th Int. Workshop on Verification of Infinite State Systems (INFINITY 2003), Marseille, France, September 2003. Electronic Notes in Theor. Comp. Sci, Elsevier Science, Amsterdam (2003)

    Google Scholar 

  21. Tavernier, B.: Calife: a generic graphical user interface for automota tools. In: Proc. of the 4th Workshop on Language Descriptions, Tools and Applications (LDTA 2004), Barcelona, Spain (April 2004)

    Google Scholar 

  22. Wolper, P., Boigelot, B.: On the construction of automata from linear arithmetic constraints. In: Schwartzbach, M.I., Graf, S. (eds.) TACAS 2000. LNCS, vol. 1785, pp. 1–19. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  23. Yavuz-Kahveci, T., Tuncer, M., Bultan, T.: A library for composite symbolic representations. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 52–66. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LSV, CNRS UMR 8643, ENS de Cachan, 61 avenue du président Wilson, F-94235, CACHAN Cedex, France

    Sébastien Bardin & Alain Finkel

Authors
  1. Sébastien Bardin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alain Finkel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Grad. Inst. of Electronic Engineering, National Taiwan University, Taiwan, ROC

    Farn Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bardin, S., Finkel, A. (2004). Composition of Accelerations to Verify Infinite Heterogeneous Systems. In: Wang, F. (eds) Automated Technology for Verification and Analysis. ATVA 2004. Lecture Notes in Computer Science, vol 3299. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30476-0_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30476-0_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23610-8

  • Online ISBN: 978-3-540-30476-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation