Search the dblp DataBase
Tamir Heyman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Limor Fix, Orna Grumberg, Amnon Heyman, Tamir Heyman, Assaf Schuster
Verifying Very Large Industrial Circuits Using 100 Processes and Beyond. [Citation Graph (0, 0)][DBLP]
ATVA, 2005, pp:11-25 [Conf] - Jason Baumgartner, Tamir Heyman, Vigyan Singhal, Adnan Aziz
Model Checking the IBM Gigahertz Processor: An Abstraction Algorithm for High-Performance Netlists. [Citation Graph (0, 0)][DBLP]
CAV, 1999, pp:72-83 [Conf] - Ilan Beer, Shoham Ben-David, Cindy Eisner, Daniel Geist, Leonid Gluhovsky, Tamir Heyman, Avner Landver, P. Paanah, Yoav Rodeh, G. Ronin, Yaron Wolfsthal
RuleBase: Model Checking at IBM. [Citation Graph (0, 0)][DBLP]
CAV, 1997, pp:480-483 [Conf] - Orna Grumberg, Tamir Heyman, Assaf Schuster
Distributed Symbolic Model Checking for µ-Calculus. [Citation Graph (0, 0)][DBLP]
CAV, 2001, pp:350-362 [Conf] - Orna Grumberg, Tamir Heyman, Assaf Schuster
A Work-Efficient Distributed Algorithm for Reachability Analysis. [Citation Graph (0, 0)][DBLP]
CAV, 2003, pp:54-66 [Conf] - Tamir Heyman, Daniel Geist, Orna Grumberg, Assaf Schuster
Achieving Scalability in Parallel Reachability Analysis of Very Large Circuits. [Citation Graph (0, 0)][DBLP]
CAV, 2000, pp:20-35 [Conf] - Orna Grumberg, Tamir Heyman, Nili Ifergan, Assaf Schuster
Achieving Speedups in Distributed Symbolic Reachability Analysis Through Asynchronous Computation. [Citation Graph (0, 0)][DBLP]
CHARME, 2005, pp:129-145 [Conf] - Shoham Ben-David, Tamir Heyman, Orna Grumberg, Assaf Schuster
Scalable Distributed On-the-Fly Symbolic Model Checking. [Citation Graph (0, 0)][DBLP]
FMCAD, 2000, pp:390-404 [Conf] - Yael Abarbanel-Vinov, Neta Aizenbud-Reshef, Ilan Beer, Cindy Eisner, Daniel Geist, Tamir Heyman, Iris Reuveni, Eran Rippel, Irit Shitsevalov, Yaron Wolfsthal, Tali Yatzkar-Haham
On the Effective Deployment of Functional Formal Verification. [Citation Graph (0, 0)][DBLP]
Formal Methods in System Design, 2001, v:19, n:1, pp:35-44 [Journal] - Jason Baumgartner, Tamir Heyman, Vigyan Singhal, Adnan Aziz
An Abstraction Algorithm for the Verification of Level-Sensitive Latch-Based Netlists. [Citation Graph (0, 0)][DBLP]
Formal Methods in System Design, 2003, v:23, n:1, pp:39-65 [Journal] - Orna Grumberg, Tamir Heyman, Assaf Schuster
Distributed Symbolic Model Checking for µ-Calculus. [Citation Graph (0, 0)][DBLP]
Formal Methods in System Design, 2005, v:26, n:2, pp:197-219 [Journal] - Tamir Heyman, Daniel Geist, Orna Grumberg, Assaf Schuster
A Scalable Parallel Algorithm for Reachability Analysis of Very Large Circuits. [Citation Graph (0, 0)][DBLP]
Formal Methods in System Design, 2002, v:21, n:3, pp:317-338 [Journal] - Orna Grumberg, Tamir Heyman, Assaf Schuster
A work-efficient distributed algorithm for reachability analysis. [Citation Graph (0, 0)][DBLP]
Formal Methods in System Design, 2006, v:29, n:2, pp:157-175 [Journal] - Limor Fix, Orna Grumberg, Amnon Heyman, Tamir Heyman, Assaf Schuster
Verifying Very Large Industrial Circuits Using 100 Processes and Beyond. [Citation Graph (0, 0)][DBLP]
Int. J. Found. Comput. Sci., 2007, v:18, n:1, pp:45-62 [Journal] - Shoham Ben-David, Orna Grumberg, Tamir Heyman, Assaf Schuster
Scalable distributed on-the-fly symbolic model checking. [Citation Graph (0, 0)][DBLP]
STTT, 2003, v:4, n:4, pp:496-504 [Journal]
Deeper Bound in BMC by Combining Constant Propagation and Abstraction. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002