In-Ho Moon, Fabio Somenzi  Home/Search
Context Related
| colorado.edu/~mooni...fmcad00sub.ps.gz colorado.edu/personal/m...fmcad00.ps.gz 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: colorado.edu/~moon...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Conjunction scheduling in image computation consists of clustering the parts of a transition relation and ordering the clusters, so that the size of the BDDs for the intermediate results of image computation stay small. We present an approach based on the analysis and permutation of the dependence matrix of the transition relation. Our algorithm computes a bordered-block lower triangular form of the matrix that heuristically minimized the active lifetime of variables, that is, the... (Update)
Similar documents based on text: More All
0.5: Dynamic Scheduling and Clustering in Symbolic Image.. - Cabodi, Camurati, Quer (2002) (Correct)
0.5: Modular Partitioning and Dynamic Conjunction Scheduling.. - Fb Informatik University (Correct)
0.4: Efficient Preimage Computation Using A Novel Success-Driven ATPG - Sheng, Hsiao (2003) (Correct)
BibTeX entry: (Update)
I. Moon and F. Somenzi. Border-block triangular form and conjunction schedule in image computation. In Proceedings of the Formal Methods in Computer Aided Design (FMCAD '00), November 2000. To appear. http://citeseer.ist.psu.edu/moon00borderblock.html More
@inproceedings{ moon00borderblock,
author = "In-Ho Moon and Gary D. Hachtel and Fabio Somenzi",
title = "Border-Block Triangular Form and Conjunction Schedule in Image Computation",
booktitle = "Formal Methods in Computer-Aided Design",
pages = "73-90",
year = "2000",
url = "citeseer.ist.psu.edu/moon00borderblock.html" }
Citations (may not include all citations):1726 Graph-based algorithms for boolean function manipulation - Bryant - 1986
603 Kluwer Academic Publishers (context) - McMillan, Checking - 1994
114 VIS: A system for verification and synthesis - Brayton - 1996
91 Verification of sequential machines using boolean functional.. (context) - Coudert, Berthet et al. - 1989
58 Representing circuits more efficiently in symbolic model che.. (context) - Burch, Clarke et al. - 1991
41 Efficient model checking by automated ordering of transition.. - Geist, Beer - 1994
32 Efficient BDD algorithms for FSM synthesis and verification - Ranjan, Aziz et al. - 1995
29 ATPG aspects of FSM verification (context) - Cho, Hachtel et al. - 1990
27 Implicit enumeration of finite state machines using BDD's (context) - Touati, Savoj et al. - 1990
19 To split or to conjoin: The question in image computation - Moon, Kukula et al. - 2000
16 Variable ordering and selection for FSM traversal (context) - Jeong, Plessier et al. - 1991
11 Early quantification and partitioned transition relations (context) - Hojati, Krishnan et al. - 1996
9 The partitioned preassigned pivot procedure (context) - Hellerman, Rarick - 1972
5 Two algorithms for bipartite graphs (context) - Dulmadge, Mendelsohn - 1963
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://vlsi.colorado.edu/~mooni/publications.html): More
Incremental Verification Techniques with Error Trace Traversal.. - Ctl Model (Correct)
A Symbolic Algorithm for Low Power Sequential Synthesis - Kumthekar, Moon, Somenzi (1997) (Correct)
A Symbolic Algorithm for Low Power Sequential Synthesis - Kumthekar, Moon, Somenzi (1997) (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