| | |
Summary: On the Existence of Network Invariants for
Verifying Parameterized Systems \Lambda
Parosh Aziz Abdulla
Dept. Computer Systems
Uppsala University
P.O.Box 325
751 05 Uppsala, Sweden
parosh@docs.uu.se
Bengt Jonsson
Dept. Computer Systems
Uppsala University
P.O.Box 325,
751 05 Uppsala, Sweden
bengt@docs.uu.se
Abstract
Over the last decade, finitestate verification methods have been
developed to an impressive tool for analysis of complex programs, such
as protocols and hardware circuits. Partialorder reduction and BDD
based symbolic model checking have been instrumental in this devel
opment. Currently, much effort is devoted to advancing further the
|