Departmental Papers (CIS)

Date of this Version

July 2005

Document Type

Conference Paper

Comments

From the 17th International Conference, CAV 2005, Edinburgh, Scotland, UK, July 6-10, 2005.

Abstract

The verification problem for a system consisting of components can be decomposed into simpler subproblems for the components using assume-guarantee reasoning. However, such compositional reasoning requires user guidance to identify appropriate assumptions for components. In this paper, we propose an automated solution for discovering assumptions based on the L* algorithm for active learning of regular languages. We present a symbolic implementation of the learning algorithm, and incorporate it in the model checker NuSMV. Our experiments demonstrate significant savings in the computational requirements of symbolic model checking.

Subject Area

CPS Formal Methods

Publication Source

Lecture Notes in Computer Science: Computer Aided Verification

Volume

3576

Start Page

548

Last Page

562

DOI

10.1007/11513988_52

Copyright/Permission Statement

The original publication is available at www.springerlink.com

Share

COinS
 

Date Posted: 02 November 2005