Abstract

Software Product Lines (SPLs) are families of similar software products built from a common set of features. As the number of products of an SPL is potentially exponential in the number of its features, the model checking problem is harder than for single software. A practical way to face this exponential blow-up is to reuse common behaviour between products. We previously introduced Featured Transition Systems (FTS), a mathematical model that serves as a basis for efficient SPL model checking techniques. In this paper, we present ProVeLines, a product line of verifiers for SPLs that incorporates the results of over three years of research on formal verification of SPLs. Being itself a product line, our tool is flexible and extensible, and offers a wide range of solutions for SPL modelling and verification. Copyright 2013 ACM.
Original languageEnglish
Pages141 - 146
Number of pages6
DOIs
Publication statusPublished - Aug 2013
Event17th International Software Product Line Conference - Tokyo, Tokyo, Japan
Duration: 26 Aug 201330 Aug 2013

Conference

Conference17th International Software Product Line Conference
CountryJapan
CityTokyo
Period26/08/1330/08/13

Fingerprint

Model checking
Mathematical models
Formal verification

Keywords

  • Software Product Line Engineering

Cite this

@conference{1021a56170004af0a679f7cdbb348490,
title = "ProVeLines: A Product Line of Verifiers for Software Product Lines",
abstract = "Software Product Lines (SPLs) are families of similar software products built from a common set of features. As the number of products of an SPL is potentially exponential in the number of its features, the model checking problem is harder than for single software. A practical way to face this exponential blow-up is to reuse common behaviour between products. We previously introduced Featured Transition Systems (FTS), a mathematical model that serves as a basis for efficient SPL model checking techniques. In this paper, we present ProVeLines, a product line of verifiers for SPLs that incorporates the results of over three years of research on formal verification of SPLs. Being itself a product line, our tool is flexible and extensible, and offers a wide range of solutions for SPL modelling and verification. Copyright 2013 ACM.",
keywords = "Software Product Line Engineering",
author = "Maxime Cordy and Andreas Classen and Patrick Heymans and Pierre-Yves Schobbens and Axel Legay",
year = "2013",
month = "8",
doi = "10.1145/2499777.2499781",
language = "English",
pages = "141 -- 146",
note = "null ; Conference date: 26-08-2013 Through 30-08-2013",

}

ProVeLines : A Product Line of Verifiers for Software Product Lines. / Cordy, Maxime; Classen, Andreas; Heymans, Patrick; Schobbens, Pierre-Yves; Legay, Axel.

2013. 141 - 146 Paper presented at 17th International Software Product Line Conference, Tokyo, Japan.

Research output: Contribution to conferencePaper

TY - CONF

T1 - ProVeLines

T2 - A Product Line of Verifiers for Software Product Lines

AU - Cordy, Maxime

AU - Classen, Andreas

AU - Heymans, Patrick

AU - Schobbens, Pierre-Yves

AU - Legay, Axel

PY - 2013/8

Y1 - 2013/8

N2 - Software Product Lines (SPLs) are families of similar software products built from a common set of features. As the number of products of an SPL is potentially exponential in the number of its features, the model checking problem is harder than for single software. A practical way to face this exponential blow-up is to reuse common behaviour between products. We previously introduced Featured Transition Systems (FTS), a mathematical model that serves as a basis for efficient SPL model checking techniques. In this paper, we present ProVeLines, a product line of verifiers for SPLs that incorporates the results of over three years of research on formal verification of SPLs. Being itself a product line, our tool is flexible and extensible, and offers a wide range of solutions for SPL modelling and verification. Copyright 2013 ACM.

AB - Software Product Lines (SPLs) are families of similar software products built from a common set of features. As the number of products of an SPL is potentially exponential in the number of its features, the model checking problem is harder than for single software. A practical way to face this exponential blow-up is to reuse common behaviour between products. We previously introduced Featured Transition Systems (FTS), a mathematical model that serves as a basis for efficient SPL model checking techniques. In this paper, we present ProVeLines, a product line of verifiers for SPLs that incorporates the results of over three years of research on formal verification of SPLs. Being itself a product line, our tool is flexible and extensible, and offers a wide range of solutions for SPL modelling and verification. Copyright 2013 ACM.

KW - Software Product Line Engineering

U2 - 10.1145/2499777.2499781

DO - 10.1145/2499777.2499781

M3 - Paper

SP - 141

EP - 146

ER -