Pages that link to "Item:Q2845512"
From MaRDI portal
The following pages link to A satisfiability-based approach to abstraction refinement in model checking (Q2845512):
Displaying 14 items.
- An efficient approach for abstraction-refinement in model checking (Q690465) (← links)
- Lattice-based refinement in bounded model checking (Q1629959) (← links)
- Abstraction and Refinement in Model Checking (Q3591392) (← links)
- (Q4411974) (← links)
- (Q4427894) (← links)
- Automata-Based Abstraction Refinement for µHORS Model Checking (Q4635849) (← links)
- A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking (Q5044397) (← links)
- Theory and Applications of Satisfiability Testing (Q5325852) (← links)
- Theory and Applications of Satisfiability Testing (Q5325866) (← links)
- Automated Technology for Verification and Analysis (Q5394185) (← links)
- A type-directed abstraction refinement approach to higher-order model checking (Q5408403) (← links)
- Boolean Abstraction for Temporal Logic Satisfiability (Q5429344) (← links)
- Computer Aided Verification (Q5716598) (← links)
- Concrete abstractions. Formalizing and analyzing discrete theories and algorithms with the RISCAL model checker (Q6114445) (← links)