69 citations · 153 across the 16 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.PL2014★ 3 cited
Flowchart Programs, Regular Expressions, and Decidability of Polynomial Growth-Rate
Amir M. Ben-Amram, Aviad Pineles
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…
cs.LO2014★ 3 cited
The Hardness of Finding Linear Ranking Functions for Lasso Programs
Amir M. Ben-Amram
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 bo…