错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

PROTON: PRObes for Termination Or Not (Competition Contribution)

  • Ravindra Metta,
  • Hrishikesh Karmarkar,
  • Kumar Madhukar,
  • R. Venkatesh,
  • Supratik Chakraborty

摘要

PROTON is a tool to check whether a given C program has a non-terminating behaviour or not. It is built around the C Bounded Model Checker (CBMC). CBMC cannot prove non-termination directly, as all non-terminating runs are unbounded. PROTON annotates the loops in a given program with assertions that check for a recurrent program state. Violation of such an assertion shows the existence of a recurrent state and thereby proves non-termination. PROTON also transforms the violating trace returned by CBMC into a non-termination witness for the program.