Sökning: "equivalence checking"
Visar resultat 1 - 5 av 7 avhandlingar innehållade orden equivalence checking.
1. Dominator-based Algorithms in Logic Synthesis and Verification
Sammanfattning : Today's EDA (Electronic Design Automation) industry faces enormous challenges. Their primary cause is the tremendous increase of the complexity of modern digital designs. Graph algorithms are widely applied to solve various EDA problems. LÄS MER
2. Graph dominators in logic synthesis and verification
Sammanfattning : This work focuses on the usage of dominators in circuit graphs in order to reduce the complexity of synthesis and verification tasks. One of the contributions of this thesis is a new algorithm for computing multiple-vertex dominators in circuit graphs. LÄS MER
3. Verification of Infinite-State Systems : Decision Problems and Efficient Algorithms
Sammanfattning : This thesis presents methods for the verification of distributed systems with infinite state spaces. We consider several verification problems for lossy channel systems, a class of infinite-state systems consisting of finite-state machines that communicate over unbounded, but lossy, FIFO channels. LÄS MER
4. The Fusion Calculus : Expressiveness and Symmetry in Mobile Processes
Sammanfattning : The fusion calculus is presented as a significant step towards a canonical calculus of concurrency. It simplifies and extends the π-calculus of Milner, Parrow and Walker.The fusion calculus contains the polyadic π-calculus as a proper subcalculus and thus inherits all its expressive power. LÄS MER
5. Advancing concurrent system verification : Type based approach and tools
Sammanfattning : Concurrent systems, i.e., systems of parallel processes, are nearly ubiquitous and verifying the correctness of such systems is becoming an important subject. Many formalisms were invented for such purpose, however, new types of systems are introduced and there is a need for handling larger systems. LÄS MER