Theorem Proving Modulo Based on Boolean Equational Procedures

DOI10.1007/978-3-540-78913-0_25zbMath1139.03010OpenAlexW1510003740MaRDI QIDQ3498425

Camilo Rocha, José Meseguer

Publication date: 15 May 2008

Published in: Relations and Kleene Algebra in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78913-0_25

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

Related Items (4)

The Formal System of Dijkstra and Scholten ⋮ Twenty years of rewriting logic ⋮ Formalization of universal algebra in Agda ⋮ A rewriting logic approach to specification, proof-search, and meta-proofs in sequent systems

Uses Software

• Maude

This page was built for publication: Theorem Proving Modulo Based on Boolean Equational Procedures