Reachability Analysis of the HTML5 Parser Specification and Its Application to Compatibility Testing
暂无分享,去创建一个
[1] Aaron Turon,et al. Regular-expression derivatives re-examined , 2009, Journal of Functional Programming.
[2] Mohamed Nassim Seghir,et al. A Lightweight Approach for Loop Summarization , 2011, ATVA.
[3] Janusz A. Brzozowski,et al. Derivatives of Regular Expressions , 1964, JACM.
[4] Mimmo Parente,et al. Enriched µ-Calculi Module Checking , 2007, Log. Methods Comput. Sci..
[5] Seymour Ginsburg,et al. Stack automata and compiling , 1967, JACM.
[6] Javier Esparza,et al. Reachability Analysis of Pushdown Automata: Application to Model-Checking , 1997, CONCUR.
[7] Yasuhiko Minamide,et al. Static approximation of dynamically generated Web pages , 2005, WWW '05.
[8] Javier Esparza,et al. Efficient Algorithms for Model Checking Pushdown Systems , 2000, CAV.
[9] C.-H. Luke Ong,et al. Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems , 2008, Log. Methods Comput. Sci..
[10] Tobias Nipkow,et al. Proof Pearl: Regular Expression Equivalence and Relation Algebra , 2011, Journal of Automated Reasoning.
[11] Mizuhito Ogawa,et al. Conditional weighted pushdown systems and applications , 2010, PEPM '10.
[12] Dejvuth Suwimonteerabuth. Reachability in pushdown systems: algorithms and applications , 2009 .
[13] Antoni Mazurkiewicz,et al. CONCUR '97: Concurrency Theory , 1997, Lecture Notes in Computer Science.
[14] Javier Esparza,et al. Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains , 2006, ATVA.
[15] Javier Esparza,et al. Model-Checking LTL with Regular Valuations for Pushdown Systems , 2001, TACS.