Microsoft PowerPoint - esci.pub.ppt [互換モード]• • – • ⇒ • • • • • • – – – – – – – • – • • • – • – • ⇒ • ⇒ “Turing proved that, in general, proving program termination is ‘undecidable,’ ” Cook says. “However, this result does not preclude the existence of future program‐termination proof tools that work 99.9 percent of the time on programs written by humans. This is the sort of tool that we’re aiming to make.” • – • • – • – • • • • – • • – ⇒ •
