2 papers
cs.SE2026
Efficient Prime Paths Generation
Jakub Zelek, Jakub Ruszil, Adam Roman +1
Prime path coverage is a powerful structural testing criterion, but generating all prime paths in a directed graph remains computationally challenging due to the potentially expone…
cs.CC2026
Computational Complexity of Edge Coverage Problem for Constrained Control Flow Graphs
Jakub Ruszil, Artur PolaÅski, Adam Roman +1
The article studies edge coverage for control flow graphs extended with explicit constraints. Achieving a given level of white-box coverage for a given code is a classic problem in…