Compositional Proof Systems for Model Checking Infinite State Processes
暂无分享,去创建一个
[1] Chin-Laung Lei,et al. Efficient Model Checking in Fragments of the Propositional Mu-Calculus (Extended Abstract) , 1986, LICS.
[2] Colin Stirling,et al. Local Model Checking for Infinite State Spaces , 1992, Theor. Comput. Sci..
[3] Glynn Winskel,et al. A compositional proof system for the modal /spl mu/-calculus , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.
[4] G. Winskel,et al. A Compositional Proof System for the Modal mu-Calculus , 1994 .
[5] Rance Cleaveland,et al. Faster Model Checking for the Modal Mu-Calculus , 1992, CAV.
[6] Alex K. Simpson,et al. Compositionality via cut-elimination: Hennessy-Milner logic for an arbitrary GSOS , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.
[7] E. Allen Emerson,et al. An Automata Theoretic Decision Procedure for the Propositional Mu-Calculus , 1989, Inf. Comput..
[8] Roberto M. Amadio,et al. Reasoning about Higher-Order Processes , 1995, TAPSOFT.
[9] Javier Esparza,et al. Decidability of model checking for infinite-state concurrent systems , 1997, Acta Informatica.
[10] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.
[11] Mads Dam. Model Checking Mobile Processes (Full version) , 1993 .
[12] Kim G. Larsen,et al. Efficient Local Correctness Checking , 1992, CAV.
[13] Xinxin Liu,et al. Compositionality through an Operational Semantics of Contexts , 1990, J. Log. Comput..
[14] David Walker,et al. Local Model Checking in the Modal mu-Calculus , 1991, Theor. Comput. Sci..
[15] Hardi Hungar,et al. Model Checking of macro Processes , 1994, CAV.