Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

PV: An Explicit Enumeration Model-Checker

Ratan NalumasuContact Information and Ganesh GopalakrishnanContact Information

(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.

Contact Information Ratan Nalumasu
Email: ratan@cs.utah.edu
URL: http://www.cs.utah.edu/

Contact Information Ganesh Gopalakrishnan
Email: ganesh@cs.utah.edu
URL: http://www.cs.utah.edu/
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.105 • Server: mpweb16
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)