CJChandan Kumar Jha

Chandan Kumar Jha

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Chandan Kumar Jha has a total of 43 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    The Deception of Sight: Camouflaging Chips Information Against Optical Probing Attacks By Selective Increase of Local Density

    by Sajjad Parvin, Chandan Kumar Jha, Paul Flammarion, Sallar Ahmadi-Pour, Frank Sill Torres, Rolf Drechsler

    In recent years, a novel non-invasive laser-assisted attack known as Optical Probing (OP) has been demonstrated to effectively probe the internal state of integrated circuits. This attack exploits the relative transparency of the silicon substrate to Near-InfraRed (NIR) light, enabling optical access through the backside of the chip. Consequently, OP poses a significant threat to information processed or stored on the chip and may facilitate Intellectual Property (IP) theft or reverse engineering. Existing mitigation techniques can be broadly classified into three categories: (1) fabrication-level modifications, (2) sensor-based countermeasures, and (3) circuit-level design techniques. Fabrication-based countermeasures are costly and often incompatible with standard industrial manufacturing processes, limiting their practicality for OP-resilient chip design. Sensor-based countermeasures may be circumvented by adaptive attackers, whereas circuit-level techniques typically require modifications to the layout of standard-cell libraries. Such modifications are time-consuming and can introduce considerable PPA overheads relative to conventional standard-cell designs. Therefore, this study investigates whether increasing the local layout density around a target logic cell can enhance resilience against OP attacks without requiring modifications beyond the layout level. In this context, local density refers to the fraction of a predefined region surrounding the target cell that is occupied by neighboring logic cells and associated layout structures. Our methodology employs standard logic cells to protect the chip’s sensitive information from an adversary equipped with OP capabilities. We found that increasing the local density of surrounding logic cells near a target logic cell enhances overall reflection, effectively masking the reflection from the target logic cell. This can significantly improve the concealment of the secure cell’s information from the OP attack since the reflections from the neighboring logic cells overlap with the target logic cells that need to be secured. Hence, an adversary cannot distinguish the exact location of the source of reflection. We demonstrate that this methodology can effectively countermeasure against OP attacks by conducting detailed experiments on the relationship between density and reflection, using NAND, INVERTER, NOR, and Flip-Flop cells. We exhaustively evaluated thousands of placement strategies with varying densities to show the efficacy of our technique against OP attacks. Moreover, we demonstrate the integration of our OP attack mitigation technique into the ASIC flow for designing an AES-128 core. We demonstrate that our technique in the worst-case comes with a 1% increase in power consumption, a 1% increase in area, and no change in the operating frequency compared to the unprotected AES-128 core against OP attack.

  • Open Access

    Device-to-logic variability propagation in RRAM-based logic-in-memory architectures

    by Ankit Bende, Simranjeet Singh, Chandan Kumar Jha, Daniele Storelli, Dennis Nielinger, Rolf Drechsler, Regina Dittmann, Stephan Menzel, Farhad Merchant, Vikas Rana

    Logic-in-memory (LiM) has emerged as a promising paradigm to address the von Neumann bottleneck by integrating data storage and in-situ computation. Resistive random-access memory (RRAM) is a strong candidate for LiM owing to its non-volatility, fast switching characteristics, and compatibility with CMOS integration. However, intrinsic cycle-to-cycle and device-to-device variability fundamentally limits logic reliability in RRAM-based LiM architectures, necessitating well-defined device specifications and variability margins to ensure correct operation. In this work, we experimentally demonstrate a CMOS-integrated TaO x -based 1T1R RRAM computing fabric that supports reconfigurable LiM operations, including a functionally complete Boolean set and in-memory arithmetic primitives. Through extensive statistical measurements and variability-aware statistical modeling, we systematically evaluate the impact of key variability sources, SET voltage ( V SET ), low resistance state, and high resistance state, on logic correctness and identify the dominant contributors to computational failure. Finally, we derive the device specifications and requirements to achieve error-free stateful LiM operations in the 1T1R RRAM arrays.

  • Open Access

    Linear Formal Verification of Sequential Circuits using Weighted-AIGs

    by Mohamed Nadeem, Chandan Kumar Jha, Rolf Drechsler

    Ensuring the functional correctness of a digital system is achievable through formal verification. Despite the increased complexity of modern systems, formal verification still needs to be done in a reasonable time. Hence, Polynomial Formal Verification (PFV) techniques are being explored, as they provide guaranteed polynomial upper bounds on the time and space required for the verification process. Recently, it was shown that circuits characterized by a constant cutwidth can be verified in linear time using Answer Set Programming (ASP) . However, these results are limited to combinational circuits, whereas most designs used in digital systems are sequential. In this article, we introduce Linear Formal Verification (LFV) as a subclass of PFV for sequential circuits with constant cutwidth, which are verifiable in linear time and space using ASP. We achieve this by proposing a new data structure called Weighted And-Inverter Graph (W-AIG) . Unlike existing formal verification methods, we prove that our approach can verify any sequential circuit with a constant cutwidth in linear time and space. Finally, we implement our approach and experimentally show that a variety of sequential circuits, such as pipelined adders, serial adders, and shift registers, can be verified in linear time and space, while ring counters can be verified in polynomial time and space, confirming our theoretical findings.

  • Open Access

    Polynomial Debugging and Fault Correction of Combinational Circuits With Constant Cutwidth

    by Mohamed Nadeem, Chandan Kumar Jha, Rolf Drechsler

    Formal Verification (FV) is a widely used technique for verifying whether a gate-level design is functionally equivalent to its specification. However, when verification fails due to the presence of faults, Debugging and Fault Correction (DFC) becomes essential to localize bugs and correct them. Despite the success of various automatic DFC approaches, existing methods often lack theoretical guarantees on the computational resources required, making them unpredictable in terms of time and space complexity. Therefore, it is essential to establish upper bounds on the time and space complexity of the DFC process to ensure its practical feasibility. In this paper, we rely on the CutWidth (CW) property to introduce Polynomial Debugging and Fault Correction (PDFC) as a subclass of DFC for combinational circuits, where the time and space complexities of DFC are characterized by CW. Specifically, we show that for circuits with bounded CW, the entire DFC process can be polynomially bounded, unlike Yosys SAT, which has exponential complexity. Moreover, we prove that for circuits with constant CW, the entire DFC process can be carried out in linear time and space. Finally, we evaluate several architectures of adders with small constant cutwidth, considering various numbers and locations of faulty gates in terms of time and space required for the DFC process to confirm our theoretical findings and also compare it with Yosys SAT. To demonstrate that our PDFC approach is not limited to adders and can be applied to any design with bounded cutwidth, we also evaluate benchmark circuits from ITC’99 and IWLS’93 in terms of time and space of the DFC process.

  • Open Access

    Advanced And-Inverter Graph Decomposition Technique for Reducing Circuit Complexity

    by Mohamed Nadeem, Luca Müller, Chandan Kumar Jha, Rolf Drechsler

    In the field of Electronic Design Automation (EDA), managing circuit complexity is a crucial task for efficient circuit verification, testing, and optimization. Increasing design complexity presents challenges for tasks such as formal verification, fault detection, and circuit optimization. Therefore, reducing circuit complexity becomes crucial in improving the efficiency and scalability of these tasks. These circuits are typically represented as graphs. In the field of parameterized complexity, CutWidth (CW) and TreeWidth (TW) are well-studied decomposition techniques that have been used in analyzing graph algorithms. In this paper, we introduce the TW decomposition technique to the field of EDA for the first time and demonstrate its impact on reducing the circuit complexity of circuits. Additionally, we present a new decomposition technique that combines both decompositions, resulting in a further reduction in circuit complexity. Furthermore, we present experimental results comparing complexity upper bounds from various decompositions to highlight the efficacy of our approach on the ISCAS’85 and EPFL benchmark circuits. Our results show that our decomposition technique outperforms the complexity upper bounds of CW by 90.16× and the complexity upper bounds of TW by 9.34× for the ISCAS’85 benchmarks. Additionally, it outperforms the complexity upper bounds of CW by 1986.37× and the complexity upper bounds of TW by 94.13× for the EPFL benchmarks. Finally, to demonstrate the applicability of the decomposition techniques in solving various EDA problems, we propose a new Formal Verification (FV) approach that leverages these techniques to provide an upper bound for the verification process. We also conduct an experimental evaluation on the ITC’99 , MCNC’91 , and VHDL Library of Arithmetic Units ( ELAU ) benchmark circuits, adder circuits of various sizes (up to 3072-bit width), and Genmul multipliers of different sizes (up to 10×10), to demonstrate the scalability of our approach.

  • Open Access

    LLM-assisted Bug Identification and Correction for Verilog HDL

    by Khushboo Qayyum, Chandan Kumar Jha, Sallar Ahmadi-Pour, Muhammad Hassan, Rolf Drechsler

    As technology continues to advance, it becomes increasingly integrated into daily life facilitating complex tasks across a range of environments. While some applications such as smartphones and smartwatches are less critical, others like healthcare devices and autonomous vehicles demand bug-free performance to prevent financial loss or harm. Traditionally, simulation-based testing and formal verification played a major role in ensuring a bug-free device. However, the simulation of bigger systems is limited to a definite number of scenarios on the Design under Verification (DUV). Hence, it is unable to explore all possible inputs that can occur. Formal verification, on the other hand, offers a higher level of assurance through mathematical proofs but is both time-consuming and suffers from scalability issues, especially as designs grow in complexity. Recently, Large Language Models (LLMs) have shown promise in tasks previously limited to human expertise. Their natural language processing capabilities can assist in handling extensive specifications and source code, particularly in debugging hardware descriptions and analyzing security and functionality. The utilization of Retrieval Augmented Generation (RAG) has further enhanced LLMs by incorporating large specification or source code bases, thereby improving their bug-identification and correction capabilities. While recent advancements in LLMs, particularly with RAG, have yielded promising results in bug identification and correction for a small class of hardware bugs, significant gaps remain in their full potential for systematically addressing a wide range of hardware bugs. For instance, existing LLM methodologies struggle to detect bugs involving incorrect constant values, i.e., the use of wrong constants in source code. This limitation underscores the need for further exploration in utilizing LLMs to fully optimize the verification process. To bridge this gap, we propose a 3-phased 4-stage LLM-assisted systematic bug closure methodology that focuses on functional bugs in Verilog HDL rather than structural or syntactic issues. Our approach extracts functional properties of the DUV and systematically breaks down complex expressions into smaller sub-expressions to facilitate bug detection and correction. By employing RAG, the LLM is guided using the functional specifications and source code to identify and correct bugs. If the initial guidance through RAG is insufficient, our methodology initiates an iterative bug closure process. This includes incorporating more extensive information from the specifications, fetching additional lines of code for bug localization, and breaking down complex Verilog HDL expressions. In our comprehensive evaluation, we assess the LLM’s capabilities using 9 different categories of bugs. As benchmarks, we use 5 OpenTitan Intellectual Property (IP) cores to demonstrate the scalability and effectiveness of our bug closure methodology where ≈ 60% of the bugs were corrected. Specifically, we evaluate OpenAI’s GPT-4 in its ability to identify and correct functional bugs in Verilog HDL code.


  • veriSiM: Formal Verification of SPICE Netlists for MAGIC-Based Logic-in-Memory

    by Chandan Kumar Jha, Simranjeet Singh, Khushboo Qayyum, Ankit Bende, Muhammad Hassan, Vikas Rana, Farhad Merchant, Rolf Drechsler

    Advancements in emerging technologies have recently increased the traction of non-von Neumann design styles. One of the most popular design styles in this domain involves using memristors to perform logic operations in memory, known as logic-in-memory (LiM). memristor aided logic (MAGIC) is one of such LiM based design style that is widely used given its benefits in latency and energy. Several prior works have focused on the generation of logic operations, also called micro-operations, for LiM based on the MAGIC design style. Recently, the generation of SPICE netlists for MAGIC design style has been achieved by the MemSPICE tool. While this represents a significant step forward, verifying the correctness of the generated netlists still depends on SPICE-level simulations. These simulations become particularly impractical for medium-to-large designs presenting a bottleneck in the validation process. To address this limitation, in this article, we introduce veriSiM, an automated formal verification methodology for MAGIC-based LiM. More concretely, it ensures the correctness of the generated LiM SPICE netlists against the golden reference Verilog design. Our methodology involves generating clauses from the SPICE netlists and verifying them against clauses generated from the golden reference Verilog design, using the high-performance Z3 solver to perform the equivalence checking. The clause generation process from the SPICE netlists needs to be based on several conditions, which have been identified and discussed in detail. We have used several benchmarks from ISCAS’85, ISCAS’89, and ITC’99 to demonstrate the efficacy of the veriSiM methodology in formally verifying the LiM SPICE netlists.


  • Polynomial Formal Verification of Multi-Valued Approximate Circuits Within Constant Cutwidth

    by Mohamed Nadeem, Chandan Kumar Jha, Rolf Drechsler

    Ensuring functional correctness is achieved through formal verification. As circuit complexity increases, limiting the upper bounds for time and space required for verification becomes crucial. Polynomial Formal Verification (PFV) has been introduced to tackle this problem. In modern digital system designs, approximate circuits are widely employed in error resilient applications. Therefore, ensuring the functional correctness of these circuits becomes essential. In prior works, it has been proven that approximate circuits with constant cutwidth can be verified in linear time. However, extending binary logic verification to Multi-Valued Logic (MVL) introduces challenges, particularly regarding the encoding of MVL operators. It has been shown that MVL circuits with constant cutwidth can be verified in linear time using Answer Set Programming (ASP), due to the ASP encoding capabilities of MVL operators. In this paper, we present a PFV approach of MVL approximate circuits with constant cutwidth using ASP. We then demonstrate that the verification of MVL approximate circuits with constant cutwidth can be achieved in linear time. Finally, we evaluate various MVL approximate circuits with constant cutwidth across different logic levels to show the efficacy of our approach.


  • Correct and Verify—CAV: Exploiting Binary Decision Diagrams to Enable Formal Verification of Approximate Adders With Correct Carry Bits

    by Chandan Kumar Jha, Khushboo Qayyum, Muhammad Hassan, Rolf Drechsler

    Approximate adders have received significant attention as they give benefits in power, performance, and area for error-resilient applications. Due to their ubiquitous use, formal verification of approximate adders has also gained traction. However, prior works on formal verification of approximate adders are limited to relaxed equivalence checking, i.e., checking whether the approximate adder designs have an error less than a specified threshold. This method has limitations, as multiple approximate adder designs can satisfy the relaxed equivalence checking criterion, which can cause more than expected deterioration in the output quality. The deterioration in output quality is larger in approximate adder designs that produce exact results for some regions of the input space but have the freedom to produce approximate results in other regions of the input space. In this paper, we propose a methodology called Correct and Verify (CAV), which exploits Binary Decision Diagrams (BDDs) to guarantee that the approximate adder with correct carry bits exactly matches its functional specification. Our idea takes advantage of the BDD structure in extracting the internal signals, particularly the carry signal from the golden reference exact adder. Afterward, a corrector circuit is generated from the functional specification and the extracted carry signal is used as input in the corrector circuit. The corrector circuit is used to generate the corrected adder from the approximate adder. The generated corrected adder can be compared against a formally verified golden reference exact adder. We show the efficacy of CAV over approximate Ripple Carry Adders (RCA) as well as approximate Parallel Prefix Adders (PPA). Lastly, we perform a qualitative analysis by introducing mutations in the designs to show the fault detection quality of the CAV methodology.


  • EnR: extend and reduce methodology to enable formal verification of truncated adders

    by Chandan Kumar Jha, Khushboo Qayyum, Muhammad Hassan, Rolf Drechsler

    Truncated adders are widely used in applications where using lower bit-width is enough to generate the desired outputs. Truncated adders give benefits in area, power, and delay as compared to their non-truncated counterparts. While prior works deal with the formal verification of n-bit adders, there is no prior work dealing with the formal verification of unverified m-bit truncated adders using verified n-bit adder designs, where m < ${< } $ n. In this work, we propose a methodology that enables the verification for any truncated adder designs, irrespective of the architecture, called Extend and Reduce (EnR). EnR uses a three-step methodology to formally verify the truncated adders, which are considered as Design Under Verification (DUV). Firstly, it extends the bit-width of the DUV (truncated adder) to match with the nearest higher 2 n -bit adder, called an Extended Truncated Adder (ETA). Secondly, it reduces off-the-shelf formally verified golden reference adder design by forcing 0’s at the input bits to match it to the extended DUV design and re-synthesizing it to generate a Reduced Golden Adder (RGA). Lastly, a combinational equivalence check is then performed between the ETA and the RGA for formal verification. If the truncated adder is correct, the ETA and RGA are equivalent and vice versa. We evaluate a number and variety of adder designs to show the efficacy of the EnR methodology. We performed the formal verification using Binary Decision Diagrams (BDDs) and And-Inverter Graphs (AIGs). Lastly, we show the scalability of EnR methodology using adders up to a bit-width of 512 bits. ACM CCS: Hardware → Arithmetic and datapath circuits; Combinational circuits; Equivalence checking; Functional verification; Electronic design automation.