Summary: Automating Modular Verification ?
Rajeev Alur 1 Luca de Alfaro 2 Thomas A. Henzinger 3 Freddy Y.C. Mang 2
1 Department of Computer and Information Science, University of Pennsylvania, and Bell
Laboratories, Lucent Technologies. Email: alur@cis.upenn.edu
2 Department of Electrical Engineering and Computer Sciences, University of California at
Berkeley. Email: fdealfaro,fmangg@eecs.berkeley.edu
3 Department of Electrical Engineering and Computer Sciences, University of California,
Berkeley, and Max­Planck Institute for Computer Science, Saarbr˜ucken.
Email: tah@eecs.berkeley.edu
Abstract. Modular techniques for automatic verification attempt to overcome
the state­explosion problem by exploiting the modular structure naturally present
in many system designs. Unlike other tasks in the verification of finite­state sys­
tems, current modular techniques rely heavily on user guidance. In particular, the
user is typically required to construct module abstractions that are neither too de­
tailed as to render insufficient benefits in state exploration, nor too coarse as to
invalidate the desired system properties. In this paper, we construct abstract mod­
ules automatically, using reachability and controllability information about the
concrete modules. This allows us to leverage automatic verification techniques
by applying them in layers: first we compute on the state spaces of system com­
ponents, then we use the results for constructing abstractions, and finally we com­

Source: Alur, Rajeev - Department of Computer and Information Science, University of Pennsylvania

Collections: Computer Technologies and Information Sciences