References of "Guelfi, Nicolas 50001902"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailSlicing High-level Petri nets
Khan, Yasir Imtiaz UL; Guelfi, Nicolas UL

in International Workshop on Petri Nets and Software Engineering (PNSE'14), Tunis June 2014 (2014, June 23)

High-level Petri nets (evolutions of low-level Petri nets) are well suitable formalisms to represent complex data, which influence the behavior of distributed, concurrent systems. However, usual ... [more ▼]

High-level Petri nets (evolutions of low-level Petri nets) are well suitable formalisms to represent complex data, which influence the behavior of distributed, concurrent systems. However, usual verification techniques such as model checking and testing remain an open challenge for both (i.e., low-level and high-level Petri nets) because of the state space explosion problem and test case selection. The contribution of this paper is to propose a technique to improve the model checking and test- ing of systems modeled using Algebraic Petri nets (a variant of high-level petri nets). To achieve the objective, we propose different slicing algo- rithms for Algebraic Petri nets. We argue that our slicing algorithms significantly improve the state of the art related to slicing APNs and can also be applied to low-level Petri nets with slight modifications. We exemplify our proposed algorithms through a case study of a car crash management system. [less ▲]

Detailed reference viewed: 126 (19 UL)
Full Text
Peer Reviewed
See detailAn Empirical Investigation of Modularity Metrics for Indicating Architectural Technical Debt
Li, Zengyang; Liang, Peng; Avgeriou, Paris et al

in Proceedings of the 10th international ACM Sigsoft conference on Quality of software architectures (2014, June)

Detailed reference viewed: 102 (3 UL)
Full Text
Peer Reviewed
See detailSLAPn: A Tool for slicing Algebraic Petri nets
Khan, Yasir Imtiaz UL; Guelfi, Nicolas UL

Poster (2014)

Algebraic Petri nets is a well suited formalism to represent the behavior of concurrent and distributed systems by handling complex data. For the analysis of systems modelled in Algebraic Petri nets ... [more ▼]

Algebraic Petri nets is a well suited formalism to represent the behavior of concurrent and distributed systems by handling complex data. For the analysis of systems modelled in Algebraic Petri nets, model checking and testing are used commonly. Petri nets slicing is getting an attention recently to improve the analysis of systems modelled in Petri nets or Algebraic Petri nets. This work is oriented to define Algebraic Petri nets slicing and implement it in a verification tool. [less ▲]

Detailed reference viewed: 86 (11 UL)
Full Text
Peer Reviewed
See detailTowards Test-Driven and Architecture Model-Based Security and Resilience Engineering
Saidane, Ayda; Guelfi, Nicolas UL

in Singh, Hardeep; Kaur, Kulwant (Eds.) Designing, Engineering, and Analyzing Reliable and Efficient Software (2013)

Detailed reference viewed: 109 (0 UL)
Full Text
Peer Reviewed
See detailAdaptive Ontology-Based Web Information Retrieval: The TARGET Framework
Pruski, Cédric UL; Guelfi, Nicolas UL; Raynaud, Chantal

in Polgar, Jana; Adamson, Greg (Eds.) Web Portal Design, Implementation, Integration, and Optimization (2013)

Detailed reference viewed: 51 (4 UL)
Full Text
See detailSurvey of Petri nets Slicing
Khan, Yasir Imtiaz UL; Guelfi, Nicolas UL

Report (2013)

Petri nets slicing is a technique that aims to improve the verification of systems modeled in Petri nets. Different Petri nets slicing constructions are studied along with algorithms to compute them ... [more ▼]

Petri nets slicing is a technique that aims to improve the verification of systems modeled in Petri nets. Different Petri nets slicing constructions are studied along with algorithms to compute them. Petri nets slicing was first developed to facilitate debugging but then devel- oped for alleviating the state space explosion problem for model checking Petri nets. This article has twofold objectives, the first is to unify all the existing slicing algorithms syntactically by the definition of a standard abstract syntax and rewriting of the studied slicing algorithms using the proposed syntax. The second is to discuss the contribution of each slicing construction and comparing the major differences between them. One of the interesting exploitation of the survey is for the selection and im- provement of slicing techniques for approaches concerned by optimizing verification of state event models. [less ▲]

Detailed reference viewed: 237 (10 UL)
Full Text
Peer Reviewed
See detailSETER: Towards Architecture-Model Based Security Engineering
Saïdane, Ayda; Guelfi, Nicolas UL

in International Journal of Secure Software Engineering (2012), 3(3), 23-49

Detailed reference viewed: 72 (4 UL)
Peer Reviewed
See detailComparing Six Modeling Approaches
Mussbacher, Gunter; Al Abed, Wisam; Alam, Omar et al

in Kienzle, Joerg (Ed.) Models in Software Engineering (2012)

Detailed reference viewed: 135 (4 UL)
Full Text
Peer Reviewed
See detailReusing Transaction Models for Dependable Cloud Computing
Gallina, Barbara; Guelfi, Nicolas UL

in Yang, Hongji; Liu, Xiaodong (Eds.) Software Reuse in the Emerging Cloud Computing Era (2012)

Detailed reference viewed: 93 (1 UL)
Peer Reviewed
See detailReusing Transaction Models for Dependable Cloud Computing
Gallina, Barbara UL; Guelfi, Nicolas UL

in Xiaodong, Yang Hongji (Ed.) Software Reuse in the Emerging Cloud Computing Era (2011)

Cloud computing represents a technological change in computing. Despite the technological change, however, the quality of the computation, in particular its dependability, keeps on being a fundamental ... [more ▼]

Cloud computing represents a technological change in computing. Despite the technological change, however, the quality of the computation, in particular its dependability, keeps on being a fundamental requirement. To ensure dependability, more specifically reliability, transaction models represent an effective means. In the literature, several transaction models exist. Choosing (reusing entirely) or introducing (reusing partially) transaction models for cloud computing is not an easy task. The difficulty of this task is due to the fact that it requires a deep understanding of the properties that characterize transaction models to be able to discriminate reusable from non reusable properties with respect to cloud computing characteristics. To ease this task, the PRISMA process is introduced. PRISMA is a Process for Requirements Identification, Specification and Machine-supported Analysis that targets transaction models. PRISMA is then applied to engineer reusable requirements suitable for the achievement of the adequate transaction models for cloud computing. [less ▲]

Detailed reference viewed: 76 (0 UL)
Full Text
Peer Reviewed
See detailAdaptive Ontology-based Web Information Retrieval: The TARGET Framework
Pruski, Cedric; Guelfi, Nicolas UL; Reynaud, Chantal

in International Journal of Web Portals (2011), 3

Finding relevant information on the Web is difficult for most users. Although Web search applications are improving, they must be more 'intelligent' to adapt to the search domains targeted by queries, the ... [more ▼]

Finding relevant information on the Web is difficult for most users. Although Web search applications are improving, they must be more 'intelligent' to adapt to the search domains targeted by queries, the evolution of these domains, and users' characteristics. In this paper, the authors present the TARGET framework for Web Information Retrieval. The proposed approach relies on the use of ontologies of a particular nature, called adaptive ontologies, for representing both the search domain and a user's profile. Unlike existing approaches on ontologies, the authors make adaptive ontologies adapt semi-automatically to the evolution of the modeled domain. The ontologies and their properties are exploited for domain specific Web search purposes. The authors propose graph-based data structures for enriching Web data in semantics, as well as define an automatic query expansion technique to adapt a query to users' real needs. The enriched query is evaluated on the previously defined graph-based data structures representing a set of Web pages returned by a usual search engine in order to extract the most relevant information according to user needs. The overall TARGET framework is formalized using first-order logic and fully tool supported. [less ▲]

Detailed reference viewed: 24 (0 UL)
Full Text
Peer Reviewed
See detailA formal framework for dependability and resilience from a software engineering perspective
Guelfi, Nicolas UL

in Central European Journal of Computer Science (2011), 1

The goal of this article is to provide a rigorous conceptual framework for defining the concepts of dependability and resilience. Since the seventies, the terms dependability and resilience have been used ... [more ▼]

The goal of this article is to provide a rigorous conceptual framework for defining the concepts of dependability and resilience. Since the seventies, the terms dependability and resilience have been used in nearly all the scientific and technological fields related to Information and Communication systems. The introduction and use of these concepts in all these fields makes it difficult to have a common and precise definition. Having such a definition is nevertheless mandatory for the software and systems engineering research community that create development processes, languages and tools to support the engineering of products that would be required to be dependable or resilient. For this, we introduce an abstract and generic terminology defined mathematically to be used when speaking about dependability and resiliency. We also provide some abstract semantic descriptions to these terminological elements. This formal framework is defined from a software engineering perspective, which means that we define its components such that they are useful for the development or improvement of analysis, architectural design, detailed design, implementation, verification and maintenance phases. To this aim, we provide the necessary elements in accordance with a model driven engineering perspective that enable the definition of a new modelling language for dependable and resilient systems. [less ▲]

Detailed reference viewed: 51 (0 UL)
Full Text
Peer Reviewed
See detailOO-SPL modelling of the focused case study
Capozucca, Alfredo UL; Cheng, Betty; Guelfi, Nicolas UL et al

in Comparing Modeling Approaches (CMA) International Workshop affiliated with ACM/IEEE 14th International Conference on Model Driven Engineering Languages and Systems (CMA@MODELS2011) (2011)

Detailed reference viewed: 87 (3 UL)
Full Text
Peer Reviewed
See detailModelling Dependable Collaborative Time-constrained Business Process
Capozucca, Alfredo UL; Guelfi, Nicolas UL

in Enterprise Information Systems (2010), 4(2), 153-214

Detailed reference viewed: 68 (5 UL)
Full Text
Peer Reviewed
See detailFrameworks for designing and implementing dependable systems using Coordinated Atomic Actions: A comparative study
Capozucca, Alfredo UL; Guelfi, Nicolas UL; Pelliccione, Patrizio et al

in Journal of Systems and Software (2009), 82(2), 207-228

This paper presents ways of implementing dependable distributed applications designed using the Coordinated Atomic Action (CAA) paradigm. CAAs provide a coherent set of concepts adapted to fault tolerant ... [more ▼]

This paper presents ways of implementing dependable distributed applications designed using the Coordinated Atomic Action (CAA) paradigm. CAAs provide a coherent set of concepts adapted to fault tolerant distributed system design that includes structured transactions, distribution, cooperation, competition, and forward and backward error recovery mechanisms triggered by exceptions. DRIP (Dependable Remote Interacting Processes) is an efficient Java implementation framework which provides support for implementing Dependable Multiparty Interactions (DMI). As DMIs have a softer exception handling semantics compared with the CAA semantics, a CAA design can be implemented using the DRIP framework. A new framework called CAA-DRIP allows programmers to exclusively implement the semantics of CAAs using the same terminology and concepts at the design and implementation levels. The new framework not only simplifies the implementation phase, but also reduces the final system size as it requires less number of instances for creating a CAA at runtime. The paper analyses both implementation frameworks in great detail, drawing a systematic comparison of the two. The CAAs behaviour is described in terms of Statecharts to better understand the differences between the two frameworks. Based on the results of the comparison, we use one of the frameworks to implement a case study belonging to the e-health domain. [less ▲]

Detailed reference viewed: 134 (3 UL)
Full Text
Peer Reviewed
See detailDesigning Reliable Real-Time Concurrent Object-Oriented Software Systems
Capozucca, Alfredo UL; Guelfi, Nicolas UL

in Proceedings of the 24th ACM Symposium on Applied Computing (Track on Real-Time Systems) SAC'09 (2009)

Coordinated Atomic Actions is a conceptual framework used to increase the reliability (by fault tolerance) of concurrent object-oriented software systems. An extension of this con-ceptual framework to ... [more ▼]

Coordinated Atomic Actions is a conceptual framework used to increase the reliability (by fault tolerance) of concurrent object-oriented software systems. An extension of this con-ceptual framework to support the modelling of real-time software systems has been proposed. In this work we present our proposal for improvements of this extension focusing on recovery process optimisation, non-determinism reduction and time-related constructs extension. [less ▲]

Detailed reference viewed: 94 (2 UL)
Full Text
Peer Reviewed
See detailTowards an Alloy Formal Model for Flexible Advanced Transactional Model Development
Gallina, Barbara UL; Guelfi, Nicolas UL; Kelsen, Pierre UL

in Abstract book of 33rd Annual IEEE Software Engineering Workshop 2009 (SEW-33) (2009)

SPLACID is a semi-formal language conceived for the specification and synthesis of (advanced) transactional models from basic features, such as transaction types and (relaxed) ACID variants. SPLACID is an ... [more ▼]

SPLACID is a semi-formal language conceived for the specification and synthesis of (advanced) transactional models from basic features, such as transaction types and (relaxed) ACID variants. SPLACID is an improvement of the ACTA framework offering a well-structured and formal syntax. Neither ACTA nor SPLACID, however, benefit from a formal tool-supported semantics. This paper presents the first step for having a full formal semantics of SPLACID by translation to Alloy. In particular, we present the translation of the SPLACID concepts into Alloy concepts focusing on those concepts pertaining to the structure of a Transactional Model and those characterizing the isolation variant. The Alloy specification obtained by this translation preserve the SPLACID main key-properties, namely, modularity, flexibility and reusability. To support this claim we show how flexible, modular and reusable structures and isolation variants can be obtained in Alloy. Finally, we analyze the flat and nested transactional model structures and the serializability-based isolation variant using the Alloy Analyzer. [less ▲]

Detailed reference viewed: 107 (1 UL)
Peer Reviewed
See detailAnalysis and framework-based design of a fault-tolerant web information system for m-health
Balbastro, Florencia; Capozucca, Alfredo UL; Guelfi, Nicolas UL

in Service Oriented Computing and Applications (2008), 2(2-3), 111-144

Detailed reference viewed: 119 (3 UL)
Full Text
Peer Reviewed
See detailReconciling Automation and Flexibility in Product Derivation
Perrouin, Gilles UL; Klein, Jacques UL; Guelfi, Nicolas UL et al

in Abstract book of 12th International Software Product Line Conference (SPLC2008) (2008)

Product derivation, i.e. reusing core assets to build products, did not receive sufficient attention from the product-line community, yielding a frustrating situation. On the one hand, automated product ... [more ▼]

Product derivation, i.e. reusing core assets to build products, did not receive sufficient attention from the product-line community, yielding a frustrating situation. On the one hand, automated product derivation approaches are inflexible; they do not allow products meeting unforeseen, customer-specific, requirements. On the other hand, approaches that consider this issue do not provide adequate methodological guidelines nor automated support. This paper proposes an integrated product derivation approach reconciling the two views to offer both flexibility and automation. First, we perform a pre-configuration of the product by selecting desired features in a generic feature model and automatically composing their related product-line core assets. Then, we adapt the pre-configured product to its customer-specific requirements via derivation primitives combined by product engineers and controlled by constraints that flexibly set product line boundaries. Our process is supported by the Kermeta metamodeling environment and illustrated through an example. [less ▲]

Detailed reference viewed: 129 (5 UL)