Model checking concurrent systems with MSVL

This is a preview of subscription content, access via your institution.

References

  1. 1

    Clarke E M, Emerson E A. Design and synthesis of synchronization skeletons using branching time temporal logic. In: Proceedings of the Workshop on Logic of Programs, New York, 1981. 52–71

    Google Scholar 

  2. 2

    Queille J, Sifakis J. Specification and verification of concurrent systems in CESAR. In: Proceedings of the Colloquium on International Symposium on Programming, Turin, 1982. 337–351

    Google Scholar 

  3. 3

    Clarke E M, Emerson E A, Sifakis J. Model checking: algorithmic verification and debugging. Commun ACM, 2009, 52: 74–84

    Article  Google Scholar 

  4. 4

    Valmari A. A stubborn attack on state explosion. Form Method Syst Des, 1992, 1: 297–322

    Article  MATH  Google Scholar 

  5. 5

    Burch J R, Clarke E M, McMillan K L, et al. Symbolic model checking: 1020 states and beyond. Inform Comput, 1992, 98: 142–170

    MathSciNet  Article  MATH  Google Scholar 

  6. 6

    Biere A, Cimati A, Clarke E M, et al. Bounded model checking. Adv Comput, 2003, 58: 117–148

    Article  Google Scholar 

  7. 7

    Clarke E M, Grumberg O, Long D E. Model checking and abstraction. ACM Trans Progr Lang Syst, 1992, 16: 1512–1542

    Article  Google Scholar 

  8. 8

    Tian C, Duan Z H, Duan Z. Making CEGAR more efficient in software model checking. IEEE Trans Softw Eng, 2014, 40: 1206–1223

    Article  Google Scholar 

  9. 9

    Duan Z H, Tian C. A unified model checking approach with projection temporal logic. In: Proceedings of the International Conference on Formal Engineering Methods, Kitakyushu-City, 2008. 167–186

    Google Scholar 

  10. 10

    Duan Z H. Temporal Logic and Temporal Logic Programming. Beijing: Science Press, 2005

    Google Scholar 

  11. 11

    Godefroid P, Wolper P. A partial approach to model checking. Inform Comput, 1994, 110: 305–326

    MathSciNet  Article  MATH  Google Scholar 

  12. 12

    Clarke E M, Grumberg O, Jha S, et al. Counterexample-guided abstraction refinement for symbolic model checking. J ACM, 2003, 50: 752–794

    MathSciNet  Article  MATH  Google Scholar 

  13. 13

    Duan Z H, Tian C, Zhang N. A canonical form based decision procedure and model checking approach for propositional projection temporal logic. Theor Comput Sci, 2016, 609: 544–560

    MathSciNet  Article  MATH  Google Scholar 

  14. 14

    Duan Z H, Tian C. A practical decision procedure for propositional projection temporal logic with infinite models. Theor Comput Sci, 2014, 554: 169–190

    MathSciNet  Article  MATH  Google Scholar 

  15. 15

    Kroening D, Tautschnig M. CBMC — C bounded model checker. In: Proceedings of the International Conference Tools and Algorithms for the Construction and Analysis of Systems, Grenoble, 2014. 389–391

    Google Scholar 

  16. 16

    Henzinger T A, Jhala R, Majumdar R, et al. Software verification with Blast. In: Proceedings of the International SPIN Workshop on Model Checking of Software, Portland, 2003. 235–239

    Google Scholar 

  17. 17

    Ball T, Bounimova E, Kumar R, et al. SLAM2: static driver verification with under 4% false alarms. In: Proceedings of the International Conference on Formal Methods in Computer-Aided Design, Lugano, 2010. 35–42

    Google Scholar 

  18. 18

    Tian C, Duan Z H. Expressiveness of propositional projection temporal logic with star. Theor Comput Sci, 2011, 412: 1729–1744

    MathSciNet  Article  MATH  Google Scholar 

  19. 19

    B¨uchi J R. Symposium on decision problems: on a decision method in restricted second order arithmetic. Stud Logic Found Math, 1966, 44: 1–11

    Article  Google Scholar 

  20. 20

    Gomes C P, Kautz H, Sabharwal A, et al. Satisfiability solvers. Found Artif Intell, 2008, 3: 89–134

    Google Scholar 

  21. 21

    Duan Z H, Yang X X, Koutny M. Framed temporal logic programming. Sci Comput Program, 2008, 70: 31–61

    MathSciNet  Article  MATH  Google Scholar 

  22. 22

    Wang X B, Duan Z H, Zhao L. Formalizing and implementing types in MSVL. In: Proceedings of the InternationalWorkshop of Structured Object-Oriented Formal Language and Method, Queenstown, 2013. 62–75

    Google Scholar 

  23. 23

    Zhang N, Duan Z H, Tian C. A mechanism of function calls in MSVL. Theor Comput Sci, in press. doi: 10.1016/j.tcs.2016.02.037

  24. 24

    Rosner R, Pnueli A. A choppy logic. In: Proceedings of the Symposium on Logic in Computer Science, Cambridge, 1986. 306–313

    Google Scholar 

  25. 25

    Bowman H, Thompson S J. A decision procedure and complete axiomatization of finite interval temporal logic with projection. J Logic Comput, 2003, 13: 195–239

    MathSciNet  Article  MATH  Google Scholar 

  26. 26

    Tang C S. Toward a Unified Logical Basis for Programming Languages. Technology Report, No. STAN-CS-81-865. 1981

    Google Scholar 

  27. 27

    Moszkowski B C. Executing Temporal Logic Programs. Cambridge: Cambridge University Press, 1986

    Google Scholar 

Download references

Author information

Affiliations

Authors

Corresponding author

Correspondence to Zhenhua Duan.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Zhang, N., Duan, Z. & Tian, C. Model checking concurrent systems with MSVL. Sci. China Inf. Sci. 59, 118101 (2016). https://doi.org/10.1007/s11432-015-0882-6

Download citation