Tamir Heyman

Available identifiers

zbMath Open heyman.tamirMaRDI QIDQ209465

List of research outcomes

Publication	Date of Publication	Type
Dominant Controllability Check Using QBF-Solver and Netlist Optimizer	2014-09-26	Paper
Computer Aided Verification	2010-04-20	Paper
VERIFYING VERY LARGE INDUSTRIAL CIRCUITS USING 100 PROCESSES AND BEYOND	2007-03-13	Paper
A work-efficient distributed algorithm for reachability analysis	2006-10-24	Paper
Correct Hardware Design and Verification Methods	2006-10-20	Paper
Distributed symbolic model checking for \(\mu\)-calculus	2006-02-20	Paper
https://portal.mardi4nfdi.de/entity/Q4817534	2004-09-24	Paper
An abstraction algorithm for the verification of level-sensitive latch-based netlists	2004-03-15	Paper
A scalable parallel algorithm for reachability analysis of very large circuits	2003-05-04	Paper
https://portal.mardi4nfdi.de/entity/Q4553260	2002-11-04	Paper
On the effective deployment of functional formal verification	2002-02-10	Paper
https://portal.mardi4nfdi.de/entity/Q2754071	2001-11-11	Paper

Research outcomes over time

This page was built for person: Tamir Heyman