Project report for Formal Semantics and Veri cation (CS388S) Karthikeyan...  Home/Search
Context
Related
| utexas.edu/users/karu/docs/graphs.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: utexas.edu/users/karu/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Succinct representations of graphs are important for model checking since BDDs shown exponential blowup for some important Boolean functions - like integer multiplication. In this project 3 di erent succinct graph representations are examined. The primary target for these models were VLSI CAD applications. In this project we show that one of the models - the Graph Construction Representation (GCR) model can be as succinct as OBDDs when a natural structure is present in the OBDDs. It is... (Update)
Active bibliography (related documents): More All
0.5: Algorithms for Efficient State Space Search - Ganai (2001) (Correct)
0.1: *BMDs Can Delay the Use of Theorem Proving for Verifying.. - Arditi (1996) (Correct)
0.1: Theorem Proving Support for Hardware Verification - Kapur (2000) (Correct)
Similar documents based on text: More All
0.3: List of Publications - Sankaralingam (2004) (Correct)
0.1: On Polynomial Sized MDP Succinct Policies - Liberatore (2004) (Correct)
0.1: A Technology-Scalable Architecture for Fast Clocks.. - Sankaralingam.. (2001) (Correct)
BibTeX entry: (Update)
@misc{ for-succinct,
author = "Project Report For",
title = "Succinct Representation of Graphs",
url = "citeseer.ist.psu.edu/700280.html" }
Citations (may not include all citations):1726 Graph-based algorithms for Boolean function manipulation - Bryant - 1986
173 the complexity of VLSI implementations and graph representat.. - Bryant - 1991
64 Area-time complexity for VLSI (context) - Thompson - 1979
48 A complexity theory based on boolean algebra (context) - Skyum, Valiant - 1981
33 Succinct Representation of Graphs (context) - Galperin - 1983
33 Succinct representations of graphs (context) - Galperin, Wigderson - 1983
31 A note on succinct representations of graphs (context) - Papadimitriou, Yannakakis - 1986
23 The complexity of equivalence and containment for free singl.. (context) - Fortune, Hopcroft et al. - 1978
22 Lower bounds for VLSI (context) - Lipton, Sedgewick - 1981
9 Some heuristics for generating tree-like FBDD types - Bern, Meinel et al. - 1994
6 Veri cation of arithmetic functions with binary moment diagr.. (context) - Bryant, Chen - 1994
2 Ecient boolean manipulation with OBDD's can be extended to F.. (context) - Gergov, Meinel - 1994
1 Bolean manipulation with free bdd's (context) - Bern, Gergov et al. - 1994
1 Ecient solution of connecitivity problems on hierarchically .. (context) - Lengauer, Wanke - 1988
Documents on the same site (http://www.cs.utexas.edu/users/karu/): More
Routed Inter-ALU Networks for ILP Scalability and.. - Sankaralingam, Singh, .. (2003) (Correct)
Evaluating the Instruction Folding Mechanism of the.. - Sankaralingam, Agaram (1999) (Correct)
List of Publications - Sankaralingam (2004) (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