Pattern eliminating transformations
From MaRDI portal
Publication:2119103
DOI10.1007/978-3-030-68446-4_4OpenAlexW3006404116MaRDI QIDQ2119103
Pierre-Etienne Moreau, Horatiu Cirstea, Pierre F. J. Lermusiaux
Publication date: 23 March 2022
Full work available at URL: https://hal.inria.fr/hal-02476012/file/main.pdf
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proving termination by dependency pairs and inductive theorem proving
- Termination criteria for tree automata completion
- Mechanizing and improving dependency pairs
- An overview of the K semantic framework
- Verifying higher-order functions with tree automata
- Termination of term rewriting using dependency pairs
- Automating the dependency pair method
- Towards Static Analysis of Functional Programs Using Tree Automata Completion
- Regular Transformations of Infinite Strings
- Completion of a Set of Rules Modulo a Set of Equations
- Term Rewriting and All That
- Program transformation and rewriting
- Higher-order multi-parameter tree transducers and recursion schemes for program verification
- Types and higher-order recursion schemes for verification of higher-order programs
- Algebraic Methodology and Software Technology
- Verifying higher-order functional programs with pattern-matching algebraic data types
- Streaming transducers for algorithmic verification of single-pass list-processing programs
- Rewriting Techniques and Applications
This page was built for publication: Pattern eliminating transformations
