Incremental Rewriting Modulo SMT

DOI10.1007/978-3-031-38499-8_32MaRDI QIDQ6492769

Unnamed Author, Carolyn L. Talcott, Vivek Nigam

Publication date: 26 April 2024

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Cites Work

• Rewriting modulo SMT and open system analysis
• All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
• Depth-first iterative-deepening: An optimal admissible tree search
• Conditional rewriting logic as a unified model of concurrency

This page was built for publication: Incremental Rewriting Modulo SMT