Jason Baumgartner, Andreas Kuehlmann  Home/Search
Context
Related
| cadence.com/compan..._2004_Enhanced.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: cadence.com/com...l=bio_kuehlmann (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Bounded model checking (BMC) has gained widespread industrial use due to its relative scalability. Its exhaustiveness over all valid input vectors allows it to expose arbitrarily complex design flaws. However, BMC is limited to analyzing only a specific time window, hence will only expose those flaws which manifest within that window and thus cannot readily prove correctness. The diameter of a design has thus become an important concept --- a bounded check of depth equal to the diameter... (Update)
Active bibliography (related documents): More All
1.9: Scalable Automated Verification via Expert-System.. - Mony.. (2004) (Correct)
0.8: Property Checking via Structural Analysis - Baumgartner, Kuehlmann, Abraham (2002) (Correct)
0.8: Dynamic Transition Relation Simplification for Bounded Property.. - Kuehlmann (2004) (Correct)
Similar documents based on text:
4.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ baumgartner-enhanced,
author = "Jason Baumgartner and Andreas Kuehlmann",
title = "Enhanced Diameter Bounding via Structural Transformation",
url = "citeseer.ist.psu.edu/baumgartner04enhanced.html" }
Citations (may not include all citations):725 Temporal and modal logic (context) - Emerson - 1990
267 Computer-Aided Verification of Coordinating Processes (context) - Kurshan - 1994
244 Symbolic model checking without BDDs - Biere, Cimatti et al. - 1999
207 Retiming synchronous circuitry (context) - Leiserson, Saxe - 1991
47 Validation with guided search of the state space - Yang, Dill - 1998
41 Equivalence checking using cuts and heaps - Kuehlmann, Krohm - 1997
26 Checking safety properties using induction and a SAT-solver (context) - Sheeran, Singh et al. - 2000
17 On combining formal and informal verification - Yuan, Shen et al. - 1997
15 Circuit-based Boolean reasoning - Kuehlmann, Ganai et al. - 2001
12 Property checking via structural analysis - Baumgartner, Kuehlmann et al. - 2002
11 Robust Boolean reasoning for equivalence checking and functi.. (context) - Kuehlmann, Paruthi et al. - 2002
9 Minimizing interacting finite state machines: A compositiona.. - Aziz, Singhal et al. - 1994
8 Bisimulation and model checking - Fisler, Vardi - 1999
7 Efficient computation of recurrence diameters - Kroening, Strichman - 2003
6 Model checking the IBM Gigahertz Processor: An abstraction a.. - Baumgartner, Heyman et al. - 1999
6 Sat-based sequential depth computation (context) - Mneimneh, Sakallah - 2003
5 Transformation-based verification using generalized retiming - Kuehlmann, Baumgartner - 2001
4 Exploiting retiming in a guided simulation based validation .. (context) - Gupta, Ashar et al. - 1999
4 Optimizing sequential verification by retiming transformatio.. - Cabodi, Quer et al. - 2000
2 Simplifying circuits for formal verification using parametri.. - Moon, Kwak et al. - 2002
2 Automatic Structural Abstraction Techniques for Enhanced Ver.. (context) - Baumgartner - 2002
2 Verifying interacting finite state machines: Complexity issu.. - Aziz, Singhal et al. - 1993
2 Conflict driven learning in a quantified Boolean satisfiabil.. (context) - Zhang, Malik - 2002
2 Min-area retiming on flexible circuit structures - Baumgartner, Kuehlmann - 2001
2 Algorithms for Efficient State Space Search - Ganai - 2001
1 A practical approach to cycle bound estimation (context) - Yen, Chen et al. - 2002
1 An abstraction algorithm for the verification of generalized.. (context) - Baumgartner, Tripp et al. - 2000
Documents on the same site (http://www.cadence.com/company/cadence_labs/bio.aspx?xml=bio_kuehlmann): More
Sequential SPFDs - Sinha University Of (2001) (Correct)
Formal Verification of a PowerPC™ Microprocessor - Appenzeller, Kuehlmann (1995) (Correct)
Temporal Decomposition for Logic Optimization - Nathan Kitchen Andreas (2005) (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