Deciding Conditional Termination
We address the problem of conditional termination, which is that of defining the set of initial configurations from which a given program always terminates. First we define the dual set, of initial configurations from which a non-terminating execution exists, as the greatest fixpoint of the function...
保存先:
| 主要な著者: | , , |
|---|---|
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
Logical Methods in Computer Science e.V.
2014-08-01
|
| シリーズ: | Logical Methods in Computer Science |
| 主題: | |
| オンライン･アクセス: | https://lmcs.episciences.org/737/pdf |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|