1 paper
Ravindra Metta, Hrishikesh Karmarkar, Kumar Madhukar +3
Checking for Non-Termination (NT) of a given program P, i.e., determining if P has at least one non-terminating run, is an undecidable problem that continues to garner significant…