( en | de | ru )

 

Disambiguation of "Heyman, Tamir"

Author of the publication

copydeleteadd this publication to your clipboard
A work-efficient distributed algorithm for reachability analysis.

, , and . Formal Methods Syst. Des., 29 (2): 157-175 (2006)

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.

Tamir Fine

Berhan Tamir

Elias Tamiru

Dereje Tamiru

Tamir Hegazy

 

Other publications of authors with the same name

Deeper Bound in BMC by Combining Constant Propagation and Abstraction., , , , , , and . ASP-DAC, page 304-309. IEEE Computer Society, (2007)Dominant Controllability Check Using QBF-Solver and Netlist Optimizer., , , , and . SAT, volume 8561 of Lecture Notes in Computer Science, page 227-242. Springer, (2014)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)A Work-Efficient Distributed Algorithm for Reachability Analysis., , and . CAV, volume 2725 of Lecture Notes in Computer Science, page 54-66. Springer, (2003)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)Distributed Symbolic Model Checking for µ-Calculus., , and . CAV, volume 2102 of Lecture Notes in Computer Science, page 350-362. Springer, (2001)Distributed Symbolic Model Checking for µ-Calculus., , and . Formal Methods Syst. Des., 26 (2): 197-219 (2005)Achieving Speedups in Distributed Symbolic Reachability Analysis Through Asynchronous Computation., , , and . CHARME, volume 3725 of Lecture Notes in Computer Science, page 129-145. Springer, (2005)