scholar.google.com › citations
We report on experiments to integrate tree automata in Coq using shallow and deep reflec- tion techniques. While shallow reflection seems more natural in this ...
Aug 24, 2001 · We report on experiments to integrate tree automata in Coq using shallow and deep reflection techniques. While shallow reflection seems more ...
In one of our approaches, finite models will be presented in the form of tree automata, and formally checking models in this case essentially amounts to ...
Experiments with Finite Tree Automata in Coq. https://doi.org/10.1007/3-540-44755-5_25 · Full text. Journal: Lecture Notes in Computer Science Theorem Proving ...
This library provides proved algorithms on non deterministic and top down tree automatas (merge, intersection, acceptation of a term, calculus and deletion of ...
Missing: Experiments | Show results with:Experiments
Apr 24, 2018 · Our experiments show that tree automata are sufficiently expressive to prove intricate safety properties and sufficiently simple for the ...
Additionally, egg provides a convenient API for experimenting with and implementing tree automata techniques, even when equivalence classes aren't required.
It consists of building a smaller program (called the checker) - certified in Coq - that checks if the tree automaton computed by Timbuk is sound. In this paper ...
Interaction trees (ITrees) are a general-purpose data structure for representing the behaviors of recursive programs that interact with their environments.
We may think of a tree automaton as assigning a state to each tree; namely, the final state of the automaton after processing the tree. We may consider all ...
Missing: Experiments | Show results with:Experiments