Proving Program Termination

被引:82
作者
Cook, Byron [1 ,2 ]
Podelski, Andreas [3 ]
Rybalchenko, Andrey [4 ]
机构
[1] Univ Cambridge, Microsofts Res Lab, Cambridge CB2 1TN, England
[2] Univ London, London WC1E 7HU, England
[3] Univ Freiburg, D-7800 Freiburg, Germany
[4] Tech Univ Munich, D-8000 Munich, Germany
关键词
D O I
10.1145/1941487.1941509
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In contrast to popular belief, proving termination is not always impossible. © 2011 ACM.
引用
收藏
页码:88 / 98
页数:11
相关论文
共 40 条
  • [1] [Anonymous], 1936, COMPUTABLE NUMBERS A
  • [2] BABIC D, 2007, SEFM
  • [3] BALL T, 2006, P EUROSYS
  • [4] BERDINE J, 2007, P POPL
  • [5] BERDINE J, 2006, P CAV
  • [6] BOUAJJANI A, 2006, P CAV
  • [7] BRADLEY A, 2005, P VMCAI
  • [8] BRADLEY A, 2005, P ICALP
  • [9] BRADLEY A, 2005, P CAV
  • [10] CHAWDHARY C, 2008, P ESOP