The following pages link to Yohan Boichut (Q2424679):
Displaying 17 items.
- (Q963462) (redirect page) (← links)
- A theoretical limit for safety verification techniques with regular fix-point computations (Q963463) (← links)
- Towards more precise rewriting approximations (Q2424681) (← links)
- Towards More Precise Rewriting Approximations (Q2799215) (← links)
- Synchronized Tree Languages for Reachability in Non-right-linear Term Rewrite Systems (Q2827837) (← links)
- (Q2958380) (← links)
- Characterizing Conclusive Approximations by Logical Formulae (Q3172866) (← links)
- (Q3181700) (← links)
- Finer Is Better: Abstraction Refinement for Rewriting Approximations (Q3522008) (← links)
- Handling Algebraic Properties in Automatic Analysis of Security Protocols (Q3525147) (← links)
- Feasible Trace Reconstruction for Rewriting Approximations (Q3527288) (← links)
- HANDLING NON LEFT-LINEAR RULES WHEN COMPLETING TREE AUTOMATA (Q3646168) (← links)
- How to Tackle Integer Weighted Automata Positivity (Q3646253) (← links)
- Handling Left-Quadratic Rules When Completing Tree Automata (Q4982086) (← links)
- Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives (Q5179050) (← links)
- Towards an Efficient Implementation of Tree Automata Completion (Q5505416) (← links)
- SAT-based automated completion for reachability analysis (Q6666788) (← links)
