Guided Test Case Generation

Technique

First seen 7/7/2026

Last seen 7/7/2026

Evidence 12 chunks

NEIGHBORHOOD

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

15 connections

The guidedTCG Prolog implementation implements the guided TCG schemes for both coverage criteria.

The paper reports empirical evaluation of guided TCG against standard TCG.

Trace Generator uses → 100% 2e

Guided TCG relies on a trace generator to produce candidate traces.

Guided TCG uses a termination criterion to ensure finiteness of symbolic execution.

Trace Abstraction uses → 100% 2e

The guided TCG framework uses trace abstraction to build sound and complete trace generators.

Program Slicing uses → 100% 2e

Guided TCG uses program slicing to generate relevant traces for coverage criteria.

PET ← implements 100% 2e

PET integrates the guided TCG schemes presented in the paper.

The paper proposes and introduces a framework for Guided Test Case Generation.

Guided TCG uses CLP-translated programs as input for trace-guided symbolic execution.

Guided TCG is developed for structural coverage criteria.

Guided TCG uses loop-K as its termination criterion to ensure finiteness.

Test Case Generation extends → 100% 2e

Guided TCG extends standard TCG by incorporating selection criteria to guide symbolic execution.

Trace-Guided TCG ← part of 100% 1e

Trace-guided TCG is a component of the broader guided TCG framework.

Trace Term uses → 100% 1e

Guided TCG uses trace terms to direct symbolic execution.

The trace abstraction used in guided TCG essentially corresponds to the control flow graph.