#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2011

2015

- This year (0)
- Last 5 years (5)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Amir M. Ben-Amram, Samir Genaim, Abu Naser Masud
- ACM Trans. Program. Lang. Syst.
- 2012

In this article we study the decidability of termination of several variants of simple integer loops, without branching in the loop body and with affine constraints as the loop guard (and possibly a precondition). We show that termination of such loops is undecidable in some cases, in particular, when the body of the loop is expressed by a set of linear… (More)

- Elvira Albert, Samir Genaim, Abu Naser Masud
- VMCAI
- 2011

Cost analysis aims at determining the amount of resources required to run a program in terms of its input data sizes. Automatically inferring precise bounds, while at the same time being able to handle a wide class of programs, is a main challenge in cost analysis. (1) Existing methods which rely on computer algebra systems (CAS) to solve the obtained cost… (More)

- Elvira Albert, Samir Genaim, Abu Naser Masud
- ACM Trans. Comput. Log.
- 2013

<i>Cost analysis</i> aims at determining the amount of resources required to run a program in terms of its input data sizes. The most challenging step is to infer the cost of executing the <i>loops</i> in the program. This requires bounding the number of iterations of each loop and finding tight bounds for the cost of each of its iterations. This article… (More)

- Elvira Albert, Diego Esteban Alonso-Blas, +9 authors Damiano Zanardini
- FMCO
- 2012

In this tutorial paper, we overview the techniques that underlie the automatic inference of bounds on resource consumption. We first explain the basic techniques on a Java-like sequential language. Then, we describe the extensions that are required to apply our method on concurrent ABS programs. Finally, we discuss some advanced issues in resource analysis,… (More)

- Björn Lisper, Abu Naser Masud, Husni Khanfar
- PEPM
- 2015

Program slicing identifies the program parts that may affect certain properties of the program, such as the outcomes of conditions affecting the program flow. Ottenstein's Program Dependence Graph (PDG) based algorithm is the state-of-practice for static slicing today: it is well-suited in applications where many slices are computed, since the cost of… (More)

- Husni Khanfar, Björn Lisper, Abu Naser Masud
- Ada-Europe
- 2015

- ‹
- 1
- ›