Presentation
LINKED LIST PROOF ACCELERATOR
DescriptionLinked lists provide a flexible and efficient way to share resources across multiple queues. While implementing a linked list is straightforward, its verification poses complexities. Using traditional simulation techniques, finding and debugging can be challenging and time-consuming. Formal verification can accelerate this effort and enhance functional coverage. However, it is limited by the scale at which it can operate. Linked List Proof Accelerator is a generic and scalable solution that uses abstraction techniques to limit the state space and input parameterization for easy adoption. It enables quicker debugging and left-shifts the bug-finding phase to the design phase.
Event Type
Engineering Track Poster
TimeTuesday, June 255:02pm - 5:03pm PDT
LocationLevel 2 Exhibit Hall
Back-End Design
Embedded Systems
Front-End Design
IP