Tamir Heyman

MaRDI QIDQ209465zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Dominant controllability check using QBF-solver and netlist optimizer Lecture Notes in Computer Science	2014-09-26	Paper
A work-efficient distributed algorithm for reachability analysis. Lecture Notes in Computer Science	2010-04-20	Paper
VERIFYING VERY LARGE INDUSTRIAL CIRCUITS USING 100 PROCESSES AND BEYOND International Journal of Foundations of Computer Science	2007-03-13	Paper
A work-efficient distributed algorithm for reachability analysis Formal Methods in System Design	2006-10-24	Paper
Correct Hardware Design and Verification Methods Lecture Notes in Computer Science	2006-10-20	Paper
Distributed symbolic model checking for \(\mu\)-calculus Formal Methods in System Design	2006-02-20	Paper
scientific article; zbMATH DE number 2102696 (Why is no real title available?)	2004-09-24	Paper
An abstraction algorithm for the verification of level-sensitive latch-based netlists Formal Methods in System Design	2004-03-15	Paper
A scalable parallel algorithm for reachability analysis of very large circuits Formal Methods in System Design	2003-05-04	Paper
scientific article; zbMATH DE number 1798187 (Why is no real title available?)	2002-11-04	Paper
On the effective deployment of functional formal verification Formal Methods in System Design	2002-02-10	Paper
scientific article; zbMATH DE number 1670766 (Why is no real title available?)	2001-11-11	Paper

Research outcomes over time

This page was built for person: Tamir Heyman