Nadjib Lazaar

Nadjib Lazaar

Auto-generated profile, based on publicly available information

Nadjib Lazaar

LIRMM, University of Montpellier, CNRS, Montpellier, France

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 2017 in Artificial Intelligence
Verified
Journal Article
Closed access
CBChristian Bessiere
Christian Bessiere
FKFrédéric Koriche
Frédéric Koriche
NLNadjib Lazaar
Nadjib Lazaar
BOBarry O'SUllivan
Barry O'SUllivan

23 August 2016
Verified
Book Chapter
Closed access
PDF file
NLNadjib Lazaar
Nadjib Lazaar
YLYahia Lebbah
Yahia Lebbah
SLSamir Loudni
Samir Loudni
MMMehdi Maamar
Mehdi Maamar
VLValentin Lemière
Valentin Lemière
PBPatrice Boizumault
Patrice Boizumault

15 May 2018 in IEEE Transactions on Reliability
Verified
Journal Article
Closed access
CICarlo Ieva
Carlo Ieva
AGArnaud Gotlieb
Arnaud Gotlieb
SKSouhila Kaci
Souhila Kaci
NLNadjib Lazaar
Nadjib Lazaar
In long lifespan software systems, specification documents can be outdated or even missing. Developing new software releases or checking whether some user requirements are still valid becomes challenging in this context. This challenge can be addressed by extracting high-level observable capabilities of a system by mining its source code and the available source-level documentation. This paper presents feature extraction and traceability (FEAT), an approach that automatically extracts topoi, which are summaries of the main capabilities of a program, given under the form of collections of code functions along with an index. FEAT acts in two steps: first, clustering: by mining the available source code, possibly augmented with code-level comments, hierarchical agglomerative clustering groups similar code functions. In addition, this process gathers an index for each function. Second, entry point selection: functions within a cluster are then ranked and presented to validation engineers as topoi candidates. We implemented FEAT on top of a general-purpose test management and optimization platform and performed an experimental study over 15 open-source software projects amounting to more than 1 M lines of codes proving that automatically discovering topoi is feasible and meaningful on realistic projects.

6 May 2019
Verified
Book Chapter
Closed access
MBMohamed-Bachir Belaid
Mohamed-Bachir Belaid
CBChristian Bessiere
Christian Bessiere
NLNadjib Lazaar
Nadjib Lazaar
Discovering association rules among items in a dataset is one of the fundamental problems in data mining. It has recently been shown that constraint programming is a flexible way to tackle data mining tasks. In this paper we propose a declarative model based on constraint programming to capture association rules. Our model also allows us to specify any additional property and/or user's constraints on the kind of rules the user is looking for. To implement our model, we introduce a new global constraint, Confident, for ensuring the confidence of rules. We prove that completely propagating Confident is NP-hard. We thus provide a decomposition of Confident. In addition to user's constraints on the items composing body and head of the rules, we show that we can capture the popular minimal non-redundant property of association rules. An experimental analysis shows the practical effectiveness of our approach compared to existing approaches.

3 December 2016
Verified
Book Chapter
Closed access
PDF file
CBChristian Bessiere
Christian Bessiere
ADAbderrazak Daoudi
Abderrazak Daoudi
EHEmmanuel Hebrard
Emmanuel Hebrard
GKGeorge Katsirelos
George Katsirelos
NLNadjib Lazaar
Nadjib Lazaar
TWToby Walsh
Toby Walsh

8 January 2016 in Automated Software Engineering
Verified
Journal Article
Closed access
PDF file
MMMehdi Maamar
Mehdi Maamar
NLNadjib Lazaar
Nadjib Lazaar
SLSamir Loudni
Samir Loudni
YLYahia Lebbah
Yahia Lebbah