TIUP: Effective Processor Verification with Tautology-Induced Universal Properties
Yufeng Li, Yiwei Ci, Qiusong Yang

TL;DR
This paper presents TIUP, a novel formal verification method that employs tautologies as universal properties to improve processor design verification efficiency and scalability.
Contribution
TIUP introduces the use of tautologies as universal properties, addressing false positives and scalability issues in formal processor verification.
Findings
TIUP effectively covers processor data and control paths.
TIUP reduces false positives in verification.
TIUP streamlines the verification process for engineers.
Abstract
Design verification is a complex and costly task, especially for large and intricate processor projects. Formal verification techniques provide advantages by thoroughly examining design behaviors, but they require extensive labor and expertise in property formulation. Recent research focuses on verifying designs using the self-consistency universal property, reducing verification difficulty as it is design-independent. However, the single self-consistency property faces false positives and scalability issues due to exponential state space growth. To tackle these challenges, this paper introduces TIUP, a technique using tautologies as universal properties. We show how TIUP effectively uses tautologies as abstract specifications, covering processor data and control paths. TIUP simplifies and streamlines verification for engineers, enabling efficient formal processor verification.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
