Logical relations in circuit verification

DOI10.1007/3-540-46674-6_14MaRDI QIDQ4501579zbMATH OpenFDO

Authors Mia Indrika

Publication date 28 July 2002

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

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

zbMATH Keywords

circuit combinatorscircuit verificationcombinational arithmetic circuitslogical relations

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Sketches and generalizations (18C30) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15)

Recommendations

• scientific article; zbMATH DE number 4049567
• Higher Order Logic and Hardware Verification
• A methodology for hardware verification based on logic simulation
• Certifying circuits in type theory
• Coquet: a Coq library for verifying hardware

Cited in

(2)

• scientific article; zbMATH DE number 1670772 (Why is no real title available?)
• scientific article; zbMATH DE number 4049567 (Why is no real title available?)

This page was built for publication: Logical relations in circuit verification

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