paper-with-me

홈 › Papers

Pragmatic Formal Verification Methodology for Clock Domain Crossing (CDC)

2024-04-20 · Aman Kumar, Muhammad Ul Haque Khan, Bijitendra Mittra

Modern System-on-Chip (SoC) designs are becoming more and more complex due to the technology upscaling. SoC designs often operate on multiple asynchronous clock domains, further adding to the complexity of the overall design. To make the devices power efficient, designers take a Globally-Asynchronous Locally-Synchronous (GALS) approach that creates multiple asynchronous domains. These Clock Domain Crossings (CDC) are prone to metastability effects, and functional verification of such CDC is very important to ensure that no bug escapes. Conventional verification methods, such as register transfer level (RTL) simulations and static timing analysis, are not enough to address these CDC issues, which may lead to verification gaps. Additionally, identifying these CDC-related bugs is very time-consuming and is one of the most common reasons for costly silicon re-spins. This paper is focused on the development of a pragmatic formal verification methodology to minimize the CDC issues by exercising Metastability Injection (MSI) in different CDC paths.

📄 PDF Abstract BibTeX arXiv:2406.06533

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Analogous Alignments: Digital "Formally" meets Analog

2024-09-23 · Hansa Mohanty, Deepak Narayan Gadde

The complexity of modern-day System-on-Chips (SoCs) is continually increasing, and it becomes increasingly challenging to deliver dependable and credible chips in a short time-to-market. Especially, in the case of test c…

NLP Verification: Towards a General Methodology for Certifying Robustness

2024-03-15 · Marco Casadio, Tanvi Dinkar, Ekaterina Komendantskaya, Luca Arnaboldi 외

Machine Learning (ML) has exhibited substantial success in the field of Natural Language Processing (NLP). For example large language models have empirically proven to be capable of producing text of high complexity and …

Semantic SimilaritySemantic Textual Similarity

Hard Math -- Easy UVM: Pragmatic solutions for verifying hardware algorithms using UVM

2024-12-06 · Mark Litterick, Aleksandar Ivankovic, Bojan Arsov, Aman Kumar

This paper presents pragmatic solutions for verifying complex mathematical algorithms implemented in hardware in an efficient and effective manner. Maximizing leverage of a known-answer-test strategy, based on predefined…

Math

Pragmatic Formal Verification of Sequential Error Detection and Correction Codes (ECCs) used in Safety-Critical Design

2024-04-28 · Aman Kumar

Error Detection and Correction Codes (ECCs) are often used in digital designs to protect data integrity. Especially in safety-critical systems such as automotive electronics, ECCs are widely used and the verification of …

ARSENAL: Automatic Requirements Specification Extraction from Natural Language

2014-03-13 · Shalini Ghosh, Daniel Elenius, Wenchao Li, Patrick Lincoln 외

Requirements are informal and semi-formal descriptions of the expected behavior of a complex system from the viewpoints of its stakeholders (customers, users, operators, designers, and engineers). However, for the purpos…