Model Checking and the Mu-calculus
暂无分享,去创建一个
[1] C. A. R. Hoare,et al. Communicating sequential processes , 1978, CACM.
[2] A. Pnueli. The Temporal Semantics of Concurrent Programs , 1979, Theor. Comput. Sci..
[3] Edmund M. Clarke,et al. Characterizing Correctness Properties of Parallel Programs Using Fixpoints , 1980, ICALP.
[4] Dexter Kozen,et al. RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .
[5] Edmund M. Clarke,et al. Automatic Verification of Sequential Circuits Using Temporal Logic , 1986, IEEE Transactions on Computers.
[6] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.
[7] Richard E. Ladner,et al. The Logic of Distributed Protocols , 1986, TARK.
[8] A. Prasad Sistla,et al. Reasoning about systems with many processes , 1992, JACM.
[9] H. Andersen. Verification of Temporal Properties of Concurrent Systems , 1993 .
[10] A. Prasad Sistla,et al. Symmetry and model checking , 1993, Formal Methods Syst. Des..
[11] Orna Grumberg,et al. Generation of Reduced Models for Checking Fragments of CTL , 1993, CAV.
[12] Somesh Jha,et al. An Improved Algorithm for the Evaluation of Fixpoint Expressions , 1994, Theor. Comput. Sci..
[13] Moshe Y. Vardi. On the Complexity of Bounded-Variable Queries. , 1995, PODS 1995.
[14] Julian C. Bradfield. The Modal µ-Calculus Alternation Hierarchy is Strict , 1998, Theor. Comput. Sci..