default search action
Tamir Heyman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [c10]Tamir Heyman, Dan Smith, Yogesh Mahajan, Lance Leong, Husam Abu-Haimed:
Dominant Controllability Check Using QBF-Solver and Netlist Optimizer. SAT 2014: 227-242
2000 – 2009
- 2007
- [j7]Limor Fix, Orna Grumberg, Amnon Heyman, Tamir Heyman, Assaf Schuster:
Verifying Very Large Industrial Circuits Using 100 Processes and Beyond. Int. J. Found. Comput. Sci. 18(1): 45-62 (2007) - [c9]Roy Armoni, Limor Fix, Ranan Fraer, Tamir Heyman, Moshe Y. Vardi, Yakir Vizel, Yael Zbar:
Deeper Bound in BMC by Combining Constant Propagation and Abstraction. ASP-DAC 2007: 304-309 - 2006
- [j6]Orna Grumberg, Tamir Heyman, Assaf Schuster:
A work-efficient distributed algorithm for reachability analysis. Formal Methods Syst. Des. 29(2): 157-175 (2006) - 2005
- [j5]Orna Grumberg, Tamir Heyman, Assaf Schuster:
Distributed Symbolic Model Checking for µ-Calculus. Formal Methods Syst. Des. 26(2): 197-219 (2005) - [c8]Limor Fix, Orna Grumberg, Amnon Heyman, Tamir Heyman, Assaf Schuster:
Verifying Very Large Industrial Circuits Using 100 Processes and Beyond. ATVA 2005: 11-25 - [c7]Orna Grumberg, Tamir Heyman, Nili Ifergan, Assaf Schuster:
Achieving Speedups in Distributed Symbolic Reachability Analysis Through Asynchronous Computation. CHARME 2005: 129-145 - 2003
- [j4]Jason Baumgartner, Tamir Heyman, Vigyan Singhal, Adnan Aziz:
An Abstraction Algorithm for the Verification of Level-Sensitive Latch-Based Netlists. Formal Methods Syst. Des. 23(1): 39-65 (2003) - [j3]Shoham Ben-David, Orna Grumberg, Tamir Heyman, Assaf Schuster:
Scalable distributed on-the-fly symbolic model checking. Int. J. Softw. Tools Technol. Transf. 4(4): 496-504 (2003) - [c6]Orna Grumberg, Tamir Heyman, Assaf Schuster:
A Work-Efficient Distributed Algorithm for Reachability Analysis. CAV 2003: 54-66 - 2002
- [j2]Tamir Heyman, Daniel Geist, Orna Grumberg, Assaf Schuster:
A Scalable Parallel Algorithm for Reachability Analysis of Very Large Circuits. Formal Methods Syst. Des. 21(3): 317-338 (2002) - 2001
- [j1]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. Formal Methods Syst. Des. 19(1): 35-44 (2001) - [c5]Orna Grumberg, Tamir Heyman, Assaf Schuster:
Distributed Symbolic Model Checking for µ-Calculus. CAV 2001: 350-362 - 2000
- [c4]Tamir Heyman, Daniel Geist, Orna Grumberg, Assaf Schuster:
Achieving Scalability in Parallel Reachability Analysis of Very Large Circuits. CAV 2000: 20-35 - [c3]Shoham Ben-David, Tamir Heyman, Orna Grumberg, Assaf Schuster:
Scalable Distributed On-the-Fly Symbolic Model Checking. FMCAD 2000: 390-404
1990 – 1999
- 1999
- [c2]Jason Baumgartner, Tamir Heyman, Vigyan Singhal, Adnan Aziz:
Model Checking the IBM Gigahertz Processor: An Abstraction Algorithm for High-Performance Netlists. CAV 1999: 72-83 - 1997
- [c1]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. CAV 1997: 480-483
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: