Ranking Functions for Size-Change Termination II
Size-Change Termination is an increasingly-popular technique for verifying program termination. These termination proofs are deduced from an abstract representation of the program in the form of "size-change graphs". We present algorithms that, for certain classes of size-change graphs, deduce a g...
Na minha lista:
| Principais autores: | , |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
Logical Methods in Computer Science e.V.
2009-05-01
|
| Serier: | Logical Methods in Computer Science |
| Fag: | |
| Online adgang: | https://lmcs.episciences.org/1000/pdf |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|