Amir Ben-Amram
Amir Ben-Amram
Unknown affiliation
Verified email at - Homepage
Cited by
Cited by
The size-change principle for program termination
CS Lee, ND Jones, AM Ben-Amram
Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of …, 2001
What is a “pointer machine”?
AM Ben-Amram
ACM SIGACT News 26 (2), 88-95, 1995
On pointers versus addresses
AM Ben-Amram, Z Galil
Journal of the ACM (JACM) 39 (3), 617-648, 1992
On the linear ranking problem for integer linear-constraint loops
AM Ben-Amram, S Genaim
ACM SIGPLAN Notices 48 (1), 51-62, 2013
Ranking functions for linear-constraint loops
AM Ben-Amram, S Genaim
Journal of the ACM (JACM) 61 (4), 1-55, 2014
On the termination of integer loops
AM Ben-Amram, S Genaim, AN Masud
ACM Transactions on Programming Languages and Systems (TOPLAS) 34 (4), 1-24, 2012
Program termination analysis in polynomial time
AM Ben-Amram, CS Lee
ACM Transactions on Programming Languages and Systems (TOPLAS) 29 (1), 1-37, 2007
Size-change termination, monotonicity constraints and ranking functions
AM Ben-Amram
International Conference on Computer Aided Verification, 109-123, 2009
Linear, polynomial or exponential? Complexity inference in polynomial time
AM Ben-Amram, ND Jones, L Kristiansen
Conference on Computability in Europe, 67-76, 2008
A SAT-based approach to size change termination with global ranking functions
AM Ben-Amram, M Codish
International Conference on Tools and Algorithms for the Construction and …, 2008
Size-change termination with difference constraints
AM Ben-Amram
ACM Transactions on Programming Languages and Systems (TOPLAS) 30 (3), 1-31, 2008
Monotonicity constraints for termination in the integer domain
AM Ben-Amram
Logical Methods in Computer Science 7 (3), 2011
Worst-case and amortised optimality in union-find
S Alstrup, AM Ben-Amram, T Rauhe
Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999
On multiphase-linear ranking functions
AM Ben-Amram, S Genaim
International Conference on Computer Aided Verification, 601-620, 2017
What can we sort in o (nlog n) time?
AM Ben-Amram, Z Galil
Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium …, 1993
The subtree max gap problem with application to parallel string covering
AM Ben-Amram, O Berkman, CS Iliopoulos, K Park
Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms …, 1994
General size-change termination and lexicographic descent
AM Ben-Amram
The essence of computation, 3-17, 2002
A generalization of a lower bound technique due to Fredman and Saks
AM Ben-Amram, Z Galil
Algorithmica 30 (1), 34-66, 2001
Mortality of iterated piecewise affine functions over the integers: Decidability and complexity
AM Ben-Amram
Computability 4 (1), 19-56, 2015
SAT-based termination analysis using monotonicity constraints over the integers
M Codish, I Gonopolskiy, AM Ben-Amram, C Fuhs, J Giesl
Theory and Practice of Logic Programming, 26th Int’l. Conference on Logic …, 2011
The system can't perform the operation now. Try again later.
Articles 1–20