Underapproximation for model-checking based on universal circuits

DOI10.1016/J.IC.2010.01.001MaRDI QIDQ963058zbMATH OpenOpenAlexFDO

Authors Arie Matsliah, Ofer Strichman

Publication date 8 April 2010

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2010.01.001

zbMATH Keywords

\(k\)-universal circuit

Mathematics Subject Classification ID

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

Recommendations

• Underapproximation for Model-Checking Based on Random Cryptographic Constructions
• Universal circuits (Preliminary Report)
• A Depth-Universal Circuit
• Unit checking output tests under constant faults for functional elements
• A probabilistic and approximated approach to circuit-based formal verification

Cites work

• Counterexample-guided abstraction refinement for symbolic model checking
• Hardness vs randomness
• scientific article; zbMATH DE number 1956569 (Why is no real title available?)
• scientific article; zbMATH DE number 1956580 (Why is no real title available?)
• scientific article; zbMATH DE number 1903347 (Why is no real title available?)
• Problems and algorithms for covering arrays
• Proof-guided underapproximation-widening for multi-process systems
• Underapproximation for Model-Checking Based on Random Cryptographic Constructions
• Underapproximation for model-checking based on universal circuits
• Vector sets for exhaustive testing of logic circuits

Cited in

(2)

• Underapproximation for Model-Checking Based on Random Cryptographic Constructions
• Underapproximation for model-checking based on universal circuits

This page was built for publication: Underapproximation for model-checking based on universal circuits

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