Static analysis of pattern-free properties
Horatiu Cirstea, Pierre Lermusiaux, Pierre‐Etienne Moreau · 2021
Rewriting is a widely established formalism with major applications in computer science. It is indeed a staple of many formal verification applications as it is especially well suited to describe program semantics and transformations. In particular, constructor based term rewriting systems are generally used to illustrate the behaviour of functional programs.