Showing cs.SEShow all
2 papers · 1 filter
cs.SE2024
A shallow dive into the depths of non-termination checking for C programs
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…
cs.SE2018
Scalable and Precise Estimation and Debugging of the Worst-Case Execution Time for Analysis-Friendly Processors
Martin Becker, Ravindra Metta, R Venkatesh +1
Estimating the Worst-Case Execution Time (WCET) of an application is an essential task in the context of developing real-time or safety-critical software, but it is also a complex…