Pierre Yves Schobbens

Prof. Pierre Yves Schobbens

Université de Namur

Research Focus & Metrics

Academic Career Length

37Years (1990-Present)

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

Representative Publications

View All Publications
1 February 2007 in Computer Networks
Verified
Journal Article
Closed access
Pierre Yves SchobbensPierre Yves Schobbens
Pierre Yves Schobbens
PHPatrick Heymans
Patrick Heymans
JTJean-Christophe Trigaux
Jean-Christophe Trigaux
YBYves Bontemps
Yves Bontemps

20 December 2012 in IEEE Transactions on Software Engineering
Verified
Journal Article
Closed access
ACAndreas Classen
Andreas Classen
MCMaxime Cordy
Maxime Cordy
Pierre Yves SchobbensPierre Yves Schobbens
Pierre Yves Schobbens
PHPatrick Heymans
Patrick Heymans
ALAxel Legay
Axel Legay
JRJean-Francois Raskin
Jean-Francois Raskin
The premise of variability-intensive systems, specifically in software product line engineering, is the ability to produce a large family of different systems efficiently. Many such systems are critical. Thorough quality assurance techniques are thus required. Unfortunately, most quality assurance techniques were not designed with variability in mind. They work for single systems, and are too costly to apply to the whole system family. In this paper, we propose an efficient automata-based approach to linear time logic (LTL) model checking of variability-intensive systems. We build on earlier work in which we proposed featured transitions systems (FTSs), a compact mathematical model for representing the behaviors of a variability-intensive system. The FTS model checking algorithms verify all products of a family at once and pinpoint those that are faulty. This paper complements our earlier work, covering important theoretical aspects such as expressiveness and parallel composition as well as more practical things like vacuity detection and our logic feature LTL. Furthermore, we provide an in-depth treatment of the FTS model checking algorithm. Finally, we present SNIP, a new model checker for variability-intensive systems. The benchmarks conducted with SNIP confirm the speedups reported previously.

1 May 2010
Verified
Conference Paper
Open access
PDF file
ACAndreas Classen
Andreas Classen
PHPatrick Heymans
Patrick Heymans
Pierre Yves SchobbensPierre Yves Schobbens
Pierre Yves Schobbens
ALAxel Legay
Axel Legay
JRJean-François Raskin
Jean-François Raskin
International audienceIn product line engineering, systems are developed in families and differences between family members are expressed in terms of features. Formal modelling and verification is an important issue in this context as more and more critical systems are developed this way. Since the number of systems in a family can be exponential in the number of features, two major challenges are the scalable modelling and the efficient verification of system behaviour. Currently, the few attempts to address them fail to recognise the importance of features as a unit of difference, or do not offer means for automated verification. In this paper, we tackle those challenges at a fundamental level. We first extend transition systems with features in order to describe the combined behaviour of an entire system family. We then define and implement a model checking technique that allows to verify such transition systems against temporal properties. An empirical evaluation shows substantial gains over classical approaches

21 May 2011
Verified
Conference Paper
Open access
PDF file
ACAndreas Classen
Andreas Classen
PHPatrick Heymans
Patrick Heymans
Pierre Yves SchobbensPierre Yves Schobbens
Pierre Yves Schobbens
ALAxel Legay
Axel Legay
International audienceWe study the problem of model checking software product line (SPL) behaviours against temporal properties. This is more difficult than for single systems because an SPL with n features yields up to 2 n individual systems to verify. As each individual verification suffers from state explosion, it is crucial to propose efficient formalisms and heuristics. We recently proposed featured transition systems (FTS), a compact representation for SPL behaviour, and defined algorithms for model checking FTS against linear temporal properties. Although they showed to outperform individual system verifications, they still face a state explosion problem as they enumerate and visit system states one by one. In this paper, we tackle this latter problem by using symbolic representations of the state space. This lead us to consider computation tree logic (CTL) which is supported by the industry-strength symbolic model checker NuSMV. We first lay the foundations for symbolic SPL model checking by defining a feature-oriented version of CTL and its dedicated algorithms. We then describe an implementation that adapts the NuSMV language and tool infrastructure. Finally, we propose theoretical and empirical evaluations of our results. The benchmarks show that for certain properties, our algorithm is over a hundred times faster than model checking each system with the standard algorithm

1 October 2007
Verified
Conference Paper
Closed access
AMAndreas Metzger
Andreas Metzger
KPKlaus Pohl
Klaus Pohl
PHPatrick Heymans
Patrick Heymans
Pierre Yves SchobbensPierre Yves Schobbens
Pierre Yves Schobbens
GSGermain Saval
Germain Saval
Feature diagrams are a popular means for documenting variability in software product line engineering. When examining feature diagrams in the literature and from industry, we observed that the same modelling concepts are used for documenting two different kinds of variability: (1) product line variability, which reflects decisions of product management on how the systems that belong to the product line should vary, and (2) software variability, which reflects the ability of the reusable product line artefacts to be customized or configured. To disambiguate the documentation of variability, we follow previous suggestions to relate orthogonal variability models (OVMs) to feature diagrams. This paper reuses an existing formalization of feature diagrams, but introduces a formalization of OVMs. Then, the relationships between the two kinds of models are formalized as well. Besides a precise definition of the languages and the links, the important benefit of this formalization is that it serves as a foundation for a tool supporting automated reasoning on variability. This tool can, e.g., analyse whether the product line artefacts are flexible enough to build all the systems that should belong to the product line.

1 April 2004 in Electronic Notes in Theoretical Computer Science
Verified
Journal Article
Open access
Pierre Yves SchobbensPierre Yves Schobbens
Pierre Yves Schobbens
We study here a variant of the alternating-time temporal logic (ATL) where each agent has a given memory. We show that it is an interesting compromise, rather realistic but with a reasonable complexity. In contrast, most models with perfect recall and imperfect information have an undecidable model-checking problem