White Paper: Scaling Formal Connectivity Checking To Multi-Billion-Gate SoCs With Specification Automation - FirstEDA
23107
portfolio_page-template-default,single,single-portfolio_page,postid-23107,ajax_fade,page_not_loaded,,qode-child-theme-ver-1.0.0,qode-theme-ver-14.5,qode-theme-bridge,wpb-js-composer js-comp-ver-6.0.5,vc_responsive

White Paper: Scaling Formal Connectivity Checking To Multi-Billion-Gate SoCs With Specification Automation

How to address specification and computational challenges, and scale formal connectivity checking to previously intractable problems.

 

Connectivity checking is a popular formal verification application. Formal tools can automatically generate assertions using a specification table as input and prove them exhaustively. Simulation-based verification, on the other hand, requires significantly more effort while providing a fraction of the coverage. However, chip complexity is rapidly increasing. ASICs and FPGAs for heterogeneous computing, 5G, AI, and ML applications have hundreds of thousands of deep connections to verify. The computational challenge is enormous. Furthermore, creating the connectivity specification is a time-consuming, error-prone task. The most recent papers on formal connectivity checking report results on designs of up to 200 million gates, with up to 132 thousand connections proven.

 

This paper presents an innovative approach to addresses both specification and computational challenges, and scale formal connectivity checking to previously intractable problems. Results are reported on a multi-billion-gate SoC fabric in the latest technology node with over 1 million connections to specify and verify.