See this document in CiteSeerX!

Probabilistic Verification of Multiple-Valued Functions (1999)  (Make Corrections)  (4 citations)
Elena Dubrova, Harald Sack
ISMVL



  Home/Search   Context   Related

 
View or download:
ele.kth.se/~elena/PAPE...ismvl00_1.ps.Z
Cached:  PDF   PS.gz  PS  Image  Update  Help

From:  ele.kth.se/~elena/pub (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: This paper describes a probabilistic method for verifying the equivalence of two multiple-valued functions. Each function is hashed to an integer code by transforming it to a integer-valued polynomial and the equivalence of two polynomials is checked probabilistically. The hash codes for two equivalent functions are always the same. Thus, the equivalence of two functions can be verified with a known probability of error, arising from collisions between inequivalent functions. Such a... (Update)

Context of citations to this paper:   More

...test for Parity OBDDs [8] to the multiple valued case. Our extension employs the concept of multiple valued signatures introduced in [9] for identifying the equivalence of two multiple valued functions probabilistically. In the Boolean case, Parity OBDDs are a special case of...

...of the long simulation runs, this simulation based verification has very low coverage. In contrast, the probabilistic verification method [13, 14] is very efficient allowing a much larger coverage. 4. Novelty The novelty of the project is in combining different verification...

Cited by:   More
Testing Equivalence Probabilistically - Adnan Darwiche And (2002)   (Correct)
Formal Verification using Probabilistic Techniques - Krenz, Dubrova   (Correct)
Probabilistic Verification Methodology for DSP ASICs - Application For Graduate   (Correct)

Similar documents (at the sentence level):
25.9%:   Probabilistic Verification of Multiple-Valued Functions - Dubrova, Sack (1999)   (Correct)

Active bibliography (related documents):   More   All
0.8:   Multiple-Valued Logic in VLSI: Challenges and Opportunities - Dubrova (1999)   (Correct)
0.4:   Representation of Multiple-Valued Functions with Mod-p.. - Sack, Dubrova, Meinel (2000)   (Correct)
0.3:   Set Manipulation with Boolean Functional Vectors - For Symbolic Reachability   (Correct)

Similar documents based on text:   More   All
0.3:   A Conjunctive Canonical Expansion of Multiple-Valued Functions - Elena Dubrova Petra   (Correct)
0.3:   Non-Silicon Non-Binary Computing: Why not? - Dubrova, Jamal, Mathew   (Correct)
0.3:   Mod-p Decision Diagrams: A Data Structure for Multiple-Valued.. - Sack, al. (1999)   (Correct)

Related documents from co-citation:   More   All
3:   Graph-based algorithms for boolean function manipulation - Bryant - 1986
3:   Probabilistic Verification of Boolean Functions (context) - Jain, Bitner et al. - 1992
2:   Equivalence of Free Boolean Graphs Can be Decided Probabilistically in Polynomia.. (context) - Blum, Chandra et al. - 1980

BibTeX entry:   (Update)

E. Dubrova, H. Sack, Probabilistic verification of multiple-valued functions, Tech. Report 99-23, University of Trier, FB IV-Informatik, Nov. 1999. http://citeseer.ist.psu.edu/article/dubrova99probabilistic.html   More

@inproceedings{ dubrova00probabilistic,
    author = "Elena Dubrova and Harald Sack",
    title = "Probabilistic Verification of Multiple-Valued Functions",
    booktitle = "{ISMVL}",
    pages = "460-466",
    year = "2000",
    url = "citeseer.ist.psu.edu/article/dubrova99probabilistic.html" }
Citations (may not include all citations):
1726   Graph-based algorithm for Boolean function manipulation - Bryant - 1986
837   Cambridge University Press (context) - Motwani, Raghavan et al. - 1995
47   Equivalence of free Boolean graphs can be decided probabilis.. (context) - Blum, Chandra et al. - 1980
23   Multiple-valued logic design tools (context) - Miller - 1993
16   Probabilistic verification of Boolean functions (context) - Jain, Bitner et al. - 1992
9   Springer Lecture Notes in Computer Science (context) - Group, for et al. - 1996
5   Brief Survey of Modern Algebra (context) - Birkhoff, MacLane - 1977
4   A four-level storage 4-Gb DRAM IEEE Journal of Solid-State C.. (context) - Okuda, Murotani - 1997
3   Digital circuit verification using partially-ordered state m.. - Bryant, Seger - 1994
2   Mb multilevel flash memory with 2 MB/s program rate for mass.. (context) - Nozoe - 1999
2   Fault simulation for sequential multi-valued logic networks (context) - Drechsler, Keim et al. - 1997
1   Verification of multiple-valued logic networks (context) - Drechsler - 1996

Documents on the same site (http://www.ele.kth.se/~elena/pub.html):   More
Multiple-Valued Logic in VLSI: Challenges and Opportunities - Dubrova (1999)   (Correct)
Evaluation of m-valued Fixed Polarity Generalizations of.. - Dubrova   (Correct)
A Fast Algorithm for Three-Level Logic Optimization - Dubrova, Ellervee (1999)   (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