Skip to main content
SpringerLink
Log in

Optimisation procedures in affine model checking

  • Published:
Automatic Control and Computer Sciences Aims and scope Submit manuscript

Abstract

The symbolic model checking is based on the compact representation of a set. Up to now, there are three general directions of symbolic model checking: methods based on binary decision diagrams, bounded model checking with SAT solvers, and various algebraic approaches to effective data representation. In the present work, improved manipulation algorithms for algebraic data representations are considered, namely, optimisation algorithms of affine data representations.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abdulla, P.A., Jonsson, B., Nilsson, M., and Saksena, M., A Survey of Regular Model Checking. Proc. 15th Int. Conf. on Concurrency Theory (CONCUR’04), London, 2004; Lect. Notes Comput. Sci., 2004, vol. 3170, pp. 35–48.

  2. Bartzis, C. and Bultan, T., Efficient Symbolic Representations for Arithmetic Constraints in Verification, Int. J. Found. Comput. Sci., 2003, vol. 4, pp. 605–624.

    Article  MathSciNet  Google Scholar 

  3. Boigelot, B. and Wolper, P., Symbolic Verification with Periodic Sets, Lect. Notes Comput. Sci., 1994, vol. 818, pp. 55–67.

    Article  Google Scholar 

  4. Boigelot, B., Legay, A., and Wolper, P., Iterating Transducers in the Large, Proc. 15th Int. Conf. on Computer-Aided Verification, Boulder, CO, 2003; Lect. Notes Comput. Sci., 2003, vol. 2725, pp. 223–235.

  5. Bryant, R.E., Symbolic Boolean Manipulation with Ordered Binary Decision Diagrams, IEEE Trans. Comput., C, 1986, vol. 35, no. 8, pp. 293–318.

    Article  Google Scholar 

  6. Bultan, T., Gerber, R., and Pugh, W., Model Checking Concurrent Systems with Unbounded Integer Variables: Symbolic Representations, Approximations and Experimental Results, ACM Trans. Progr. Lang. Syst., 1999, vol. 21, no. 4, pp. 747–789.

    Article  Google Scholar 

  7. Bultan, T., BDD versus Constraint-Based Model Checking: An Experimental Evaluation for Asynchronous Concurrent Systems, Proc. 6th Int. Conf. of Tools and Algorithms for Construction and Analysis of Systems, (TACAS 2000), Berlin, 2000; Lect. Notes. Comput. Sci., 2000, vol. 1785, pp. 441–455.

  8. Clarke, E.M., Grumnerg, O., and Peled, D., Model Checking, London: MIT Press, 1999.

    Google Scholar 

  9. Kozen, D., Results on the Propositional Mu-Calculus, Theor. Comput. Sci., 1983, vol. 27, no. 3, pp. 333–354.

    Article  MathSciNet  MATH  Google Scholar 

  10. McMillan, K.L., Symbolic Model Checking: An Approach to the State Explosion Problem, Kluwer, 1993.

  11. McMillan, K.L., Applying SAT Methods in Unbounded Symbolic Model Checking, Proc. 14th Int. Conf. on Computer-Aided Verification (CAV-02), Copenhagen, 2002, Lect. Notes. Comput. Sci., 2002, vol. 2404, pp. 250–264.

  12. Shilov, N.V. and Garanina, N.O., A Polynomial Approximations for Model Checking, Lect. Notes Comput. Sci., 2003, vol. 2890, pp. 395–400.

    Article  Google Scholar 

  13. Yavuz-Kahveci, T. and Bultan, T., Heuristics for Efficient Manipulation of Composite Constraints, Proc. 4th Int. Workshop of Frontiers of Combining Systems (FroCoS-02), Santa Margherita Ligure, Italy, 2002; Lect. Notes Comput. Sci., 2002, vol. 2309, pp. 57–71.

  14. Garanina, N.O., Verification of Distributed Systems with Use of Affine Data Representation, Knowledge Logics and Actions, Candidate Sci. (Phys.-Mat.) Dissertation, Novosibirsk, 2004.

  15. Garanina, N.O., Affinnoe predstavlenie dannykh dlya proverki modelei programm (Affine Data Representation for Program Model Verification), Novosibirsk, 2004.

  16. Garanina, N.O., Model Checking of Distributed Systems with Affine Data Structures, Automat. Control Comput. Sci., 2011, vol. 45, no. 7, pp. 1–5.

    Google Scholar 

  17. The Omega Project: Frameworks and Algorithms for the Analysis and Transformation of Scientific Programs. http://www.cs.umd.edu/projects/omega/

Download references

Author information

Authors and Affiliations

  1. Ershov Institute of Informatic Systems, Siberian Branch, Russian Academy of Sciences, Novosibirsk, Russia

    N. O. Garanina

Authors
  1. N. O. Garanina
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to N. O. Garanina.

Additional information

Original Russian Text © N.O. Garanina, 2011, published in Modelirovanie i Analiz Informatsionnykh Sistem, 2011, No. 4, pp. 56–67.

About this article

Cite this article

Garanina, N.O. Optimisation procedures in affine model checking. Aut. Control Comp. Sci. 46, 331–337 (2012). https://doi.org/10.3103/S0146411612070085

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0146411612070085

Keywords

Search

Navigation