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

Compositional Abstraction Refinement for Component-Based Systems

School of Software, Tsinghua University, Beijing 100084, China

Received 14 March 2014; Accepted 9 May 2014; Published 11 June 2014

Academic Editor: Xiaoyu Song

Copyright © 2014 Lianyi Zhang 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. K. M. Chandy, Parallel Program Design, Springer, 1989.
  2. S. Bensalem, Y. Lakhnech, and S. Owre, “Computing abstractions of infinite state systems compositionally and automatically,” in Computer Aided Verification, pp. 319–331, Springer, 1998. View at Publisher · View at Google Scholar · View at MathSciNet
  3. S. Chaki, J. Ouaknine, K. Yorav, and E. Clarke, “Automated compositional abstraction refinement for concurrent C programs: a two-level approach,” Electronic Notes in Theoretical Computer Science, vol. 89, no. 3, pp. 417–432, 2003. View at Publisher · View at Google Scholar · View at Scopus
  4. C. Flanagan and S. Qadeer, “Thread-modular model checking,” in Model Checking Software, pp. 213–224, Springer, 2003. View at Google Scholar
  5. A. Malkis, A. Podelski, and A. Rybalchenko, “Thread-modular counterexample-guided abstraction refinement,” in Static Analysis, pp. 356–372, Springer, 2011. View at Google Scholar
  6. T. A. Henzinger, R. Jhala, R. Majumdar, and S. Qadeer, “Thread-modular abstraction refinement,” in Computer Aided Verification, pp. 262–274, Springer, Berlin, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. T. A. Henzinger, R. Jhala, and R. Majumdar, “Race checking by context inference,” ACM SIGPLAN Notices, vol. 39, no. 6, pp. 1–13, 2004. View at Google Scholar · View at Scopus
  8. S. Bensalem, Y. Lakhnech, and S. Owre, “Invest: a tool for the verification of invariants,” in Computer Aided Verification, pp. 505–510, Springer, 1998. View at Google Scholar
  9. A. Pnueli, S. Ruah, and L. Zuck, “Automatic deductive verification with invisible invariants,” in Tools and Algorithms for the Construction and Analysis of Systems, pp. 82–97, Springer, 2001. View at Google Scholar
  10. T. Arons, A. Pnueli, S. Ruah, Y. Xu, and L. Zuck, “Parameterized verification with automatically computed inductive assertions,” in Computer Aided Verification, pp. 221–234, Springer, Berlin, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  11. S. Bensalem, M. Bozga, T.-H. Nguyen et al., “Compositional verification for component-based systems and application,” in Proceedings of the Automated Technology for Verification and Analysis 6th International Symposium (ATVA '08), vol. 5311, pp. 64–79, Seoul, Republic of Korea, 2008.
  12. S. Bensalem, M. Bozga, T.-H. Nguyen, and J. Sifakis, “Compositional verification for component-based systems and application,” IET Software, vol. 4, no. 3, pp. 181–193, 2010. View at Publisher · View at Google Scholar · View at Scopus
  13. M. Bozga, M. Jaber, and J. Sifakis, “Source-to-source architecture transformation for performance optimization in BIP,” IEEE Transactions on Industrial Informatics, vol. 6, no. 4, pp. 708–718, 2010. View at Publisher · View at Google Scholar · View at Scopus
  14. S. Bensalem and Y. Lakhnech, “Automatic generation of invariants,” Formal Methods in System Design, vol. 15, no. 1, pp. 75–92, 1999. View at Publisher · View at Google Scholar · View at Scopus
  15. J. L. Peterson, Petri Net Theory and the Modeling of Systems, Prentice Hall, Englewood Cliffs, NJ, USA, 1981. View at MathSciNet
  16. K. Barkaoui and M. Minoux, “A polynomial-time graph algorithm to decide liveness of some basic classes of bounded Petri nets,” in Application and Theory of Petri Nets, vol. 616, pp. 62–75, Springer, Berlin, 1992. View at Publisher · View at Google Scholar · View at MathSciNet
  17. A. Tiwari, H. Rueß, H. Saïdi, and N. Shankar, “A technique for invariant generation,” in Tools and Algorithms for the Construction and Analysis of Systems, pp. 113–127, Springer, 2001. View at Google Scholar
  18. R. Alur and D. L. Dill, “A theory of timed automata,” Theoretical Computer Science, vol. 126, no. 2, pp. 183–235, 1994. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  19. C. Su, M. Zhou, L. Yin, H. Wan, and M. Gu, “Modeling and verification of component-based systems with data passing using bip,” in Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS '13), pp. 4–13, 2013.