Journal of KIISE:Software and Applications (한국정보과학회논문지:소프트웨어및응용)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

An Action-based LTS Bounded Model Checker for Analyzing Concurrency

병행성 분석을 위한 액션 기반의 LTS 바운드 모델 체커

  • 박사천 (경기대학교 정보과학부) ;
  • 권기현 (경기대학교 정보과학부)
  • Published : 2008.09.15
Download PDF
⟨ Previous Next ⟩

Abstract

Since concurrent software is hard to debug, the verification of such systems inevitably needs automatic tools which support exhaustive searching. Bounded Model Checking (BMC) is one of them. Within a bound k, BMC exhaustively check some errors in execution traces of the given system. In this paper, we introduce the tool that performs BMC for LTS, modeling language for concurrent programs. In this tool, a property is described by a FLTL formula, which is suitable to present the property with actions in a LTS model. To experiment with existential model checkers and out tool, we compare and analysis the performance of the developed tool and others.

병행 컴포넌트를 포함하는 소프트웨어는 디버깅하기가 매우 어렵다. 따라서 철저하면서도 자동화된 검증 도구의 사용이 필수적이다. 이러한 도구 개발의 노력 중 하나가 바운드 모델 체킹 도구이다. 바운드 모델 체킹은 주어진 바운드 k 안에서 시스템의 실행 경로에 에러가 존재하는지를 철저히 검사한다. 본 논문에서는 LTS로 모델링 된 병행 프로그램을 검증하는 바운드 모델 체킹 도구를 소개한다. 이 도구에서 속성은 FLTL로 기술되는데 FLTL은 LTS 모델에서 액션을 가지고 속성을 표현하기에 적합하다. 우리는 기존 모델 체커들과의 실험을 통해서 개발된 도구의 성능을 비교분석한다.

Keywords

References

  1. J. Magee and J. Kramer, Concurrency-State Models and Java Programs, Chichester, John Wiley & Sons, 1999
  2. E. M. Clarke, O. Grumberg and D. Peled, Model Checking, MIT Press, 1999
  3. J. P. Quielle and J. Sifakis, "Specification and verification of concurrents systems in CESAR," In Proceedings of the 5th International Symposium of Programming, pages 337-350, 1981
  4. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu, "Symbolic model checking without BDDs," In Proceeding of Workshop on Tools and Algorithms for the Construction and Analysis of Systems, LNCS, Springer-Verlag, 1999
  5. A. Biere, A. Cimatti, E. Clarke, Ofer Strichman, and Y. Zhu, "Bounded Model Checking," Vol.58 of Advances in Computers, 2003. Academic Press (pre-print)
  6. Marques-Silva, J. P., and Sakallah, K. A., "GRASP: A Search Algorithm for Propositional Satisfiability," IEEE Transactions on Computers, Vol.48, 506-521, 1999 https://doi.org/10.1109/12.769433
  7. M.W. Moskewicz, C. Madigan, Y. Zhao, L. Zhang and S. Malik, "Chaff: Engineering an Efficient SAT Solver," In Proceedings of Design Automation Conference, 2001
  8. http://www.cs.chalmers.se/Cs/Research/For-malMethods/MiniSat/
  9. http://www.doc.ic.ac.uk/ltsa/
  10. C. Sinz, "Towards an optimal CNF encoding of Boolean cardinality constraints," In the Proceedings of CP 2005, pp. 827-831, Vol.3709, LNCS, 2005
  11. D. Gannakopoulou and J. Magee, "Fluent Model Checking for Event-based Systems," In Proceedings of ESEC/FSE03, 2003
  12. T. Jussila, "BMC via dynamic atomicity analysis," In Proceedings of the International Conference on Application of Concurrency to System Design, IEEE Computer Society, June 2004
  13. T. Jussila, K. Heljanko, and I. Niemela, "BMC via on-the-fly determinization," In Proceedings of the 1st International Workshop on Bounded Model Checking, 2003
  14. T. Jussila, "On Bounded Model Checking of Asynchronous System," PhD thesis, Helsinki University, 2005
  15. A. Cimatti, M. Pistore, M. Roveri, and R. Sebastiani, "Improving the Encoding of LTL Model Checking into SAT," In Proceedings of the 3rd VMCAI, Vol.2294 of LNCS, Springer-Verlag, 2002
  16. T. Latvala, A. Bere, K. Heljanko, and T. junttila, "Simple Bounded LTL Model Checking," In Proceedings of the 5thVMCAI, Vol.2937 of LNCS, Springer-Verlag, 2004
  17. M. Ben-Ari and A.Burns, Extreme Interleavings, IEEE Concurrency, Vol.6, No.3, pp. 90-91, July 1998
  18. C. Sinz and E.-M. Dieringer, "DPvis-a tool to visualize structured SAT instances," In Proceedings of SAT 2005, pp. 257-268, Vol.3569, LNCS, 2005