Arie Gurfinkel  Home/Search
Context Related
| toronto.edu/~chech...rfinkelMSThesis.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: toronto.edu/~chech...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Multi-Valued Symbolic Model-Checking: Fairness, Counter-Examples, Running Time Arie Gurfinkel Master of Science Graduate Department of Computer Science University of Toronto 2003 Multi-valued model-checking is an effective technique for reasoning about systems with incomplete or inconsistent information. In particular, it is well suited for reasoning about abstract, partial, and feature-based system descriptions. The technique is based on extending the classical model-checking algorithm... (Update)
Similar documents based on text: More All
0.7: Generating Counterexamples for Multi-Valued Model-Checking - Gurfinkel, Chechik (Correct)
0.5: Model-Checking Infinite State-Space Systems with.. - Chechik, Devereux.. (2001) (Correct)
0.5: Temporal Logic Query Checking through Multi-Valued Model.. - Gurfinkel, Chechik (Correct)
BibTeX entry: (Update)
A. Gurfinkel. "Multi-Valued Symbolic Model-Checking: Fairness, Counter-Examples, Running Time". Master's thesis, University of Toronto, Department of Computer Science, October 2002. http://citeseer.ist.psu.edu/gurfinkel03multivalued.html More
@misc{ gurfinkel02multivalued,
author = "A. Gurfinkel",
title = "Multi-Valued Symbolic Model-Checking: Fairness, Counter-Examples, Running
Time",
text = "A. Gurfinkel. Multi-Valued Symbolic Model-Checking: Fairness, Counter-Examples,
Running Time. Master's thesis, University of Toronto, Department of Computer
Science, October 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/gurfinkel03multivalued.html" }
Citations (may not include all citations):1726 Graph-based algorithms for boolean function manipulation - Bryant - 1986
1097 Automatic Verification of FiniteState Concurrent Systems Usi.. (context) - Clarke, Emerson et al. - 1986
828 Model Checking - Clarke, Grumberg et al. - 1999
470 Design and Validation of Computer Protocols (context) - Holzmann - 1991
343 Introduction to Metamathematics (context) - Kleene - 1952
322 Fuzzy Sets (context) - Zadeh, Sets et al. - 1987
297 Symbolic Model Checking (context) - McMillan - 1993
206 The Model Checker SPIN - Holzmann - 1997
190 Results on the Propositional -calculus (context) - Kozen - 1983
183 A Useful Four-Valued Logic (context) - Belnap - 1977
181 Algebraic Decision Diagrams and Their Applications - Bahar, Frohm et al. - 1993
126 Binary Decision Diagrams (context) - Akers - 1978
98 State-Based Model Checking of Event-Driven System Requiremen.. - Atlee, Gannon - 1993
77 CUDD: CU Decision Diagram Package Release - Somenzi - 2001
74 Symbolic Model Checking of Probabilistic Processes Using MTB.. - Kwiatkowska, Norman et al. - 2000
[Article contains additional citations not shown here]
Documents on the same site (http://www.cs.toronto.edu/~chechik/publications.html): More
Formal Methods When Money is Tight - Chechik, Wong (1999) (Correct)
Bisimulation Analysis of SDL-Expressed Protocols: A Case Study - Chechik, Wang (Correct)
Automatic Analysis of Consistency between Requirements and.. - Chechik, Gannon (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC