Equivalence Checking Using Abstract BDDs - Semantic Scholar

Recommend Documents

Equivalence Checking for Infinite Systems using ... - Semantic Scholar

Abstract. In this paper, we provide a transformation from the branching bisim- ulation problem for infinite, concurrent, data-intensive systems in linear process.

Checking Semantics Equivalence of MDA ... - Semantic Scholar

Simulation-based Equivalence Checking between ... - Semantic Scholar

Equivalence-Checking with One-Counter ... - Semantic Scholar

Equivalence Checking of Combinational Circuits using Boolean

Symbolic Model Checking using SAT procedures instead of BDDs

Equivalence Checking of Partial Designs Using Dependency

Equivalence Checking of Array-Intensive Programs - Semantic Scholar

BDDs, Horn Clauses and Resolution - Semantic Scholar

Using ATL for Checking Models - Semantic Scholar

States vs. Traces in Model Checking by Abstract ... - Semantic Scholar

trace-complete model checking by modifying by refinement or by abstraction .... to be the crucial connective: in fact, the core of the state-based model checking.

Partial Completeness of Abstract Fixpoint Checking - Semantic Scholar

On Equivalence Checking of Nondeterministic Finite Automata

for language equivalence in nondeterministic finite automata and vari- ... Checking whether two nondeterministic finite automata (NFA) accept the same.

Equivalence Checking for Compiler Transformations in Behavioral

Transfer Level (RTL) implementation. ... of transformations on the former to compile it to RTL. ... program before and after application of each transformation to.

Equivalence Checking for Behaviorally Synthesized Pipelines

Jun 3, 2012 - RTL. We demonstrate the scalability of our approach on sev- eral synthesized ..... ables as follows. We first compute all program variables that.

Distributed On-the-Fly Equivalence Checking

Fast Equivalence-checking for Quantum Circuits

Oct 3, 2009 - arXiv:0909.4119v2 [quant-ph] 3 Oct 2009. Fast Equivalence-checking for Quantum Circuits. SHIGERU YAMASHITA. IGOR MARKOV.

Equivalence Checking of Reversible Circuits - informatik.uni-bremen.de

Scalable Sequential Equivalence Checking across ... - IBM Research

Equivalence Checking for Behaviorally Synthesized Pipelines

Jun 3, 2012 - loop to operate in parallel by executing a new iteration before the ..... on a workstation with 3GHz Intel Xeon processor with 2GB memory.

PATH BASED EQUIVALENCE CHECKING OF PETRI ...

Combinational Techniques for Sequential Equivalence Checking

A Value Propagation Based Equivalence Checking

A typical synthesis flow of complex systems like VLSI ... specification (of the systems to be designed) with a view to ... design which is the output of the last phase.

Data-Driven Equivalence Checking - Stanford CS Theory

By construction, if the queries suc- ceed they constitute an inductive proof of equivalence of the two loops. It is wort

Equivalence Checking Using Abstract BDDs - Semantic Scholar

Download PDF

1 downloads 0 Views 558KB Size Report

Comment

Oct 1, 1997 - Carnegie Mellon University. Y Lu. Carnegie Mellon University. M Minea. Carnegie Mellon University. Edmund M. Clarke. Carnegie Mellon ...

Carnegie Mellon University

Research Showcase Computer Science Department

School of Computer Science

10-1-1997

Equivalence Checking Using Abstract BDDs S Jha Carnegie Mellon University

Y Lu Carnegie Mellon University

M Minea Carnegie Mellon University

Edmund M. Clarke Carnegie Mellon University, [email protected]

Recommended Citation Jha, S; Lu, Y; Minea, M; and Clarke, Edmund M., "Equivalence Checking Using Abstract BDDs" (1997). Computer Science Department. Paper 417. http://repository.cmu.edu/compsci/417

This Conference Proceeding is brought to you for free and open access by the School of Computer Science at Research Showcase. It has been accepted for inclusion in Computer Science Department by an authorized administrator of Research Showcase. For more information, please contact [email protected].