Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Chin Soon Lee"'
Autor:
Amir M. Ben-Amram, Chin Soon Lee
Publikováno v:
Logical Methods in Computer Science, Vol Volume 5, Issue 2 (2009)
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
Externí odkaz:
https://doaj.org/article/73d4b65d714d49ea863e369b7b836f48
Autor:
Chin Soon Lee
Publikováno v:
ACM Transactions on Programming Languages and Systems. 31:1-42
This article explains how to construct a ranking function for any program that is proved terminating by size-change analysis . The “principle of size-change termination” for a first-order functional language with well-ordered data is intuitive: A
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4b40a9810dd92f5df520756825fcf73a
https://doi.org/10.1145/1498926.1498928
https://doi.org/10.1145/1498926.1498928
Autor:
Chin Soon Lee, Amir M. Ben-Amram
Publikováno v:
ACM Transactions on Programming Languages and Systems. 29:1-37
A size-change termination algorithm takes as input abstract information about a program in the form of size-change graphs and uses it to determine whether any infinite computation would imply that some data decrease in size infinitely. Since such an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e54788e2e97588d185e3517f6a22045f
https://doi.org/10.1145/1180475.1180480
https://doi.org/10.1145/1180475.1180480
Autor:
Chin Soon Lee, Amir M. Ben-Amram
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 c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7f025b1759d477931a9f82839ab863a5
http://arxiv.org/abs/0903.4382
http://arxiv.org/abs/0903.4382
Autor:
Chin Soon Lee
Publikováno v:
Static Analysis ISBN: 9783540442356
SAS
SAS
To achieve the termination of offline partial evaluation, it is necessary to ensure that static variables assume boundedly many values during specialization. Various works have addressed the analysis of variable boundedness, also called finiteness an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7a48c414e094e3629fef79b03ed3eeb6
https://doi.org/10.1007/3-540-45789-5_34
https://doi.org/10.1007/3-540-45789-5_34
Autor:
Chin Soon Lee
Publikováno v:
Generative Programming and Component Engineering ISBN: 9783540442844
GPCE
GPCE
Recall the size-change principle for program termination: An infinite computation is impossible, if it would give rise to an infinite sequence of size-decreases for some data values. For an actual analysis, size-change graphs are used to capture the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dd00a907022a07267b5f538c4b0f5804
https://doi.org/10.1007/3-540-45821-2_14
https://doi.org/10.1007/3-540-45821-2_14
Autor:
Ben-Amram, Amir M.1, Chin Soon Lee2 cslee_sg@hotmail.com
Publikováno v:
ACM Transactions on Programming Languages & Systems. Jan2007, Vol. 29 Issue 1, p1-37. 37p. 3 Charts, 7 Graphs.