Unbounded, Fully Symbolic Model Checking of Timed Automata using Boolean Methods
暂无分享,去创建一个
[1] Olivier Coudert,et al. A unified framework for the formal verification of sequential circuits , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.
[2] Kim Guldstrand Larsen,et al. The power of reachability testing for timed automata , 2003, Theor. Comput. Sci..
[3] Amir Pnueli,et al. Some Progress in the Symbolic Verification of Timed Automata , 1997, CAV.
[4] Thomas A. Henzinger,et al. Symbolic Model Checking for Real-Time Systems , 1994, Inf. Comput..
[5] Gilles Audemard,et al. Bounded Model Checking for Timed Systems , 2002, FORTE.
[6] Ofer Strichman,et al. Deciding Separation Formulas with SAT , 2002, CAV.
[7] George B. Dantzig,et al. Fourier-Motzkin Elimination and Its Dual , 1973, J. Comb. Theory, Ser. A.
[8] O. Strichman. Optimizations in Decision Procedures for Propositional Linear Inequalities , 2002 .
[9] Olivier Coudert,et al. A unified framework for the formal verification of sequential circuits , 1990, ICCAD 1990.
[10] Rajeev Alur,et al. Timed Automata , 1999, CAV.
[11] Wang Yi,et al. Efficient Timed Reachability Analysis Using Clock Difference Diagrams , 1998, CAV.
[12] Kenneth L. McMillan,et al. Applying SAT Methods in Unbounded Symbolic Model Checking , 2002, CAV.
[13] Sanjit A. Seshia,et al. A Boolean approach to unbounded, fully symbolic model checking of timed automata , 2003 .
[14] Manolis Koubarakis,et al. Complexity Results for First-Order Theories of Temporal Constraints , 1994, KR.
[15] Jesper B. Moller. Simplifying Fixpoint Computations in Verification of Real-Time Systems , 2002 .
[16] Dirk Beyer,et al. Improvements in BDD-Based Reachability Analysis of Timed Automata , 2001, FME.
[17] Sergio Yovine,et al. KRONOS: a verification tool for real-time systems , 1997, International Journal on Software Tools for Technology Transfer.
[18] Farn Wang. Efficient Verification of Timed Automata with BDD-Like Data-Structures , 2003, VMCAI.
[19] Navendu Jain,et al. Verification of Timed Automata via Satisfiability Checking , 2002, FTRTFT.