Vander Alves

Vander Alves

Auto-generated profile, based on publicly available information

Vander Alves

University of Brasilia, Brasilia, Brazil

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

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

Representative Publications

View All Publications
1 August 2010 in Information and Software Technology
Verified
Journal Article
Closed access
VAVander Alves
Vander Alves
NNNan Niu
Nan Niu
CACarina Alves
Carina Alves
GVGeorge Valença
George Valença

22 October 2006
Verified
Conference Paper
Open access
PDF file
VAVander Alves
Vander Alves
RGRohit Gheyi
Rohit Gheyi
TMTiago Massoni
Tiago Massoni
UKUirá Kulesza
Uirá Kulesza
PBPaulo Borba
Paulo Borba
CLCarlos Lucena
Carlos Lucena
Adoption strategies for Software Product Lines (SPL) frequently involve bootstrapping existing products into a SPL and extending an existing SPL to encompass another product. One way to do that is to use program refactorings. However, the traditional notion of refactoring does not handle appropriately feature models (FM), nor transformations involving multiple instances of the same SPL. For instance, it is not desirable to apply a refactoring into a SPL and reduce its configurability. In this paper, we extend the traditional notion of refactoring to an SPL context. Besides refactoring programs, FMs must also be refactored. We present a set of sound refactorings for FMs. We evaluate this extended refactoring definition for SPL in a real case study in the mobile games domain.

1 September 2008
Verified
Conference Paper
Closed access
VAVander Alves
Vander Alves
CSChrista Schwanninger
Christa Schwanninger
LBLuciano Barbosa
Luciano Barbosa
ARAwais Rashid
Awais Rashid
PSPeter Sawyer
Peter Sawyer
ARAndreas Rummler
Andreas Rummler
Domain analysis involves not only looking at standard requirements documents (e.g., use case specifications) but also at customer information packs, market analyses, etc. Looking across all these documents and deriving, in a practical and scalable way, a feature model that is comprised of coherent abstractions is a fundamental and non-trivial challenge. We conduct an exploratory study to investigate the suitability of information retrieval (IR) techniques for scalable identification of commonalities and variabilities in requirement specifications for software product lines. Accordingly, based on observations derived from industrial experience and on state-of-the-art research and practice, we also propose an initial framework, leveraging IR to systematically abstract requirements from existing specifications of a given domain into a feature model. We evaluate this framework, present a roadmap for its further extension, and formulate hypotheses to guide future work in exploring IR techniques for domain analysis.

1 January 2005
Verified
Book Chapter
Closed access
PDF file
VAVander Alves
Vander Alves
PMPedro Matos
Pedro Matos
LCLeonardo Cole
Leonardo Cole
PBPaulo Borba
Paulo Borba
GRGeber Ramalho
Geber Ramalho

1 August 2015 in Journal of Systems and Software
Verified
Journal Article
Closed access
LNL. Neves
L. Neves
PBP. Borba
P. Borba
VAV. Alves
V. Alves
LTL. Turnes
L. Turnes
LTL. Teixeira
L. Teixeira
UKU. Kulesza
U. Kulesza

1 January 2015
Verified
Conference Paper
Closed access
GRGenaina N. Rodrigues
Genaina N. Rodrigues
VAVander Alves
Vander Alves
VNVinicius Nunes
Vinicius Nunes
ALAndre Lanna
Andre Lanna
MCMaxime Cordy
Maxime Cordy
ALAxel Legay
Axel Legay
We propose a model for feature-aware discrete-time Markov chains, called FDTMC, as a basis for verifying probabilistic properties, e.g., Reliability and availability, of product lines. To verify such properties on FDTMC, we compare three techniques. First, we experiment with two different parametric techniques to obtain this formula: the classical one builds it from the model as whole, and a new one that builds it compositionally from a sequence of modules. Finally, we propose a new technique that performs a bounded verification for the whole product line, and thus takes advantage of the high probability of common behaviors of the product line. It computes an approximate formula, represented as an arithmetic decision diagram. Experimental results on a vital signal monitoring system prototype are provided and compared for these techniques aiming at analysing them for scalability issues of size and computational time. They show complementary advantages, and we provide criteria to choose a technique depending on the characteristics of the model.