## Symbolic compositional verification by learning assumptions (2005)

### Cached

### Download Links

- [www-faculty.cs.uiuc.edu]
- [dblpseer.psu.edu]
- [dblpseer.psu.edu]
- [dblpseer.psu.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | In CAV |

Citations: | 52 - 7 self |

### BibTeX

@INPROCEEDINGS{Alur05symboliccompositional,

author = {Rajeev Alur and P. Madhusudan and Wonhong Nam},

title = {Symbolic compositional verification by learning assumptions},

booktitle = {In CAV},

year = {2005},

pages = {548--562},

publisher = {Springer}

}

### Years of Citing Articles

### OpenURL

### Abstract

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 \Lambda 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.