Specification of an Infinite-State Local Model Checker in Rewriting Logic
暂无分享,去创建一个
[1] José Meseguer,et al. Conditioned Rewriting Logic as a United Model of Concurrency , 1992, Theor. Comput. Sci..
[2] Rance Cleaveland,et al. Tableau-based model checking in the propositional mu-calculus , 1990, Acta Informatica.
[3] José Meseguer,et al. Reflection and strategies in rewriting logic , 1996, WRLA.
[4] José Meseguer,et al. Specification and Formal Analysis of a PLAN Algorithm in Maude , 2000, ICDCS Workshop on Distributed System Validation and Verification.
[5] José Meseguer,et al. Rewriting logic: roadmap and bibliography , 2002, Theor. Comput. Sci..
[6] José Meseguer,et al. Rewriting Logic as a Semantic Framework for Concurrency: a Progress Report , 1996, CONCUR.
[7] M. Clavel. Reflection in general logics and in rewriting logic with applications to the maude languaje , 1998 .
[8] Manuel Clavel. Reflection in general logics, rewriting logic, and Maude , 1998, WRLA.
[9] D. Kozen. Results on the Propositional µ-Calculus , 1982 .
[10] José Meseguer,et al. Rewriting Logic as a Metalogical Framework , 2000, FSTTCS.
[11] José Meseguer,et al. The Maude LTL Model Checker , 2004, WRLA.
[12] David Walker,et al. Local Model Checking in the Modal mu-Calculus , 1991, Theor. Comput. Sci..
[13] Gerard J. Holzmann,et al. The Model Checker SPIN , 1997, IEEE Trans. Software Eng..