Skip to main content
SpringerLink
Log in
Book cover

International Conference on Algebraic Methodology and Software Technology

AMAST 2002: Algebraic Methodology and Software Technology pp 489–494Cite as

BRAIN: Backward Reachability Analysis with Integers

  • Conference paper
  • First Online:

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

Abstract

BRAIN is a tool for analysis of infinite-state systems in which a state can be represented by a vector of integers. Currently it is used to verify safety and deadlock properties expressed as reachability statements in a quantifier-free language with variables ranging over natural numbers.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Ajili and E. Contejean. Avoiding slack variables in the solving of linear diophantine equations and inequations. Theoretical Computer Science, 173(1):183–208, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  2. T. Bultan. Action Language: a specification language for model checking reactive systems. In ICSE 2000, Proceedings of the 22nd International Conference on Software Engineering, pages 335–344, Limerick, Ireland, 2000. ACM.

    Google Scholar 

  3. T. Bultan, R. Gerber, and W. Pugh. Model-checking concurrent systems with unbounded integer variables: symbolic representations, approximations, and experimental results. ACM Transactions on Programming Languages and Systems, 21(4):747–789, 1999.

    Article  Google Scholar 

  4. G. Delzanno and A. Podelski. Constraint-based deductive model checking. International Journal on Software Tools for Technology Transfer, 3(3):250–270, 2001.

    MATH  Google Scholar 

  5. T. A. Henzinger, P.-H. Ho, and H. Wong-Toi. Hy-tech: a model checker for hybrid systems. International Journal on Software Tools for Technology Transfer, 1(1–2):110–122, 1997.

    Article  MATH  Google Scholar 

  6. J. Rushby. Specification, proof checking and model checking for protocols and distributed systems with PVS, November 1997. Tutorial notes for FORTE/PSTV’97, http://pvs.csl.sri.com/pvs/examples/forte97-tutorial/forte97.html.

  7. T. Rybina and A. Voronkov. A logical reconstruction of reachability. In Submitted, 2002.

    Google Scholar 

  8. T. Rybina and A. Voronkov. Using canonical representations of solutions to speed up infinite-state model checking. In Proceedings of CAV 2002, 2002. To appear.

    Google Scholar 

  9. A. Voronkov. An incremental algorithm for finding the basis of solutions to systems of linear Diophantine equations and inequations. unpublished, January 2002.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Manchester, USA

    Tatiana Rybina & Andrei Voronkov

Authors
  1. Tatiana Rybina
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrei Voronkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LORIA - CNRS & INRIA, Campus Scientifique, Bâtiment LORIA, BP 239, 54506, Vandoeuvre-lès-Nancy, France

    Hélène Kirchner

  2. LORIA - INRIA, 615, rue du Jardin Botanique, 54602, Villers-lès-Nancy, France

    Christophe Ringeissen

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rybina, T., Voronkov, A. (2002). BRAIN: Backward Reachability Analysis with Integers. In: Kirchner, H., Ringeissen, C. (eds) Algebraic Methodology and Software Technology. AMAST 2002. Lecture Notes in Computer Science, vol 2422. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45719-4_33

Download citation

  • DOI: https://doi.org/10.1007/3-540-45719-4_33

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation