Incremental Rewriting Modulo SMT

DOI10.1007/978-3-031-38499-8_32MaRDI QIDQ6492769zbMATH OpenFDO

Authors Vivek Nigam, Carolyn Talcott

Publication date 26 April 2024

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-031-38499-8_32

Mathematics Subject Classification ID

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

Cites work

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

This page was built for publication: Incremental Rewriting Modulo SMT

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