A Framework for Guided Test Case Generation in Constraint Logic Programming
PaperFirst seen 7/7/2026
Last seen 7/7/2026
Evidence 13 chunks
NEIGHBORHOOD
No graph connections found for this entity yet. It may appear in future ingestion runs.
explore full graph →RELATIONSHIPS
15 connectionsThe paper reports empirical evaluation of guided TCG against standard TCG.
The paper introduces a trace-abstraction refinement strategy to further optimize the guided TCG framework.
The paper proposes using symbolic execution as the basis for test case generation.
The paper proposes a CLP-based framework for guided TCG.
The paper addresses the path explosion problem as a key motivation.
The paper uses trace abstraction as the mechanism to build trace generators for guided TCG.
The paper introduces and instantiates the program-points coverage criterion.
The paper defines and uses coverage criteria to guide test case generation.
The paper introduces and instantiates the all-local-paths coverage criterion.
The paper proposes and introduces a framework for Guided Test Case Generation.
The paper introduces the notion of trace-guided TCG.
The paper uses the net.datastructures library as benchmark for evaluation.
The paper lists José Miguel Rojas as first author.
The paper mentions predicate abstraction in the context of related work.
The paper lists Miguel Gómez-Zamalloa as second author.