A compositional symbolic verification framework for concurrent software

Authors:
Conghua Zhou
Affiliations:
Jiangsu University, Zhenjiang, China
Venue:
Proceedings of the 2nd international conference on Scalable information systems
Year:
2007

Citing 5
Cited 0

Model checking

Model checking
Symbolic Model Checking

Symbolic Model Checking
A Compositional Rule for Hardware Design Refinement

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Computing Abstractions of Infinite State Systems Compositionally and Automatically

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Counterexample-Guided Abstraction Refinement

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

For concurrent software systems state/event linear temporal logic SE-LTL is a specification language with high expressive power and the ability to reason about both states and events. Until now, SE-LTL model checking algorithm is still explicit. For SE-LTL we provide a SAT-based Bounded Model Checking procedure. We also present a framework for model checking concurrent software systems which integrates three powerful verification techniques, SAT-based Bounded Model Checking, counterexample-guided abstraction refinement and compositional reasoning. In the framework the abstraction and refinement steps are performed over each component separately, and the model checking step is symbolic.