Underapproximation for Model-Checking Based on Random Cryptographic Constructions

DOI10.1007/978-3-540-73368-3_39MaRDI QIDQ5429328zbMATH OpenOpenAlexFDO

Authors Arie Matsliah, Ofer Strichman

Publication date 29 November 2007

Published in Computer Aided Verification (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73368-3_39

Mathematics Subject Classification ID

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

Recommendations

• Underapproximation for model-checking based on universal circuits
• Formal Methods in Computer-Aided Design
• A probabilistic and approximated approach to circuit-based formal verification
• Under-approximating loops in C programs for fast counterexample detection
• Bounded model checking using satisfiability solving

Cited in

(2)

• Underapproximation for model-checking based on universal circuits
• A Randomized Algorithm for BBCSPs in the Prover-Verifier Model

This page was built for publication: Underapproximation for Model-Checking Based on Random Cryptographic Constructions

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