Accelerating predicate abstraction by minimum unsatisfiable cores extraction
DOI10.1007/978-981-16-1877-2_1zbMATH Open1481.68032OpenAlexW3153030442MaRDI QIDQ1980482FDOQ1980482
Authors: Jian-Min Zhang, Kefan Ma, Tiejun Li 
Publication date: 8 September 2021
Full work available at URL: https://doi.org/10.1007/978-981-16-1877-2_1
Recommendations
- Faster Extraction of High-Level Minimal Unsatisfiable Cores
- Theory and Applications of Satisfiability Testing
- A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
- Predicate abstraction with minimum predicates
- Using Counterexample Analysis to Minimize the Number of Predicates for Predicate Abstraction
model checkingformal verificationpredicate abstractionBoolean satisfiabilityminimum unsatisfiable core
Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70) Mathematical problems of computer architecture (68M07)
Cites Work
- Theory and Applications of Satisfiability Testing
- Algorithms for computing minimal unsatisfiable subsets of constraints
- A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
- Faster Extraction of High-Level Minimal Unsatisfiable Cores
- Towards efficient MUS extraction
- Using local search to find MSSes and MUSes
- On computing the union of MUSes
- Approximate counting of minimal unsatisfiable subsets
- Finding a collection of MUSes incrementally
- MUS Extraction Using Clausal Proofs
- An approach for extracting a small unsatisfiable core
- FMUS2: An Efficient Algorithm to Compute Minimal Unsatisfiable Subsets
Cited In (2)
This page was built for publication: Accelerating predicate abstraction by minimum unsatisfiable cores extraction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1980482)
