Using the HOL prove assistant for proving the correctness of term rewriting rules reducing terms of sequential behavior

DOI10.1007/3-540-55179-4_27MaRDI QIDQ6493545FDO

Authors Matthias Mutz

Publication date 29 April 2024

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Cites work

• scientific article; zbMATH DE number 3960965 (Why is no real title available?)
• scientific article; zbMATH DE number 3702108 (Why is no real title available?)
• scientific article; zbMATH DE number 3548491 (Why is no real title available?)
• Automatic Verification of Sequential Circuits Using Temporal Logic

This page was built for publication: Using the HOL prove assistant for proving the correctness of term rewriting rules reducing terms of sequential behavior

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