Finer Is Better: Abstraction Refinement for Rewriting Approximations

DOI10.1007/978-3-540-70590-1_4zbMath1145.68442OpenAlexW1858687778MaRDI QIDQ3522008

Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko, Yohan Boichut

Publication date: 28 August 2008

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70590-1_4

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (6)

Towards more precise rewriting approximations ⋮ Symbol different term rewrite systems ⋮ TAGED Approximations for Temporal Properties Model-Checking ⋮ Synchronized Tree Languages for Reachability in Non-right-linear Term Rewrite Systems ⋮ Handling Left-Quadratic Rules When Completing Tree Automata ⋮ How to Tackle Integer Weighted Automata Positivity

Uses Software

• Timbuk

This page was built for publication: Finer Is Better: Abstraction Refinement for Rewriting Approximations