Quantification Scheduling P. Chauhan E. Clarke S. Jha J. Kukula H. Veith D....  Home/Search
Context
Related
| cmu.edu/~emc/paper...ion%20Methods2.pdf 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: cmu.edu/~emc/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BDDs) have significantly increased the size of the models that can be verified. The main problem in symbolic model checking is the image computation problem, i.e., e#ciently computing the successors or predecessors of a set of states. This paper is an in-depth study of the image computation problem. We analyze and ... (Update)
Active bibliography (related documents): More All
0.5: Model Checking - Clarke, Schlingloff (2000) (Correct)
0.0: Simulated Annealing Algorithms For Continuous Global Optimization - Locatelli (2000) (Correct)
0.0: Global Optimization For Constrained Nonlinear Programming - Wang (2001) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ chauhan-using,
author = "Quantification Scheduling Chauhan",
title = "Using Combinatorial Optimization Methods for",
url = "citeseer.ist.psu.edu/747936.html" }
Citations (may not include all citations):1527 Optimization by simulated annealing - Kirkpatrick, Jr et al. - 1983
828 Model Checking - Clarke, Grumberg et al. - 2000
421 A linear time heuristic for improving network partitions (context) - Fiduccia, Mattheyses - 1982
356 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
79 Symbolic Model Checking with partitioned transition relation.. - Burch, Clarke et al. - 1991
50 NuSMV: A new Symbolic Model Verifier - Cimatti, Clarke et al. - 1999
37 cient heuristic procedure for partitioning graphs (context) - Kernighan, Lin - 1970
26 Finding good approximate vertex and edge partitions is NP-ha.. (context) - Bui, Jones - 1992
19 To split or to conjoin: The question in image computation - Moon, Kukula et al. - 2000
14 A tutorial survey of theory and applications of simulated an.. (context) - Hajek - 1985
12 Convergence theorems for a class of simulated annealing algo.. (context) - B'elisle - 1992
2 Representing circuits more e#- ciently in Symbolic Model Che.. (context) - Burch, Clarke et al. - 1991
1 cient Model Checking by automated ordering of transition rel.. (context) - Geist, Beer - 1994
Documents on the same site (http://www.cs.cmu.edu/~emc/papers.htm): More
Hybrid Spectral Transform Diagrams - Clarke, Fujita, Heinle (1997) (Correct)
Another Look at LTL Model Checking - Clarke, Grumberg, Hamaguchi (1994) (Correct)
Verification of the Futurebus+ Cache Coherence Protocol - Clarke, Grumberg.. (1992) (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