Underapproximation for model-checking based on universal circuits

DOI10.1016/j.ic.2010.01.001zbMath1191.68413OpenAlexW2050046223MaRDI QIDQ963058

Ofer Strichman, Arie Matsliah

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)

Related Items (1)

Underapproximation for model-checking based on universal circuits

Cites Work

• Underapproximation for model-checking based on universal circuits
• Hardness vs randomness
• Problems and algorithms for covering arrays
• Counterexample-guided abstraction refinement for symbolic model checking
• Vector sets for exhaustive testing of logic circuits
• Proof-guided underapproximation-widening for multi-process systems
• Underapproximation for Model-Checking Based on Random Cryptographic Constructions
• Unnamed Item
• Unnamed Item
• Unnamed Item

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