Handbook of theoretical computer science (vol. B)
Handbook of formal languages, vol. 3
A Method for Automatic Cryptographic Protocol Verification
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Using Reflection to Build Efficient and Certified Decision Procedures
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
ASIAN '00 Proceedings of the 6th Asian Computing Science Conference on Advances in Computing Science
Set-Based Analysis of Reactive Infinite-State Systems
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Stålmarck's Algorithm as a HOL Derived Rule
TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
Implementing a Model Checker for LEGO
FME '97 Proceedings of the 4th International Symposium of Formal Methods Europe on Industrial Applications and Strengthened Foundations of Formal Methods
Decidability and Closure Properties of Equational Tree Languages
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Certifying a Tree Automata Completion Checker
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Finite models for formal security proofs
Journal of Computer Security - 7th International Workshop on Issues in the Theory of Security (WITS'07)
| Hi-index | 0.00 |
Tree automata are a fundamental tool in computer science. We report on experiments to integrate tree automata in Coq using shallow and deep reflection techniques. While shallow reflection seems more natural in this context, it turns out to give disappointing results. Deep reflection is more difficult to apply, but is more promising.