# US 2025/0181809 A1 · Optimizing the error checking logic in a processor

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2025/0181809 A1
- Document ID: US20250181809A1
- Status: Published application
- Kind: A1
- Application number: 18/528,878
- Filed: 2023-12-05
- Published: 2025-06-05
- Earliest claimed: 2023-12-05
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Karthik V. Swaminathan; Douglas Balazich; Ramon Bertran Monfort; Arvind Haran; Alper Buyuktosunoglu; Hans Mikael Jacobson; Matthias Pflanz; Pradip Bose
- Web page: https://patentgrep.com/patent/US20250181809A1

## CPC

- G06F 30/3315: using static timing analysis [STA]
- G06F 30/327: Logic synthesis; Behaviour synthesis, e.g. mapping logic, HDL to netlist, high-level language to RTL or netlist
- G06F 30/3312: Timing analysis
- G06F 30/3323: using formal methods, e.g. equivalence checking or property checking
- G06F 2115/10: Processors
- G06F 2117/02: Fault tolerance, e.g. for transient fault suppression
- G06F 2119/12: Timing analysis or timing optimisation
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

An approach for optimizing error-checking logic in a processor design is disclosed. The approach includes performing a static analysis on the processor design, wherein the processor design includes one or more latches and one or more checkers and generating a bipartite graph mapping between the one or more latches and the one or more checkers. The approach also determines checker set cover based on the mapping and preselecting timing critical checkers. The approach also determines redundant checkers based on checker activity and eliminate redundant checkers. Finally, the approach determines whether convergence criteria has been met.

## Claims

### Claim 1

A method for optimizing error-checking logic in a processor design, method comprising:
performing static analysis on the processor design, wherein the processor design includes one or more latches and one or more checkers;
generating mapping between the one or more latches and the one or more checkers;
determining checker set cover based on the mapping;
preselecting timing critical checkers from the one or more checkers;
determining redundant checkers based on checker activity;
eliminating redundant checkers; and
determining whether convergence criteria has been met.

### Claim 2 (depends on 1)

The method of claim 1, wherein performing the static analysis further comprises:
identify and organize the processor design into sets of timing paths, wherein the timing paths are associated with the one or more checkers and the one or more latches;
calculate delay of each of the sets of timing paths;
validating all path delays of the sets of timing paths conform to timing constraints; and
identify and list the one or more checkers and the one or more latches based on all of the path delays of the sets of timing paths that has conformed.

### Claim 3 (depends on 1)

The method of claim 1, wherein generating mapping further comprises:
generating a bipartite graph mapping between the one or more checkers and the one or more latches;
generating one or more checking levels between the one or more checkers and the one or more latches, wherein the one or more checking level is an individual checking operation between a checker and a latch; and
assigning one or more weights to one or more edges of the one or more checking levels, wherein the one or more weights depends on, i) number of latch stages between a covered latch and the checker or ii) timing margin determined by static timing analysis.

### Claim 4 (depends on 3)

The method of claim 3, wherein determining the checker set cover further comprises:
assigning a priority level to the one or more weights, wherein the priority level includes low, medium and high priority; and
optimizing the bipartite graph mapping based on one or more vertices of the one or more latches and of the one or more checkers and the one or more weight edges.

### Claim 5 (depends on 1)

The method of claim 1, wherein determining the redundant checkers based on checker activity further comprises:
determining whether non-timing critical checkers are active based on an activity threshold parameters, α and ω, wherein a denotes an occurrence when latch switches for more than α % of the total execution period and ω denotes an occurrence when an active latch has non-zero switching activity for more than ω % of the total number of evaluated workloads; and
outputting a list of the redundant checkers based on non-active checkers.

### Claim 6 (depends on 1)

The method of claim 1, wherein eliminating checkers further comprises:
removing the redundant checkers from the set cover.

### Claim 7 (depends on 1)

The method of claim 1, wherein determining whether convergence criteria have been met further comprises:
iteratively repeating a step of, i) determining the checker set cover, ii) preselecting timing critical checkers from the one or more checkers, iii) determining redundant checkers based on checker activity and iv) eliminating redundant checkers until the set cover meets the converge criteria.

### Claim 8

A computer program product for optimizing error-checking logic in a processor design, the computer program product comprising:
one or more computer-readable storage media having computer-readable program instructions stored on the one or more computer-readable storage media said program instructions executes a computer-implemented method comprising the steps of:
performing static analysis on the processor design, wherein the processor design includes one or more latches and one or more checkers;
generating mapping between the one or more latches and the one or more checkers;
determining checker set cover based on the mapping;
preselecting timing critical checkers from the one or more checkers;
determining redundant checkers based on checker activity;
eliminating redundant checkers; and
determining whether convergence criteria has been met.

### Claim 9 (depends on 8)

The computer program product of claim 8, wherein performing the static analysis further comprises:
identify and organize the processor design into sets of timing paths, wherein the timing paths are associated with the one or more checkers and the one or more latches;
calculate delay of each of the sets of timing paths;
validating all path delays of the sets of timing paths conform to timing constraints; and
identify and list the one or more checkers and the one or more latches based on all of the path delays of the sets of timing paths that has conformed.

### Claim 10 (depends on 8)

The computer program product of claim 8, wherein generating mapping further comprises:
generating a bipartite graph mapping between the one or more checkers and the one or more latches;
generating one or more checking levels between the one or more checkers and the one or more latches, wherein the one or more checking level is an individual checking operation between a checker and a latch; and
assigning one or more weights to one or more edges of the one or more checking levels, wherein the one or more weights depends on, i) number of latch stages between a covered latch and the checker or ii) timing margin determined by static timing analysis.

### Claim 11 (depends on 10)

The computer program product of claim 10, wherein determining the checker set cover further comprises:
assigning a priority level to the one or more weights, wherein the priority level includes low, medium and high priority; and
optimizing the bipartite graph mapping based on one or more vertices of the one or more latches and of the one or more checkers and the one or more weight edges.

### Claim 12 (depends on 8)

The computer program product of claim 8, wherein determining the redundant checkers based on checker activity further comprises:
determining whether non-timing critical checkers are active based on an activity threshold parameters, α and ω, wherein a denotes an occurrence when latch switches for more than α % of the total execution period and ω denotes an occurrence when an active latch has non-zero switching activity for more than ω % of the total number of evaluated workloads; and
outputting a list of the redundant checkers based on non-active checkers.

### Claim 13 (depends on 8)

The computer program product of claim 8, wherein eliminating checkers further comprises:
removing the redundant checkers from the set cover.

### Claim 14 (depends on 8)

The computer program product of claim 8, wherein determining whether convergence criteria have been met further comprises:
iteratively repeating a step of, i) determining the checker set cover, ii) preselecting timing critical checkers from the one or more checkers, iii) determining redundant checkers based on checker activity and iv) eliminating redundant checkers until the set cover meets the converge criteria.

### Claim 15

A system for optimizing error-checking logic in a processor design, the system comprising:
one or more computer processors; and
one or more computer readable storage media having computer-readable program instructions stored on the one or more computer readable storage media, said program instructions executes, by the one or more computer processors, a computer-implemented method comprising the steps of:
performing static analysis on the processor design, wherein the processor design includes one or more latches and one or more checkers;
generating mapping between the one or more latches and the one or more checkers;
determining checker set cover based on the mapping;
preselecting timing critical checkers from the one or more checkers;
determining redundant checkers based on checker activity;
eliminating redundant checkers; and
determining whether convergence criteria has been met.

### Claim 16 (depends on 15)

The system of claim 15, wherein performing the static analysis further comprises:
identify and organize the processor design into sets of timing paths, wherein the timing paths are associated with the one or more checkers and the one or more latches;
calculate delay of each of the sets of timing paths;
validating all path delays of the sets of timing paths conform to timing constraints; and
identify and list the one or more checkers and the one or more latches based on all of the path delays of the sets of timing paths that has conformed.

### Claim 17 (depends on 15)

The system of claim 15, wherein generating mapping further comprises:
generating a bipartite graph mapping between the one or more checkers and the one or more latches;
generating one or more checking levels between the one or more checkers and the one or more latches, wherein the one or more checking level is an individual checking operation between a checker and a latch; and
assigning one or more weights to one or more edges of the one or more checking levels, wherein the one or more weights depends on, i) number of latch stages between a covered latch and the checker or ii) timing margin determined by static timing analysis.

### Claim 18 (depends on 17)

The system of claim 17, wherein determining the checker set cover further comprises:
assigning a priority level to the one or more weights, wherein the priority level includes low, medium and high priority; and
optimizing the bipartite graph mapping based on one or more vertices of the one or more latches and of the one or more checkers and the one or more weight edges.

### Claim 19 (depends on 15)

The system of claim 15, wherein determining the redundant checkers based on checker activity further comprises:
determining whether non-timing critical checkers are active based on an activity threshold parameters, α and ω, wherein a denotes an occurrence when latch switches for more than α % of the total execution period and ω denotes an occurrence when an active latch has non-zero switching activity for more than ω % of the total number of evaluated workloads; and
outputting a list of the redundant checkers based on non-active checkers.

### Claim 20 (depends on 15)

The system of claim 15, wherein determining whether convergence criteria have been met further comprises:
iteratively repeating a step of, i) determining the checker set cover, ii) preselecting timing critical checkers from the one or more checkers, iii) determining redundant checkers based on checker activity and iv) eliminating redundant checkers until the set cover meets the converge criteria.
