Tamir Heyman

According to our database1, Tamir Heyman authored at least 13 papers between 1997 and 2014.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2014
Dominant Controllability Check Using QBF-Solver and Netlist Optimizer.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

2007
Verifying Very Large Industrial Circuits Using 100 Processes and Beyond.
Int. J. Found. Comput. Sci., 2007

Deeper Bound in BMC by Combining Constant Propagation and Abstraction.
Proceedings of the 12th Conference on Asia South Pacific Design Automation, 2007

2006
A work-efficient distributed algorithm for reachability analysis.
Formal Methods Syst. Des., 2006

2005
Distributed Symbolic Model Checking for µ-Calculus.
Formal Methods Syst. Des., 2005

Achieving Speedups in Distributed Symbolic Reachability Analysis Through Asynchronous Computation.
Proceedings of the Correct Hardware Design and Verification Methods, 2005

2003
Scalable distributed on-the-fly symbolic model checking.
Int. J. Softw. Tools Technol. Transf., 2003

An Abstraction Algorithm for the Verification of Level-Sensitive Latch-Based Netlists.
Formal Methods Syst. Des., 2003

2002
A Scalable Parallel Algorithm for Reachability Analysis of Very Large Circuits.
Formal Methods Syst. Des., 2002

2001
On the Effective Deployment of Functional Formal Verification.
Formal Methods Syst. Des., 2001

2000
Achieving Scalability in Parallel Reachability Analysis of Very Large Circuits.
Proceedings of the Computer Aided Verification, 12th International Conference, 2000

1999
Model Checking the IBM Gigahertz Processor: An Abstraction Algorithm for High-Performance Netlists.
Proceedings of the Computer Aided Verification, 11th International Conference, 1999

1997
RuleBase: Model Checking at IBM.
Proceedings of the Computer Aided Verification, 9th International Conference, 1997


  Loading...