26 results on '"Heyman, Tamir"'
Search Results
2. Achieving Speedups in Distributed Symbolic Reachability Analysis Through Asynchronous Computation
3. Verifying Very Large Industrial Circuits Using 100 Processes and Beyond
4. A Work-Efficient Distributed Algorithm for Reachability Analysis
5. Distributed Symbolic Model Checking for μ-Calculus
6. Achieving Scalability in Parallel Reachability Analysis of Very Large Circuits
7. Scalable Distributed On-the-Fly Symbolic Model Checking
8. Model Checking the IBM Gigahertz Processor: An Abstraction Algorithm for High-Performance Netlists
9. A work-efficient distributed algorithm for reachability analysis
10. Distributed Symbolic Model Checking for μ-Calculus
11. Scalable distributed on-the-fly symbolic model checking
12. An Abstraction Algorithm for the Verification of Level-Sensitive Latch-Based Netlists
13. A Scalable Parallel Algorithm for Reachability Analysis of Very Large Circuits
14. On the Effective Deployment of Functional Formal Verification
15. Verifying Very Large Industrial Circuits Using 100 Processes and Beyond
16. A Work-Efficient Distributed Algorithm for Reachability Analysis
17. Distributed Symbolic Model Checking for μ-Calculus
18. Scalable Distributed On-the-Fly Symbolic Model Checking
19. Achieving Scalability in Parallel Reachability Analysis of Very Large Circuits
20. Model Checking the IBM Gigahertz Processor: An Abstraction Algorithm for High-Performance Netlists
21. VERIFYING VERY LARGE INDUSTRIAL CIRCUITS USING 100 PROCESSES AND BEYOND
22. Deeper Bound in BMC by Combining Constant Propagation and Abstraction
23. Achieving Speedups in Distributed Symbolic Reachability Analysis Through Asynchronous Computation.
24. Verifying Very Large Industrial Circuits Using 100 Processes and Beyond.
25. Achieving Scalability in Parallel Reachability Analysis of Very Large Circuits.
26. Scalable Distributed On-the-Fly Symbolic Model Checking.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.