Finer Is Better: Abstraction Refinement for Rewriting Approximations

DOI10.1007/978-3-540-70590-1_4zbMATH Open1145.68442OpenAlexW1858687778MaRDI QIDQ3522008FDOQ3522008

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

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

Recommendations

• Feasible Trace Reconstruction for Rewriting Approximations
• Reachability analysis over term rewriting systems
• Reachability analysis of term rewriting systems with Timbuk
• Towards an Efficient Implementation of Tree Automata Completion
• Characterizing conclusive approximations by logical formulae

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cited In (14)

• Reachability analysis of term rewriting systems with Timbuk
• Feasible Trace Reconstruction for Rewriting Approximations
• How to Tackle Integer Weighted Automata Positivity
• TAGED Approximations for Temporal Properties Model-Checking
• Handling left-quadratic rules when completing tree automata
• Towards more precise rewriting approximations
• Reachability in conditional term rewriting systems
• Characterizing conclusive approximations by logical formulae
• Tools and Algorithms for the Construction and Analysis of Systems
• Symbol different term rewrite systems
• Synchronized tree languages for reachability in non-right-linear term rewrite systems
• SAT-based automated completion for reachability analysis
• Rewriting Techniques and Applications
• Towards more precise rewriting approximations

Uses Software

• Timbuk

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522008)