Characterizing conclusive approximations by logical formulae

DOI10.1007/978-3-642-24288-5_8zbMATH Open1348.68081OpenAlexW113887578MaRDI QIDQ3172866FDOQ3172866

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

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

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

Mathematics Subject Classification ID

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

Cited In (4)

• Finer Is Better: Abstraction Refinement for Rewriting Approximations
• Determination of the class of validity of logical formulas by directed exhaustive search
• Termination criteria for tree automata completion
• SAT-based automated completion for reachability analysis

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)