|
Volumn 25, Issue 10, 1994, Pages 1-14
|
Detection of unfeasible paths with a path‐dependence flow graph
a a
a
NTT CORPORATION
(Japan)
|
Author keywords
abstract interpretation; Computation path; data flow computation model; program analysis; symbolic execution
|
Indexed keywords
CODES (SYMBOLS);
COMPUTABILITY AND DECIDABILITY;
COMPUTATION THEORY;
COMPUTATIONAL COMPLEXITY;
GRAPH THEORY;
LOGIC PROGRAMMING;
PROGRAM DIAGNOSTICS;
SUBROUTINES;
COMPUTATION PATHS;
DIRECTED GRAPH;
PATH DEPENDENCE FLOW GRAPH;
PRESBURGER SENTENCES;
TEST DATA GENERATION;
UNFEASIBLE PATHS;
CRITICAL PATH ANALYSIS;
|
EID: 0028515484
PISSN: 08821666
EISSN: 1520684X
Source Type: Journal
DOI: 10.1002/scj.4690251001 Document Type: Article |
Times cited : (1)
|
References (19)
|