PV: An Explicit Enumeration Model-Checker
Ratan Nalumasu6
and Ganesh Gopalakrishnan6 
| (6) |
Department of Computer Science, University of Utah, Salt Lake City, UT, 84112 |
Abstract
PV (Protocol Veri.er) is an explicit enumeration based modelchecker for verifying finite state systems for next-time free
LTL (LTL-X) properties. It implements a new partial order reduction algorithm, called Two-phase, that works in conjunction
with selective caching to combat the state explosion problem faced by model-checkers.
Supported in part by ARPA Order #B990 Under SPAWAR Contract #N0039-95-C-018 (Avalanche), DARPA under contract #DABT6396C0094
(UV), and NSF MIP MIP-9321836.
References secured to subscribers.