Underapproximation for model-checking based on universal circuits
From MaRDI portal
Publication:963058
DOI10.1016/j.ic.2010.01.001zbMath1191.68413MaRDI QIDQ963058
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
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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