BRAIN: Backward Reachability Analysis with Integers

  • Tatiana Rybina
  • Andrei Voronkov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2422)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [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.MATHCrossRefMathSciNetGoogle Scholar
  2. [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. [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.CrossRefGoogle Scholar
  4. [4]
    G. Delzanno and A. Podelski. Constraint-based deductive model checking. International Journal on Software Tools for Technology Transfer, 3(3):250–270, 2001.MATHGoogle Scholar
  5. [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.MATHCrossRefGoogle Scholar
  6. [6]
    J. Rushby. Specification, proof checking and model checking for protocols and distributed systems with PVS, November 1997. Tutorial notes for FORTE/PSTV’97,
  7. [7]
    T. Rybina and A. Voronkov. A logical reconstruction of reachability. In Submitted, 2002.Google Scholar
  8. [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. [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

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Tatiana Rybina
    • 1
  • Andrei Voronkov
    • 1
  1. 1.University of ManchesterUSA

Personalised recommendations