Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2014 (2014), Article ID 702165, 13 pages
http://dx.doi.org/10.1155/2014/702165
Research Article

Counterexample-Preserving Reduction for Symbolic Model Checking

School of Computer Science, National University of Defense Technology, Changsha 410073, China

Received 12 February 2014; Accepted 14 April 2014; Published 14 May 2014

Academic Editor: Xiaoyu Song

Copyright © 2014 Wanwei Liu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. A. Pnueli, “The temporal logic of programs,” in Proceedings of the 18th Annual Symposium on Foundations of Computer Science (FOCS '77), pp. 46–57, IEEE Computer Society, 1977. View at Google Scholar · View at MathSciNet
  2. M. Y. Vardi, “Branching vs. linear time: final showdown,” in Tools and Algorithms for the Construction and Analysis of Systems, vol. 2031 of Lecture Notes in Computer Science, pp. 1–22, Springer, 2001. View at Publisher · View at Google Scholar
  3. F. Somenzi and R. Bloem, “Efficient B üchi automata from LTL formulae,” in Computer Aided Verification, E. A. Emerson and A. P. Sistla, Eds., vol. 1855 of Lecture Notes in Computer Science, pp. 53–65, Springer, 2000. View at Google Scholar
  4. A. Biere, K. Heljanko, T. Junttila, T. Latvala, and V. Schuppan, “Linear encodings of bounded LTL model checking,” Logical Methods in Computer Science, vol. 2, no. 5, pp. 1–64, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. K. L. McMillan, Symbolic model checking, an approach to the state explosion problem [Ph.D. thesis], Carnegie Mellon University, Kluwer Academic Publishers, 1993.
  6. E. M. Clarke, O. Grumberg, and K. Hamaguchi, “Another look at LTL model checking,” in Formal Methods in System Design, vol. 818 of Lecture Notes in Computer Science, pp. 415–427, Springer, 1994. View at Google Scholar
  7. A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu, “Symbolic model checking without BDDs,” in Proceedings of the 5th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS '99), vol. 1579 of Lecture Notes in Computer Science, pp. 193–207, Springer, 1999.
  8. A. R. Bradley, “SAT-based model checking without unrolling,” in Verification, Model Checking, and Abstract Interpretation, vol. 6538 of Lecture Notes in Computer Science, pp. 70–87, Springer, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. F. Somenzi and A. R. Bradly, “IC3: where monolithic and incremental meet,” in Proceedings of the International Conference on Formal Methods in Computer-Aided Design (FMCAD '11), P. Bjesse and A. Sloodova, Eds., pp. 3–8, FMCAD, 2011.
  10. N. Een, A. Mishchenko, and R. Brayton, “Efficient implementation of property directed reachability,” in Proceedings of the Formal Methods in Computer-Aided Design (FMCAD '11), pp. 125–134, Austin, Tex, USA, November 2011. View at Scopus
  11. A. R. Bradley, “Understanding IC3,” in Theory and Applications of Satisfiability Testing—SAT 2012, vol. 7317 of Lecture Notes in Computer Science, pp. 1–14, Springer, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang, “Symbolic model checking: 1020 states and beyond,” Information and Computation, vol. 98, no. 2, pp. 142–170, 1992. View at Publisher · View at Google Scholar · View at MathSciNet
  13. D. Gabbay, “The declarative past and imperative future. Executable temporal logic for interactive systems,” in Temporal Logic in Specification, vol. 398 of Lecture Notes in Computer Science, pp. 409–448, Springer, 1989. View at Publisher · View at Google Scholar · View at MathSciNet
  14. O. Kupferman and M. Y. Vardi, “Modular model checking,” in Compositionality: The Significant Difference, vol. 1536 of Lecture Notes in Computer Science, pp. 381–401, Springer, 1998. View at Publisher · View at Google Scholar · View at MathSciNet
  15. A. Cimatti, M. Pistore, M. Roveri, and R. Sebastiani, “Improving the encoding of LTL model checking into SAT,” in Verification, Model Checking, and Abstract Interpretation, vol. 2294 of Lecture Notes in Computer Science, pp. 196–207, Springer.
  16. T. Latvala, A. Biere, K. Heljanko, and T. Junttila, “Simple bounded LTL model checking,” in Formal Methods in Computer-Aided Design, A. Hu and A. Martin, Eds., vol. 3312 of Lecture Notes in Computer Science, pp. 186–200, Springer, 2004. View at Google Scholar
  17. T. Latvala, A. Biere, K. Heljanko, and T. Junttila, “Simple is better: efficient bounded model checking for past LTL,” in Verification, Model Checking, and Abstract Interpretation, vol. 3385 of Lecture Notes in Computer Science, pp. 380–395, Springer, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  18. A. Zbrzezny, “A new translation from ETCL* to SAT,” in Proceedings of the International Workshop CS&P, M. Szczuka, Ed., pp. 589–600, September 2011.
  19. E. Clarke, D. Kroening, J. Ouaknine, and O. Strichman, “Completeness and complexity of bounded model checking,” in Verification, Model Checking, and Abstract Interpretation, vol. 2937 of Lecture Notes in Computer Science, pp. 85–96, Springer, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  20. A. Frisch, D. Sheridan, and T. Walsh, “A fixpoint encoding for bounded model checking,” in Formal Methods in Computer-Aided Design, vol. 2517 of Lecture Notes in Computer Science, pp. 238–255, 2002. View at Google Scholar
  21. A. R. Bradley and Z. Manna, “Checking safety by inductive generalization of counterexamples to induction,” in Proceedings of the Formal Methods in Computer Aided Design (FMCAD '07), pp. 173–180, November 2007. View at Publisher · View at Google Scholar · View at Scopus
  22. A. R. Bradley, F. Somenzi, Z. Hassan, and Y. Zhang, “An incremental approach to model checking progress properties,” in Proceedings of the Formal Methods in Computer-Aided Design (FMCAD '11), pp. 144–153, November 2011. View at Scopus
  23. AIGER, the SMVtoAIG toolkit, 2007, http://fmv.jku.at/aiger/.
  24. The IIMC tool, 2013, http://ecee.colorado.edu/wpmu/iimc/.
  25. H. Taurainen and K. Heljanko, “Testing LTL formula translation into Büchi automata,” International Journal on Software Tools For Technology Transfer, vol. 4, no. 1, pp. 57–70, 2002. View at Google Scholar
  26. W. Liu, R. Wang, X. Fu et al., “Conterexamplepreserving reduction for symbolic model checking,” in Proceedings of the 10th International Colloquium on Theoretical Aspects of Computing (ICTAC '13), Z. Liu, J. Woodcock, and H. Zhu, Eds., vol. 8049 of Lecture Notes in Computer Science, pp. 249–266, Springer, Shanghai, China, 2013.