Accelerating tree-automatic relations
暂无分享,去创建一个
[1] Tayssir Touili,et al. Widening techniques for regular tree model checking , 2011, International Journal on Software Tools for Technology Transfer.
[2] Parosh Aziz Abdulla,et al. Regular Tree Model Checking , 2002, CAV.
[3] Philippe Schnoebelen,et al. The regular viewpoint on PA-processes , 1998, Theor. Comput. Sci..
[4] Hubert Comon-Lundh,et al. Multiple Counters Automata, Safety Analysis and Presburger Arithmetic , 1998, CAV.
[5] Parosh Aziz Abdulla,et al. A Survey of Regular Model Checking , 2004, CONCUR.
[6] Parosh Aziz Abdulla,et al. General decidability theorems for infinite-state systems , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.
[7] Achim Blumensath,et al. Finite Presentations of Infinite Structures: Automata and Interpretations , 2004, Theory of Computing Systems.
[8] Anthony Widjaja Lin,et al. Model Checking Recursive Programs with Numeric Data Types , 2011, CAV.
[9] Philippe Schnoebelen,et al. Decidable first-order transition logics for PA-processes , 2000, Inf. Comput..
[10] Richard Mayr. Decidability and complexity of model checking problems for infinite state systems , 1998 .
[11] Alexander Kartzow. Collapsible Pushdown Graphs of Level 2 are Tree-Automatic , 2010, STACS.
[12] Igor Walukiewicz,et al. Pushdown Processes: Games and Model-Checking , 1996, Inf. Comput..
[13] Didier Caucal,et al. On the Regular Structure of Prefix Rewriting , 1990, Theor. Comput. Sci..
[14] Hubert Comon,et al. Tree automata techniques and applications , 1997 .
[15] Pierre Wolper,et al. Iterating Transducers in the Large (Extended Abstract) , 2003, CAV.
[16] Parosh Aziz Abdulla,et al. Parameterized Tree Systems , 2008, FORTE.
[17] Anthony Widjaja Lin,et al. Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems , 2011, CONCUR.
[18] Javier Esparza,et al. Reachability Analysis of Pushdown Automata: Application to Model-Checking , 1997, CONCUR.
[19] Parosh Aziz Abdulla,et al. Tree regular model checking: A simulation-based approach , 2006, J. Log. Algebraic Methods Program..
[20] Christof Löding,et al. Infinite graphs generated by tree rewriting , 2003 .
[21] Parosh Aziz Abdulla,et al. When Simulation Meets Antichains , 2010, TACAS.
[22] A. To. Model Checking Infinite-State Systems: Generic and Specific Approaches , 2010 .
[23] Anthony Widjaja Lin,et al. Recurrent Reachability Analysis in Regular Model Checking , 2008, LPAR.
[24] Sophie Tison,et al. The theory of ground rewrite systems is decidable , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.
[25] Ahmed Bouajjani,et al. Abstract regular (tree) model checking , 2012, International Journal on Software Tools for Technology Transfer.
[26] Philippe Schnoebelen,et al. Flat Acceleration in Symbolic Model Checking , 2005, ATVA.
[27] Frédéric Herbreteau,et al. The Power of Hybrid Acceleration , 2006, CAV.
[28] Anthony Widjaja Lin,et al. Weakly-Synchronized Ground Tree Rewriting - (with Applications to Verifying Multithreaded Programs) , 2012, MFCS.
[29] Marcus Nilsson,et al. Regular Model Checking , 2000, CAV.
[30] Bernard Boigelot. Symbolic Methods for Exploring Infinite State Spaces , 1998 .