# US 2003/0070030 A1 · Automatic corner case search in multi-agent bus interface verification

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

- Number: US 2003/0070030 A1
- Document ID: US20030070030A1
- Status: Published application
- Kind: A1
- Application number: 09/971,214
- Filed: 2001-10-04
- Published: 2003-04-10
- Earliest claimed: 2001-10-04
- Assignees: Sun Microsystems, Inc.
- Inventors: Brian E. Smith; Victor Melamed
- Web page: https://patentgrep.com/patent/US20030070030A1

## CPC

- G06F 11/263: Generation of test inputs, e.g. test vectors, patterns or sequences {; with adaptation of the tested hardware for testability with external testers}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method for automatically creating a comer case situation on a bus is provided. The method uses a multi-agent bus interface verification tool to create the comer case situation. Further, a method for verifying a bus interface by creating a comer case situation is provided. Further, a computer system having a multi-agent bus interface verification tool is provided. Further, a multi-agent bus interface verification software tool is provided. Further, a multi-agent bus interface verification tool that can test a bus bridge is provided. Further, a multi-agent bus interface verification tool that generates erroneous response transactions to test circuit performance is provided.

## Claims

### Claim 1

A method for automatically creating a corner case situation on a bus, comprising:
inputting a set of configuration parameters;
selecting a transaction from a bus transaction history; and
automatically creating the comer case situation by generating a response transaction to an address corresponding to the transaction selected from the bus transaction history, wherein generating the response transaction is dependent on information in the set of configuration parameters.

### Claim 2 (depends on 1)

The method of claim 1, wherein the bus transaction history comprises at least one completed transaction on the bus.

### Claim 3 (depends on 1)

The method of claim 1, wherein the response transaction is an erroneous response transaction.

### Claim 4 (depends on 1)

The method of claim 1, further comprising:
creating a memory map based on information in the set of configuration parameters, wherein the memory map represents at least one range of addresses in memory to which the response transaction is generated.

### Claim 5 (depends on 4)

The method of claim 4, wherein automatically creating the comer case situation comprises:
determining whether the transaction is eligible based on the memory map;
determining whether the transaction is associated with an address associated with instruction space if the transaction is eligible; and
generating the response transaction to the instruction space depending on the determination.

### Claim 6 (depends on 5)

The method of claim 5, further comprising:
establishing a target, wherein an address associated with the target corresponds to an address of the transaction;
determining whether the memory map represents at least one range of addresses in memory specified by information in the set of configuration parameters; and
selectively generating the response transaction to an address that is offset from the address associated with the target, wherein selectively generating the response transaction is dependent on the determination.

### Claim 7 (depends on 4)

The method of claim 4, wherein automatically creating the corner case situation comprises:
determining whether the transaction is eligible based on the memory map;
determining whether the transaction is associated with an address associated with data space if the transaction is eligible; and
generating the response transaction to the data space depending on the determination.

### Claim 8 (depends on 7)

The method of claim 7, further comprising:
establishing a target, wherein an address associated with the target corresponds to an address of the transaction;
determining whether the memory map represents at least one range of addresses in memory specified by information in the set of configuration parameters; and
executing at least one response transaction selected from the group consisting of a read response transaction, an own-delay response transaction, an own-no-delay response transaction, and a read block response transaction, wherein executing the at least one response transaction is dependent on the determination;
wherein an address associated with the at least one response transaction corresponds to the address associated with the target.

### Claim 9

A method for verifying a bus interface, comprising:
monitoring for at least one transaction on a bus;
selecting the at least one transaction;
creating a corner case situation by generating at least one response transaction on the bus, wherein an address associated with the at least one transaction corresponds with an address of the at least one response transaction; and
verifying that the bus interface properly handles the at least one response transaction by comparing an actual result with an expected result.

### Claim 10 (depends on 9)

The method of claim 9, wherein creating the comer situation comprises:
determining whether the address associated with the at least one transaction is within a range of addresses in a memory map;
determining whether the address associated with the at least one transaction is in an instruction space if the address associated with the at least one transaction is within the range of addresses in the memory map; and
creating the comer case situation by generating the at least one response transaction such that the address associated with the at least one response transaction is selectively offset from the address associated with the at least one transaction.

### Claim 11 (depends on 9)

The method of claim 9, wherein creating the comer case situation comprises:
determining whether the address associated with the at least one transaction is within a range of addresses in a memory map;
determining whether the address associated with the at least one transaction is in a data space if the address associated with the at least one transaction is within the range of addresses in the memory map; and
creating the comer case situation by generating the at least one response transaction; and
generating another response transaction;
wherein the address associated with the at least one response transaction corresponds to the address associated with the at least one transaction, and wherein an address associated with the another response transaction is selectively offset from the address associated with the at least one transaction.

### Claim 12 (depends on 11)

The method of claim 11, wherein the at least one response transaction is selected from the group consisting of a read response transaction, an own-delay response transaction, an own-no-delay response transaction, and a read block transaction.

### Claim 13 (depends on 11)

The method of claim 11, wherein the another response transaction is not identical to the at least one response transaction.

### Claim 14

A computer system having a multi-agent bus interface verification tool that automatically creates a comer case situation, comprising:
an integrated circuit;
a memory; and
a bus having at least one agent;
wherein the multi-agent bus interface verification tool resides in the memory and executes instructions on the integrated circuit in order to automatically create the comer case situation on the bus.

### Claim 15 (depends on 14)

The computer system of claim 14, further comprising a bus interface, wherein the comer case situation tests the bus interface, and wherein the comer case situation is created when the multi-agent bus interface verification tool generates at least one response transaction on the bus.

### Claim 16 (depends on 15)

The computer system of claim 15, wherein the multi-agent bus interface verification tool generates the at least one response transaction on the bus via the at least one agent.

### Claim 17

A software tool, comprising:
a first portion that monitors for at least one transaction on a bus;
a second portion that selects the at least one transaction;
a third portion that generates at least one response transaction on the bus in response to the second portion selecting the at least one transaction; and
a last portion that verifies an operation of a bus interface by comparing an actual result with an expected result in response the at least one response transaction.

### Claim 18 (depends on 17)

The software tool of claim 17, wherein an address associated with the at least one transaction corresponds with an address of the at least one response transaction.

### Claim 19

A method for testing a bus bridge, the bus bridge connecting a first bus and at least one other bus, comprising:
inputting a set of configuration parameters;
selecting a transaction from a bus transaction history; and
automatically creating a comer case situation by generating a response transaction to an address corresponding to the transaction selected from the bus transaction history, wherein generating the response transaction is dependent on information in the set of configuration parameters.

### Claim 20 (depends on 19)

The method of claim 19, wherein the bus transaction history comprises at least one selected from the group consisting of a completed transaction on the first bus and a completed transaction on the at least one other bus.

### Claim 21 (depends on 19)

The method of claim 19, further comprising:
creating a memory map based on information in the set of configuration parameters, wherein the memory map represents at least one range of addresses in memory to which the response transaction is generated.

### Claim 22 (depends on 21)

The method of claim 21, wherein automatically creating the comer case situation comprises:
determining whether the transaction is eligible based on the memory map;
determining whether the transaction is associated with an address associated with instruction space if the transaction is eligible; and
generating the response transaction to the instruction space depending on the determination.

### Claim 23 (depends on 22)

The method of claim 22, further comprising:
establishing a target, wherein an address associated with the target corresponds to an address of the transaction;
determining whether the memory map represents at least one range of addresses in memory specified by information in the set of configuration parameters; and
selectively generating the response transaction to an address that is offset from the address associated with the target, wherein selectively generating the response transaction is dependent on the determination.

### Claim 24 (depends on 21)

The method of claim 21, wherein automatically creating the comer case situation comprises:
determining whether the transaction is eligible based on the memory map;
determining whether the transaction is associated with an address associated with data space if the transaction is eligible; and
generating the response transaction to the data space depending on the determination.

### Claim 25 (depends on 24)

The method of claim 24, further comprising:
establishing a target, wherein an address associated with the target corresponds to an address of the transaction;
determining whether the memory map represents at least one range of addresses in memory specified by information in the set of configuration parameters; and
executing at least one response transaction selected from the group consisting of a read response transaction, an own-delay response transaction, an own-no-delay response transaction, and a read block response transaction, wherein executing the at least one response transaction is dependent on the determination;
wherein an address associated with the at least one response transaction corresponds to the address associated with the target.

### Claim 26

A method for verifying a bus bridge, comprising:
monitoring for at least one transaction on one selected from the group consisting of a first bus and at least one other bus;
selecting the at least one transaction;
creating a comer case situation by generating at least one response transaction, wherein an address associated with the at least one transaction corresponds with an address of the at least one response transaction; and
verifying that the bus interface properly handles the at least one response transaction by comparing an actual result with an expected result,
wherein the bus bridge interfaces the first bus and the at least one other bus.

### Claim 27 (depends on 26)

The method of claim 26, wherein creating the comer situation comprises:
determining whether the address associated with the at least one transaction is within a range of addresses in a memory map;
determining whether the address associated with the at least one transaction is in an instruction space if the address associated with the at least one transaction is within the range of addresses in the memory map; and
creating the corner case situation by generating the at least one response transaction such that the address associated with the at least one response transaction is selectively offset from the address associated with the at least one transaction.

### Claim 28 (depends on 26)

The method of claim 26, wherein creating the comer case situation comprises:
determining whether the address associated with the at least one transaction is within a range of addresses in a memory map;
determining whether the address associated with the at least one transaction is in a data space if the address associated with the at least one transaction is within the range of addresses in the memory map; and
creating the comer case situation by generating the at least one response transaction; and
generating another response transaction;
wherein the address associated with the at least one response transaction corresponds to the address associated with the at least one transaction, and wherein an address associated with the another response transaction is selectively offset from the address associated with the at least one transaction.

### Claim 29 (depends on 27)

The method of claim 27, wherein the at least one response transaction is selected from the group consisting of a read response transaction, an own-delay response transaction, an own-no-delay response transaction, and a read block transaction.
