Alias Coverage Criterion

Concept

A coverage criterion proposed in the context of code-based test generation for functional processor descriptions, used to estimate the coverage of different choices of index relationships when handling array constraints, particularly for verifying self-referencing memory accesses such as mem[mem[i]] where mem[i]=i.

First seen 6/3/2026

Last seen 6/3/2026

Evidence 1 chunks

Wiki v1

WIKI

Alias Coverage Criterion

Definition

The alias coverage criterion is a coverage metric introduced in the paper Code-based Test Generation for Validation of Functional Processor Descriptions to estimate how well a generated test suite exercises the different possible relationships between array indices. It is part of the broader approach to array constraint handling in constraint-based test generation.

READ FULL ARTICLE →

NEIGHBORHOOD

No graph connections found for this entity yet. It may appear in future ingestion runs.

explore full graph →

RELATIONSHIPS

2 connections

Code-based Test Generation for Validation of Functional Processor Descriptions ← mentions 100% 1e

The paper introduces and mentions the alias coverage criterion for array index relationships.

array constraint handling part of → 85% 1e

The alias coverage criterion is defined in the context of array constraint handling.

LINKED ENTITIES

2 links

Code-based Test Generation for Validation of Functional Processor Descriptions MENTIONS Extracted graph relationship

array constraint handling PART_OF Extracted graph relationship

CITATIONS

5 sources

5 citations — click to expand

[1] An alias coverage criterion could be defined to estimate the coverage of the different choices of indices relationship. Code-based Test Generation for Validation of Functional Processor Descriptions

[2] This new coverage criterion makes sense to verify self reference to memory such as mem[mem[i]] where mem[i]=i. Code-based Test Generation for Validation of Functional Processor Descriptions

[3] The number of partitions of an n-set, which is the nth Bell number bn, gives the count of distinct index-relationship choices; although Bell numbers grow exponentially, only a correct combination of indices is searched for. Code-based Test Generation for Validation of Functional Processor Descriptions

[4] The advantages of the approach include variable independence analysis to split the constraint store into independent groups and graph analysis to deduce heuristics for variable ordering. Code-based Test Generation for Validation of Functional Processor Descriptions

[5] The main drawback is that the choice of relationships between indices can be inconsistent with other constraints in the store; the approach relies on the backtracking mechanism of the constraint solver and a symbolic solver to avoid or recover from such failures. Code-based Test Generation for Validation of Functional Processor Descriptions