Advertisement

Efficient guided symbolic reachability using reachability expressions

  • Dina Thomas
  • Supratik ChakrabortyEmail author
  • Paritosh Pandya
TACAS 06

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.

Keywords

Regular Expression Reachable State Reachability Analysis Transition Cluster Symbolic Model Check 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)Google Scholar
  2. 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)Google Scholar
  3. 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. 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)Google Scholar
  5. 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)Google Scholar
  6. 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)Google Scholar
  7. 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)Google Scholar
  8. 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)Google Scholar
  9. 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. 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)Google Scholar
  11. 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)Google Scholar
  12. 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)Google Scholar
  13. 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)Google Scholar
  14. 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)Google Scholar
  15. 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. 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)

Copyright information

© Springer-Verlag 2008

Authors and Affiliations

  • Dina Thomas
    • 1
  • Supratik Chakraborty
    • 2
    Email author
  • Paritosh Pandya
    • 3
  1. 1.Oracle TimesTenRedwoodUSA
  2. 2.Indian Institute of TechnologyBombayIndia
  3. 3.Tata Institute of Fundamental ResearchBombayIndia

Personalised recommendations