Rewriting for deduction and verification

DOI10.1007/3-540-45127-7_2MaRDI QIDQ2778866zbMATH OpenFDO

Authors Michaël Rusinowitch

Publication date 21 March 2002

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2051/20510002

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Computing methodologies and applications (68U99)

Recommendations

• Term rewriting
• Structures for abstract rewriting
• Term rewriting induction
• A rewriting strategy for protocol verification
• Mechanizing Mathematical Reasoning

Cited in

(6)

• A rewriting approach to satisfiability procedures.
• Toward a verification logic for rewriting logic
• A paramodulation-based calculus for refuting schemata of clause sets defined by rewrite rules
• Rewriting, inference, and proof
• Rewriting Techniques and Applications
• Deductive verification in decidable fragments with Ivy

This page was built for publication: Rewriting for deduction and verification

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