Characterizing conclusive approximations by logical formulae

DOI10.1007/978-3-642-24288-5_8MaRDI QIDQ3172866zbMATH OpenOpenAlexFDO

Authors Thi-Bich-Hanh Dao, Valérie Murat, Yohan Boichut

Publication date 7 October 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-24288-5_8

Mathematics Subject Classification ID

Logic in computer science (03B70) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Finer Is Better: Abstraction Refinement for Rewriting Approximations
• Reachability analysis over term rewriting systems
• Reachability in conditional term rewriting systems
• Approximating Term Rewriting Systems: A Horn Clause Specification and Its Implementation
• Feasible Trace Reconstruction for Rewriting Approximations

Cited in

(7)

• Finer Is Better: Abstraction Refinement for Rewriting Approximations
• Reachability in conditional term rewriting systems
• Enhancing approximations for regular reachability analysis
• Determination of the class of validity of logical formulas by directed exhaustive search
• Reachability Analysis for Termination and Confluence of Rewriting
• SAT-based automated completion for reachability analysis
• Termination criteria for tree automata completion

This page was built for publication: Characterizing conclusive approximations by logical formulae

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