Author of the publication

Model Checking the IBM Gigahertz Processor: An Abstraction Algorithm for High-Performance Netlists.

, , , and . CAV, volume 1633 of Lecture Notes in Computer Science, page 72-83. Springer, (1999)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

An Abstraction Algorithm for the Verification of Level-Sensitive Latch-Based Netlists., , , and . Formal Methods Syst. Des., 23 (1): 39-65 (2003)On the Effective Deployment of Functional Formal Verification., , , , , , , , , and 1 other author(s). Formal Methods Syst. Des., 19 (1): 35-44 (2001)Deeper Bound in BMC by Combining Constant Propagation and Abstraction., , , , , , and . ASP-DAC, page 304-309. IEEE Computer Society, (2007)A work-efficient distributed algorithm for reachability analysis., , and . Formal Methods Syst. Des., 29 (2): 157-175 (2006)Achieving Scalability in Parallel Reachability Analysis of Very Large Circuits., , , and . CAV, volume 1855 of Lecture Notes in Computer Science, page 20-35. Springer, (2000)Model Checking the IBM Gigahertz Processor: An Abstraction Algorithm for High-Performance Netlists., , , and . CAV, volume 1633 of Lecture Notes in Computer Science, page 72-83. Springer, (1999)A Work-Efficient Distributed Algorithm for Reachability Analysis., , and . CAV, volume 2725 of Lecture Notes in Computer Science, page 54-66. Springer, (2003)Verifying Very Large Industrial Circuits Using 100 Processes and Beyond., , , , and . ATVA, volume 3707 of Lecture Notes in Computer Science, page 11-25. Springer, (2005)Dominant Controllability Check Using QBF-Solver and Netlist Optimizer., , , , and . SAT, volume 8561 of Lecture Notes in Computer Science, page 227-242. Springer, (2014)A Scalable Parallel Algorithm for Reachability Analysis of Very Large Circuits., , , and . Formal Methods Syst. Des., 21 (3): 317-338 (2002)