Mechanizing proofs of computation equivalence

DOI10.1007/3-540-48683-6_31MaRDI QIDQ4818803zbMATH OpenFDO

Authors Marcelo Glusman, Shmuel Katz

Publication date 24 September 2004

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

Full work available at URL https://doi.org/10.1007/3-540-48683-6_31

Mathematics Subject Classification ID

Recommendations

• Mechanical proofs about computer programs
• Toward mechanical methods for streamlining proofs
• Computational equivalence and classical recursion theory
• A mechanized proof environment for the convenient computations proof method
• On the desirability of mechanizing calculational proofs
• scientific article; zbMATH DE number 4083010
• Solvability of equivalence problem for program machines
• Mechanised computability theory
• Autarkic computations in formal proofs
• scientific article; zbMATH DE number 4155933

Cited in

(7)

• Automated proofs of equality problems in Overbeek's competition
• A mechanized proof environment for the convenient computations proof method
• scientific article; zbMATH DE number 4083010 (Why is no real title available?)
• A computer-checked verification of Milner's scheduler
• Presenting machine-found proofs
• scientific article; zbMATH DE number 3212023 (Why is no real title available?)
• Formal Methods in Computer-Aided Design

This page was built for publication: Mechanizing proofs of computation equivalence

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