Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter
暂无分享,去创建一个
[1] Olgierd Wojtasiewicz,et al. Elements of mathematical logic , 1964 .
[2] William Pugh,et al. A practical algorithm for exact array dependence analysis , 1992, CACM.
[3] Zhe Dang,et al. On Presburger Liveness of Discrete Timed Automata , 2001, STACS.
[4] Oscar H. Ibarra,et al. Reachability and Safety in Queue Systems , 2000, CIAA.
[5] Alain Finkel,et al. Decidability of Reachability Problems for Classes of Two Counters Automata , 2000, STACS.
[6] Hubert Comon-Lundh,et al. Timed Automata and the Theory of Real Numbers , 1999, CONCUR.
[7] Parosh Aziz Abdulla,et al. Verifying Programs with Unreliable Channels , 1996, Inf. Comput..
[8] Zhe Dang,et al. Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks , 2001, CAV.
[9] Rajeev Alur,et al. The Theory of Timed Automata , 1991, REX Workshop.
[10] Hubert Comon-Lundh,et al. Multiple Counters Automata, Safety Analysis and Presburger Arithmetic , 1998, CAV.
[11] Oscar H. Ibarra,et al. Binary Reachability Analysis of Discrete Pushdown Timed Automata , 2000, CAV.
[12] Oscar H. Ibarra,et al. Reversal-Bounded Multicounter Machines and Their Decision Problems , 1978, JACM.
[13] Oscar H. Ibarra,et al. Verification in loosely synchronous queue-connected discrete timed automata , 2003, Theor. Comput. Sci..
[14] Javier Esparza,et al. Reachability Analysis of Pushdown Automata: Application to Model-Checking , 1997, CONCUR.
[15] Kenneth L. McMillan,et al. Symbolic model checking: an approach to the state explosion problem , 1992 .
[16] Zhe Dang,et al. Using the ASTRAL model checker to analyze Mobile IP , 1999, Proceedings of the 1999 International Conference on Software Engineering (IEEE Cat. No.99CB37002).
[17] Rajeev Alur,et al. A Theory of Timed Automata , 1994, Theor. Comput. Sci..
[18] Alain Finkel,et al. Programs with Quasi-Stable Channels are Effectively Recognizable (Extended Abstract) , 1997, CAV.
[19] Oscar H. Ibarra,et al. Conter Machines: Decidable Properties and Applications to Verification Problems , 2000, MFCS.
[20] Oscar H. Ibarra,et al. Decidable Approximations on Generalized and Parameterized Discrete Timed Automata , 2001, COCOON.
[21] Pierre Wolper,et al. A direct symbolic approach to model checking pushdown systems , 1997, INFINITY.
[22] William Pugh,et al. The Omega test: A fast and practical integer programming algorithm for dependence analysis , 1991, Proceedings of the 1991 ACM/IEEE Conference on Supercomputing (Supercomputing '91).
[23] Zhe Dang,et al. Three approximation techniques for ASTRAL symbolic model checking of infinite state real-time systems , 2000, Proceedings of the 2000 International Conference on Software Engineering. ICSE 2000 the New Millennium.
[24] I. S. Gradshtein,et al. THE ELEMENTS OF MATHEMATICAL LOGIC , 1963 .