IDEALS Home University of Illinois at Urbana-Champaign logo The Alma Mater The Main Quad

Learning to Verify Branching Time Properties

Show full item record

Bookmark or cite this item: http://hdl.handle.net/2142/11092

Files in this item

File Description Format
PDF Learning to Verify Branching Time Properties.pdf (232KB) (no description provided) PDF
Title: Learning to Verify Branching Time Properties
Author(s): Vardhan, Abhay; Viswanathan, Mahesh
Subject(s): algorithms computer science
Abstract: We present a new model checking algorithm for verifying computation tree logic (CTL) properties. Our technique is based on using language inference to learn the fixpoints necessary for checking a CTL formula instead of computing them iteratively as is done in traditional model checking. This allows us to analyze infinite or large state-space systems where the traditional iterations may not converge or may take too long to converge. We allow fairness constraints to be specified for verification of various liveness properties. The main challenge in developing a learning based model checking algorithm for CTL is that CTL properties express nested fixpoints. We overcome this challenge by developing a new characterization of CTL properties in terms of functions that have unique fixpoints. We instantiate our technique to systems in which states are encoded as strings and use a regular inference algorithm to learn the CTL fixpoints. We prove that if the fixpoints have a regular representation, our procedure will always terminate with the correct answer. We have extended our LEVER tool to use the technique presented in this paper and demonstrate its effectiveness by verifying a number of parametric and integer systems.
Issue Date: 2005-08
Genre: Technical Report
Type: Text
URI: http://hdl.handle.net/2142/11092
Other Identifier(s): UIUCDCS-R-2005-2630
Rights Information: You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the University of Illinois at Urbana-Champaign Computer Science Department under terms that include this permission. All other rights are reserved by the author(s).
Date Available in IDEALS: 2009-04-20
 

This item appears in the following Collection(s)

Show full item record

Item Statistics

  • Total Downloads: 78
  • Downloads this Month: 3
  • Downloads Today: 0

Browse

My Account

Information

Access Key