the underlying satisfiability checkers cannot handle a choice point, then a concrete input can be generated to pass that point; this combination of concrete and symbolic execution is also referred to as concolic execution. See also Dynamic program analysis Profiling (computer programming) Runtime error detection Runtime application self-protection (RASP) References Formal methods Logic in computer science