An efficient approach for abstraction-refinement in model checking

DOI10.1016/j.tcs.2011.12.014zbMath1252.68197OpenAlexW2069919327MaRDI QIDQ690465

Zhenhua Duan, Cong Tian, Nan Zhang

Publication date: 27 November 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.12.014

zbMATH Keywords

algorithmformal verificationmodel checkingrefinementabstraction

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Uses Software

• CESAR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of verification
• DESIGN AND SYNTHESIS OF SYNCHRONIZATION SKELETONS USING BRANCHING TIME TEMPORAL LOGIC
• Lazy abstraction
• Integrating Evolutionary Computation with Abstraction Refinement for Model Checking
• Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi

This page was built for publication: An efficient approach for abstraction-refinement in model checking