Zobrazeno 1 - 10
of 60
pro vyhledávání: '"Amir M. Ben-Amram"'
Autor:
Amir M. Ben-Amram, Geoff Hamilton
Publikováno v:
Logical Methods in Computer Science, Vol Volume 16, Issue 2 (2020)
In 2008, Ben-Amram, Jones and Kristiansen showed that for a simple programming language - representing non-deterministic imperative programs with bounded loops, and arithmetics limited to addition and multiplication - it is possible to decide precise
Externí odkaz:
https://doaj.org/article/f2fc420ea86f4899bc382356a8b558ec
Autor:
Amir M. Ben-Amram, Aviad Pineles
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 216, Iss Proc. VPT 2016, Pp 24-49 (2016)
We present a new method for inferring complexity properties for a class of programs in the form of flowcharts annotated with loop information. Specifically, our method can (soundly and completely) decide if computed values are polynomially bounded as
Externí odkaz:
https://doaj.org/article/ef0f00490652425d9f7df3d862b5f9a0
Autor:
Amir M. Ben-Amram
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 161, Iss Proc. GandALF 2014, Pp 32-45 (2014)
Finding whether a linear-constraint loop has a linear ranking function is an important key to understanding the loop behavior, proving its termination and establishing iteration bounds. If no preconditions are provided, the decision problem is known
Externí odkaz:
https://doaj.org/article/4318253262dc44959e50459e024b71e9
Autor:
Amir M. Ben-Amram
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 23, Iss Proc. DICE 2010, Pp 1-14 (2010)
In 2008, Ben-Amram, Jones and Kristiansen showed that for a simple "core" programming language - an imperative language with bounded loops, and arithmetics limited to addition and multiplication - it was possible to decide precisely whether a program
Externí odkaz:
https://doaj.org/article/7d8d372ac22045bd9122b15dacba9a0e
Autor:
Amir M. Ben-Amram
Publikováno v:
Logical Methods in Computer Science, Vol Volume 7, Issue 3 (2011)
Size-Change Termination (SCT) is a method of proving program termination based on the impossibility of infinite descent. To this end we use a program abstraction in which transitions are described by Monotonicity Constraints over (abstract) variables
Externí odkaz:
https://doaj.org/article/92eb0cf0ad6244389939ad478c1bbf2f
Autor:
Amir M. Ben-Amram
Publikováno v:
Logical Methods in Computer Science, Vol Volume 6, Issue 3 (2010)
Size-Change Termination (SCT) is a method of proving program termination based on the impossibility of infinite descent. To this end we may use a program abstraction in which transitions are described by monotonicity constraints over (abstract) varia
Externí odkaz:
https://doaj.org/article/b821c40189da4364b3ff46f476b791d8
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:
Geoff W. Hamilton, Amir M. Ben-Amram
Publikováno v:
Logical Methods in Computer Science. 17
We consider the following problem: given a program, find tight asymptotic bounds on the values of some variables at the end of the computation (or at any given program point) in terms of its input values. We focus on the case of polynomially-bounded
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::590d966e7c53faac0e1496858949c2bc
https://doi.org/10.46298/lmcs-17(4:7)2021
https://doi.org/10.46298/lmcs-17(4:7)2021
Publikováno v:
Static Analysis ISBN: 9783030323035
SAS
SAS
Multiphase ranking functions (M\(\varPhi \)RFs) are used to prove termination of loops in which the computation progresses through a number of phases. They consist of linear functions \(\langle f_1,\ldots ,f_d \rangle \) where \(f_i\) decreases durin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::25c2f2cbe51619200b818a5e3acca1dc
https://doi.org/10.1007/978-3-030-32304-2_22
https://doi.org/10.1007/978-3-030-32304-2_22
Autor:
Amir M. Ben-Amram, Geoff W. Hamilton
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030171261
FoSSaCS
FoSSaCS
In 2008, Ben-Amram, Jones and Kristiansen showed that for a simple programming language—representing non-deterministic imperative programs with bounded loops, and arithmetics limited to addition and multiplication—it is possible to decide precise
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::25338307a4e41adf9d732d623f2a7a6f
https://doi.org/10.1007/978-3-030-17127-8_5
https://doi.org/10.1007/978-3-030-17127-8_5