Skip to main content
SpringerLink
Log in

Efficient guided symbolic reachability using reachability expressions

  • TACAS 06
  • Published:
International Journal on Software Tools for Technology Transfer Aims and scope Submit manuscript

Abstract

Asynchronous systems consist of a set of transitions which are non-deterministically chosen and executed. We present a theory of guiding symbolic reachability in such systems by scheduling clusters of transitions. A theory of reachability expressions which specify the schedules is presented. This theory allows proving equivalence of different schedules which may have radically different performance in BDD-based search. We present experimental evidence to show that optimized reachability expressions give rise to significant performance advantages. The profiling is carried out in the NuSMV framework using examples from discrete timed automata and circuits with delays. A variant tool called NuSMVDP has been developed for interpreting reachability expressions to carry out the experiments.

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. Beyer, D., Lewerentz, C., Noack, A.: Rabbit: a tool for BDD-based verification of real-time systems. In: Proceedings of International Conference on Computer-Aided Verification. Lecture Notes in Computer Science, vol. 2727, pp. 122–125. Springer, Heidelberg (2003)

  2. Bloem, R., Ravi, K., Somenzi, F.: Symbolic guided search for CTL model checking. In: Proceedings of ACM/IEEE Design Automation Conference, pp. 29–34. ACM Press, New York (2000)

  3. Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput. C-35(8), 677–691. IEEE CS Press, Washington DC (1986)

    Google Scholar 

  4. Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L.: Sequential circuit verification using symbolic model checking. In: Proceedings of ACM/IEEE Design Automation Conference, pp. 46–61. ACM Press, New York (1990)

  5. Cabodi, G., Camurati, P., Lavagno, L., Quer, S.: Disjunctive partitioning and partial iterative squaring: an effective approach for symbolic traversal of large circuits. In: Proceedings of ACM/IEEE Design Automation Conference, pp. 728–733. ACM Press, New York (1997)

  6. Chauhan, P., Clarke, E.M., Jha, S., Kukula, J., Shiple, T., Veith, H., Wang, D.: Non-linear quantification scheduling in image computation. In: Proceedings of ACM/IEEE International Conference on Computer-Aided Design, pp. 293–298. IEEE Press, Piscataway (2001)

  7. Chauhan, P., Clarke, E.M., Jha, S., Kukula, J., Veith, H., Wang, D.: Using combinatorial optimization methods for quantification scheduling. In: Proceedings of the Advanced Research Working Conference on Correct Hardware Design and Verification Methods (CHARME), Lecture Notes in Computer Science, vol. 2144, pp. 293–309. Springer, Heidelberg (2001)

  8. Chung, M.-Y., Ciardo, G., Yu, A.J.: A fine-grained fullness-guided chaining heuristic for symbolic reachability analysis. In: Proceedings of the International Symposium on Automated Technology for Verification and Analysis, Lecture Notes in Computer Science, vol. 4218, pp. 51–66. Springer, Heidelberg (2006)

  9. Ciardo, G.,Marmorstein, R., Siminiceanu, R.: The saturation algorithm for symbolic state-space exploration. Int. J. Softw. Tools Technol. Transf.8(1), 4–25. Springer, Heidelberg (2006)

    Google Scholar 

  10. Ciardo, G., Yu, A.J.: Saturation-based symbolic reachability analysis using conjunctive and disjunctive partitioning. In: Proceedings of the Advanced Research Working Conference on Correct Hardware Design and Verification Methods (CHARME), Lecture Notes in Computer Science, vol. 3725, pp. 146–161. Springer, Heidelberg (2005)

  11. Cimatti, A., Clarke, E., Giunchiglia, E., Giunchiglia, F., Pistore, M., Roveri, M., Sebastiani, R., Tacchella, A.: NuSMV version 2: An opensource tool for symbolic model checking. In: Proceedings of International Conference on Computer-Aided Verification, Lecture Notes in Computer Science, vol. 2404, pp. 359–364. Springer, Heidelberg (2002)

  12. Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, L.J.: Symbolic model checking: 1020 states and beyond. In: Proceedings of IEEE Symposium on Logic In Computer Science, pp. 1–33. IEEE CS Press, Washington DC (1990)

  13. Narayan, A., Isles, A.J., Jain, J., Brayton, R.K., Sangiovanni-Vincentelli, A.L.: Reachability analysis using partitioned-ROBDDs. In: Proceedings of ACM/IEEE Internationl Conference on Computer-Aided Design, pp. 388–393. IEEE CS Press, Washington DC (1997)

  14. Roig, O., Cortadella, J., Pastor, E.: Verification of asynchronous circuits by BDD-based model checking of petri nets. In: Proceedings of the International Conference on Application and Theory of Petri Nets, Lecture Notes in Computer Science, vol. 815, pp. 374–391. Springer, Heidelberg (1995)

  15. Thomas, D., Chakraborty, S., Pandya, P.K.: Efficient guided symbolic reachability using reachability expressions. Technical Report TR-06-19. http://www.cfdvs.iitb.ac.in/reports/techrep06.php3, CFDVS, IIT Bombay (2006)

  16. Thomas, D., Pandya, P.K., Chakraborty, S.: Scheduling clusters in model checking of real time systems. Technical Report TR-04-16. http://www.cfdvs.iitb.ac.in/reports/techrep04.php3, CFDVS, IIT Bombay (2004)

Download references

Author information

Authors and Affiliations

  1. Oracle TimesTen, Redwood, USA

    Dina Thomas

  2. Indian Institute of Technology, Bombay, India

    Supratik Chakraborty

  3. Tata Institute of Fundamental Research, Bombay, India

    Paritosh Pandya

Authors
  1. Dina Thomas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Supratik Chakraborty
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paritosh Pandya
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Supratik Chakraborty.

Additional information

D. Thomas was with I.I.T. Bombay when this work was done.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Thomas, D., Chakraborty, S. & Pandya, P. Efficient guided symbolic reachability using reachability expressions. Int J Softw Tools Technol Transf 10, 113–129 (2008). https://doi.org/10.1007/s10009-007-0057-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10009-007-0057-7

Keywords

Search

Navigation