99 results on '"Quer S"'
Search Results
2. Back to Basics: Solving Games with SAT
3. An innovative Strategy to Quickly Grade Functional Test Programs
4. A Parallel Approach to Symbolic Traversal based on Set Partitioning
5. ICS2 - Evaluating Burn-In related metrics for large Automotive Systems-on-Chip
6. Parallel Multi-thread Analysis of Extremely Large Simulation Traces
7. A novel SAT-based approach to the task graph cost-optimal scheduling problem
8. Partitioning interpolant-based verification for effective unbounded model checking
9. Accelerated Analysis of Simulation Dumps through Parallelization on Multicore Architectures
10. Exploiting Target Enlargement and Dynamic Abstraction within Mixed BDD and SAT Invariant Checking
11. Accelerated Analysis of Simulation Dumps through Parallelization on Multicore Architectures
12. A Parallel Approach to Symbolic Traversal based on Set Partitioning
13. Efficient Complex High-Precision Computations on GPUs without Precision Loss
14. To split or to group: from divide-and-conquer to sub-task sharing for verifying multiple properties in model checking
15. Utilising land watch data to determine long-term trends in abundance
16. Using land watch data to determine long-term trends in cetacean abundance
17. Fast Cone-Of-Influence Computation and Estimation in Problems with Multiple Properties
18. CDVS feature selection on embedded systems
19. Accurate and Efficient Visual Search on Embedded Systems
20. Tightening BDD-based approximate reachability with SAT-based clause generalization
21. Interpolation sequences revisited
22. Heuristic and exact techniques for aircraft maintenance scheduling
23. Speeding up model checking by exploiting explicit and hidden verification constraints
24. Trading-Off SAT Search and Variable Quantifications for Effective Unbounded Model Checking
25. Tightening BDD-based approximate reachability with SAT-based clause generalization∗.
26. Speeding up model checking by exploiting explicit and hidden verification constraints.
27. Can BDDs compete with SAT solvers on Bounded Model Checking?
28. Dynamic scheduling and clustering in symbolic image computation.
29. Biasing symbolic search by means of dynamic activity profiles.
30. Optimizing sequential verification by retiming transformations.
31. Exploiting timed transition relations in sequential cycle-based simulation of embedded systems
32. Improving symbolic reachability analysis by means of activity profiles
33. Improving the efficiency of BDD-based operators by means of partitioning
34. Power optimization of core-based systems by address bus encoding
35. Memory optimization in function and set manipulation with BDDs
36. Implicit manipulation of equivalence classes for large finite state machines
37. Decomposed symbolic forward traversals of large finite state machines.
38. Incremental re-encoding for symbolic traversal of product machines.
39. Extending equivalence class computation to large FSMs.
40. Symbolic traversals of data paths with auxiliary variables.
41. Enhancing FSM traversal by temporary re-encoding.
42. Full symbolic ATPG for large circuits.
43. Cycle-based symbolic simulation of gate-level synchronous circuits.
44. Efficient state space pruning in symbolic backward traversal.
45. Disjunctive Partitioning And Partial Iterative Squaring: An Effective Approach For Symbolic Traversal Of Large Circuits.
46. Computing timed transition relations for sequential cycle-based simulation.
47. Reachability analysis of large circuits using disjunctive partitioning and partial iterative squaring
48. Symbolic forward/backward traversals of large finite state machines
49. Biasing symbolic search by means of dynamic activity profiles
50. Extending equivalence class computation to large FSMs
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.