Search

Your search keyword '"[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]"' showing total 8,629 results
Start Over Descriptor "[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]"
8,629 results on '"[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]"'

1. A feature-based survey of Fog modeling languages

Author

Abdelghani Alidra, Hugo Bruneliere, Thomas Ledoux, Département Automatique, Productique et Informatique (IMT Atlantique - DAPI), IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Software Stack for Massively Geo-Distributed Infrastructures (STACK), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Nantes Université (Nantes Univ), NaoMod - Nantes Software Modeling Group (LS2N - équipe NaoMod), Laboratoire des Sciences du Numérique de Nantes (LS2N), Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), and ANR-20-CE25-0017,SeMaFoR,Gestion autonome des ressources dans le Fog computing(2020)

Subjects
Computer Networks and Communications, Hardware and Architecture, Internet of Things, Modeling language, Fog Computing, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Cloud Computing, Survey, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], Software
Abstract

International audience; Fog Computing is a new paradigm aiming at decentralizing the Cloud by geographically distributing away computation, storage and network resources as well as related services. In order to design, develop, deploy, maintain and evolve Fog systems, languages are required for properly modeling both their entities (e.g., infrastructures, topologies, resources configurations) and their specific features such as the locality concept, QoS constraints applied on resources (e.g., energy, data privacy, latency) and their dependencies, the dynamicity of considered workloads, the heterogeneity of both applications and devices, etc. This paper provides a detailed overview of the current state-of-the-art in terms of Fog modeling languages. We relied on our long-term experience in Cloud Computing and Cloud Modeling to contribute a feature model describing what we believe to be the most important characteristics of Fog modeling languages. We also performed a systematic scientific literature search and selection process to obtain a list of already existing Fog modeling languages. Then, we evaluated and compared these Fog modeling languages according to the characteristics expressed in our feature model. As a result, we discuss in this paper the main capabilities of these Fog modeling languages and propose a corresponding set of open research challenges in this area. We expect the presented work to be helpful to both current and future researchers or engineers working on/with Fog systems, as well as to anybody genuinely interested in Fog Computing or more generally in distributed systems.

Published
2023

2. A Model-Driven Methodology to Accelerate Software Engineering in the Internet of Things

Author

Imad Berrouyne, Mehdi Adda, Jean-Marie Mottu, Massimo Tisi, Interdisciplinary Centre for Security, Reliability and Trust [Luxembourg] (SnT), Université du Luxembourg (Uni.lu), Université du Québec à Rimouski (UQAR), Institut Universitaire de Technologie - Nantes (Nantes Univ - IUT Nantes), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ), Département Automatique, Productique et Informatique (IMT Atlantique - DAPI), IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), NaoMod - Nantes Software Modeling Group (LS2N - équipe NaoMod), Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), and Nantes Université (Nantes Univ)

Subjects
Policy Enforcement, Model Transformation, Computer Networks and Communications, Internet of Things, Software Engineering, Model-Driven Engineering, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, Code Generation, Computer Science Applications, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Hardware and Architecture, Signal Processing, Information Systems
Abstract

International audience; The Internet of Things (IoT) aims for connecting Anything, Anywhere, Anytime (AAA). This assumption brings about several software engineering challenges that constitute a serious obstacle to its wider adoption. The main feature of the Internet of Things (IoT) is genericity w.r.t the variability of software and hardware technologies. Model-Driven Engineering (MDE) is a paradigm that advocates using models to address software engineering problems. It can help to meet the genericity of the IoT from a software engineering perspective. Existing MDE approaches for the IoT focus only on modeling the internal behavior of things but lack a comprehensive approach dedicated to network modeling. In the present paper, we introduce a network-oriented methodology based on MDE to unify the IoT's heterogeneous concepts. Fundamentally, we avoid the intrinsic heterogeneity of the IoT by separating the network's specification (i.e., the things, the communication scheme, and its constraints) from its concrete implementation (i.e., the low-level artifacts such as source code and documentation). Technically, the methodology relies on a model-based Domain-Specific Language (DSL) and a code generator. The former enables the modeling of the network's specification, and the latter provides a procedure to generate the low-level artifacts from this specification. Our results show that this methodology makes IoT's software engineering more rigorous, helps prevent bugs earlier, and saves time.

Published
2022

3. The Advantages of Maintaining a Multitask, Project-Specific Bot: An Experience Report

Author

Zimmermann, Théo, Coolen, Julien, Gross, Jason, Pédrot, Pierre-Marie, Gilbert, Gaëtan, Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)), Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité), Design, study and implementation of languages for proofs and programs (PI.R2), Centre National de la Recherche Scientifique (CNRS)-Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Paris Cité (UPCité)-Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)), Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité)-Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité), Université Paris Cité (UPCité), Machine Intelligence Research Institute (MIRI), Gallinette : vers une nouvelle génération d'assistant à la preuve (GALLINETTE), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), and Nantes Université (Nantes Univ)

Subjects
Software Engineering (cs.SE), FOS: Computer and information sciences, Computer Science - Software Engineering, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Software
Abstract

Bots are becoming a popular method for automating basic everyday tasks in many software projects. This is true in particular because of the availability of many off-the-shelf task-specific bots that teams can quickly adopt (which are sometimes completed with additional task-specific custom bots). Based on our experience in the Coq project, where we have developed and maintained a multi-task project-specific bot, we argue that this alternative approach to project automation should receive more attention because it strikes a good balance between productivity and adaptibility. In this article, we describe the kind of automation that our bot implements, what advantages we have gained by maintaining a project-specific bot, and the technology and architecture choices that have made it possible. We draw conclusions that should generalize to other medium-sized software teams willing to invest in project automation without disrupting their workflows., arXiv admin note: substantial text overlap with arXiv:2112.07365

Published
2022

4. A Review of Core Operational Business-IT Alignment

Author

Andre, Pascal, Tamzalit, Dalila, Benjilany, Ali, Bruneliere, Hugo, Vérification pour l'Environnement et le LOgiciel (LS2N - équipe VELO), Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Nantes Université (Nantes Univ), NaoMod - Nantes Software Modeling Group (LS2N - équipe NaoMod), Département Automatique, Productique et Informatique (IMT Atlantique - DAPI), IMT Atlantique (IMT Atlantique), and Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)

Subjects
Business Process Modelling, [INFO]Computer Science [cs], [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Software Application Modelling, Enterprise Architecture, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], Information Systems, Core Operational Business-IT Alignment
Abstract

International audience; In terms of competitiveness, Business-IT Alignment (BITA) is still a crucial challenge for business leaders and CIOs, especially in the context of Digital Transformation and time-to-market challenges. Core Operational BITA can be seen as a projection of BITA to the Enterprise Information System perimeter, i.e., the operational alignment between the business processes and supporting IT. It is a major source of issues (e.g., strong couplings, maintenance costs, technical debt, slow adaptation). These cause a misalignment and thus contribute to the well-known Business-IT Gap. In this paper, we review the current state of this operational alignment in the context of Enterprise Architecture (EA) i.e. between the Business Process layer and the Application layer. Our analysis focuses on the models used at the Business Process and Application layers, the existing or potential links between these layers, and the use of these links to carry out a core operational alignment and facilitate the detection of potential divergence points. As a result, we notably outline some current limitations, such as modelling disparities, misuse of links between the two layers and an under-coverage of real alignment processes. We also discuss some lessons learned and future challenges, mainly around modelling needs and consistency management between the two considered layers.

Published
2023

5. Generative AI for Reengineering Variants into Software Product Lines: An Experience Report

Author

Acher, Mathieu, Martinez, Jabier, Diversity-centric Software Engineering (DiverSe), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Institut Universitaire de France (IUF), Ministère de l'Education nationale, de l’Enseignement supérieur et de la Recherche (M.E.N.E.S.R.), Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA), TECNALIA France, and Tecnalia

Subjects
software product line, reverse engineering, variant, generative AI, variability, large language model, [INFO]Computer Science [cs], [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], configuration
Abstract

International audience; The migration and reengineering of existing variants into a software product line (SPL) is an error-prone and time-consuming activity. Many extractive approaches have been proposed, spanning different activities from feature identification and naming to the synthesis of reusable artefacts. In this paper, we explore how large language model (LLM)-based assistants can support domain analysts and developers. We revisit four illustrative cases of the literature where the challenge is to migrate variants written in different formalism (UML class diagrams, Java, GraphML, statecharts). We systematically report on our experience with ChatGPT-4, describing our strategy to prompt LLMs and documenting positive aspects but also failures. We compare the use of LLMs with state-of-the-art approach, BUT4Reuse. While LLMs offer potential in assisting domain analysts and developers in transitioning software variants into SPLs, their intrinsic stochastic nature and restricted ability to manage large variants or complex structures necessitate a semiautomatic approach, complete with careful review, to counteract inaccuracies.

Published
2023

6. On Programming Variability with Large Language Model-based Assistant

Author

Acher, Mathieu, Duarte, José, Jézéquel, Jean-Marc, Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA), Institut Universitaire de France (IUF), Ministère de l'Education nationale, de l’Enseignement supérieur et de la Recherche (M.E.N.E.S.R.), Diversity-centric Software Engineering (DiverSe), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Université de Séville | University of Seville | Universidad de Sevilla, ACM, and Université de Rennes (UR)

Subjects
variants, variability, generative AI, software product lines, large language model, [INFO]Computer Science [cs], [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], programming
Abstract

International audience; Programming variability is central to the design and implementation of software systems that can adapt to a variety of contexts and requirements, providing increased flexibility and customization. Managing the complexity that arises from having multiple features, variations, and possible configurations is known to be highly challenging for software developers. In this paper, we explore how large language model (LLM)-based assistants can support the programming of variability. We report on new approaches made possible with LLM-based assistants, like: features and variations can be implemented as prompts; augmentation of variability out of LLM-based domain knowledge; seamless implementation of variability in different kinds of artefacts, programming languages, and frameworks, at different binding times (compile-time or run-time). We are sharing our data (prompts, sessions, generated code, etc.) to support the assessment of the effectiveness and robustness of LLMs for variability-related tasks.

Published
2023

7. Lessons for Interactive Theorem Proving Researchers from a Survey of Coq Users

Author

de Almeida Borges, Ana, Artís, Annalí, Falleri, Jean-Rémy, Gallego Arias, Emilio Jesús, Martin-Dorel, Érik, Palmskog, Karl, Serebrenik, Alexander, Zimmermann, Théo, University of Barcelona, Ifo Institute, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS), Institut Universitaire de France (IUF), Ministère de l'Education nationale, de l’Enseignement supérieur et de la Recherche (M.E.N.E.S.R.), Les assistants à la démonstration au cœur du raisonnement mathématique (PICUBE), Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)), Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité)-Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité), Assistance à la Certification d’Applications DIstribuées et Embarquées (IRIT-ACADIE), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), Université Toulouse III - Paul Sabatier (UT3), Royal Institute of Technology [Stockholm] (KTH ), Eindhoven University of Technology [Eindhoven] (TU/e), Autonomic and Critical Embedded Systems (ACES), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Département Informatique et Réseaux (INFRES), Télécom ParisTech, Institut Polytechnique de Paris (IP Paris), Adam Naumowicz, and René Thiemann

Subjects
Statistical Analysis, Coq, Community, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Survey
Abstract

International audience; The Coq Community Survey 2022 was an online public survey of users of the Coq proof assistant conducted during February 2022. Broadly, the survey asked about use of Coq features, user interfaces, libraries, plugins, and tools, views on renaming Coq and Coq improvements, and also demographic data such as education and experience with Coq and other proof assistants and programming languages. The survey received 466 submitted responses, making it the largest survey of users of an interactive theorem prover (ITP) so far. We present the design of the survey, a summary of key results, and analysis of answers relevant to ITP technology development and usage. In particular, we analyze user characteristics associated with adoption of tools and libraries and make comparisons to adjacent software communities. Notably, we find that experience has significant impact on Coq user behavior, including on usage of tools, libraries, and integrated development environments.

Published
2023

8. Debugging Video Games: A Systematic Mapping

Author

Vanègue, Adrien, Bourcier, Valentin, Petrillo, Fabio, Costiou, Steven, Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS), Analyses and Languages Constructs for Object-Oriented Application Evolution (RMOD), Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS), Reflective Evolution of Ever-running Software Systems (EVREF), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille-Berger-Levrault-Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Ecole de Technologie Supérieure [Montréal] (ETS), and ANR-21-CE25-0004,OCRE,OCRE: Réduire le coût du debugging avec la première génération de debuggers orientés objet(2021)

Subjects
[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], software quality, debugging, video game, software engineering
Abstract

International audience; The video game industry is a vast and lucrative sector that generates significant revenue. However, a recurring issue within this industry is the release of games with numerous bugs. The process of debugging, a challenging and expensive undertaking in software development, becomes crucial in rectifying these issues. It is worth noting that such bugs can significantly impact the commercial performance of games in the market. Therefore, an imperative arises to foster further academic research that presents dedicated debugging techniques aimed at enhancing the process specifically within the realm of video game development. In this paper, we employ a systematic mapping study methodology to discern the existing body of knowledge concerning debugging practices for video games. Through a systematic selection process, we selected 21 relevant studies for analysis, enabling the synthesis of data and facilitating the creation of a overview that encapsulates the state of the art on debugging video games. We identified work analyzing challenges of debugging games, proposing bug detection techniques or dedicated debugging tools. However, these work are always bound to specific contexts or kinds of games. Our analysis shows that there is no academic body of knowledge about debugging video games. Thus, this initial exploration not only raises pertinent questions but also presents prospects for conducting empirical and controlled experiments to enhance our understanding of effective debugging strategies within the context of video game development. We complete our analysis with a discussion of testing and debugging techniques, and how they could help and open new research opportunities for the debugging of video games. CCS Concepts: • Software and its engineering → Maintaining software; Development frameworks and environments; Software maintenance tools; Software notations and tools.

Published
2023

9. Pull Requests Integration Process Optimization: An Empirical Study

Author

Olmedo, Agustín, Arévalo, Gabriela, Cassol, Ignacio, Perez, Quentin, Urtado, Christelle, Vauttier, Sylvain, Laboratorio de Investigación, Desarrollo y Transferencia de la Universidad Austral (LIDTUA), Consejo Nacional de Investigaciones Científicas y Técnicas [Buenos Aires] (CONICET)-Universidad Austral, Consejo Nacional de Investigaciones Científicas y Técnicas [Buenos Aires] (CONICET), Diversity-centric Software Engineering (DiverSe), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), EuroMov - Digital Health in Motion (Euromov DHM), IMT - MINES ALES (IMT - MINES ALES), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Montpellier (UM), and Hermann Kaindl, Mike Mannion and Leszek A. Maciaszek

Subjects
Pull-based development, Merge conflicts, ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.9: Management/D.2.9.5: Software configuration management, Pull request, ACM: D.: Software/D.2: SOFTWARE ENGINEERING, Distributed version control system, Integration process efficiency, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Software merging, ACM: D.: Software, Collaborative software development
Abstract

International audience; Pull-based Development (PbD) is widely used in collaborative development to integrate changes into a project codebase. In this model, contributions are notified through Pull Request (PR) submissions. Project administrators are responsible for reviewing and integrating PRs. In the integration process, conflicts occur when PRs are concurrently opened on a given target branch and propose different modifications for a same code part. In a previous work, we proposed an approach, called IP Optimizer, to improve the Integration Process Efficiency (IPE) by prioritizing PRs. In this work, we conduct an empirical study on 260 open-source projects hosted by GitHub that use PRs intensively in order to quantify the frequency of conflicts in software projects and analyze how much the integration process can be improved. Our results indicate that regarding the frequency of conflicts in software projects, half of the projects have a moderate and high number of pairwise conflicts and half have a low number of pairwise conflicts or none. Futhermore, on average 18.82% of the time windows have conflicts. On the other hand, regarding how much the integration process can be improved, IP Optimizer improves the IPE in 94.16% of the time windows and the average improvement percentage is 146.15%. In addition, it improves the number of conflict resolutions in 67.16% of the time windows and the average improvement percentage is 134.28%.

Published
2023

10. Non-Recursive LSAWfP Models are Structured Workflows

Author

Zekeng Ndadji, Milliam Maxime, Nguedia Momo, Daniela Marionne, Tonle Noumbo, Franck Bruno, and Tchoupé Tchendji, Maurice

Subjects
BPM, Serialisation, Dyck Language, Workflows Structurés, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], Structured Workflows, LSAWfP, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Langage de Dyck, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], Sérialisation
Abstract

Éditeurs: Mathieu Roche, Nabil Gmati, Amel Ben Abda, Marcellin Nkenlifack, Workflow languages are a key component of the Business Process Management (BPM) discipline: they are used to model business processes in order to facilitate their automatic management by means of BPM systems. There are numerous workflow languages addressing various issues (expressiveness, formal analysis, etc.). In the last decade, some workflow languages based on context-free grammars (having then formal semantics) and offering new perspectives to process modelling, have emerged: LSAWfP (a Language for the Specification of Administrative Workflow Processes) is one of them. LSAWfP has many advantages over other existing languages, but it is its expressiveness (which has been very little addressed in previous works) that is studied in this paper. Indeed, the work in this paper aims to demonstrate that any non-recursive LSAWfP model is a structured workflow. Knowing that the majority of commercial BPM systems only implement structured workflows, the result of this study establishes that, although LSAWfP is still much more theoretical, it is a language with commercial potential., Les langages de workflow occupent une place importante dans la discipline du Business Process Management (BPM) : ils sont utilisés pour modéliser les processus opérationnels afin de faciliter leur gestion automatique à l'aide de systèmes BPM. Il existe de nombreux langages de workflow qui traitent de divers aspects (expressivité, analyse formelle, etc.). Au cours de la dernière décennie, certains langages de workflow basés sur des grammaires algébriques (ayant alors une sémantique formelle) et offrant de nouvelles perspectives à la modélisation des processus ont vu le jour : LSAWfP (a Language for the Specification of Administrative Workflow Processes) est l'un d'entre eux. LSAWfP présente de nombreux avantages par rapport aux langages existants, mais c'est son expressivité (qui a été très peu abordée dans les travaux antérieurs) qui est étudiée dans le présent document. En effet, les travaux présentés dans ce document visent à démontrer que tout modèle LSAWfP non récursif est un workflow structuré. Sachant que la majorité des systèmes BPM commerciaux ne gèrent que des workflows structurés, le résultat de cette étude montre que, bien que LSAWfP soit encore très théorique, il est un langage au potentiel économique certain.

Published
2023

11. Machine Learning for Feature Constraints Discovery

Author

Martin, Hugo, Temple, Paul, Acher, Mathieu, Pereira, Juliana Alves, Jézéquel, Jean-Marc, Diversity-centric Software Engineering (DiverSe), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), and Pontifícia Universidade Católica do Rio de Janeiro (PUC-Rio)

Subjects
[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]
Abstract

International audience

Published
2023

12. The Cubicle Fuzzy Loop : A Fuzzing-Based Extension for the Cubicle Model Checker

Author

Conchon, Sylvain, Korneva, Alexandrina, Laboratoire Méthodes Formelles (LMF), and Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay)

Subjects
Fuzzing techniques, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Parameterized Systems, Model Checking
Abstract

This paper presents the Cubicle Fuzzy Loop (CFL), a fuzzingbased extension for Cubicle, a model checker for parameterized systems. To prove safety, Cubicle generates invariants, making use of forward exploration strategies like BFS or DFS on finite model instances. However, these standard algorithms are quickly faced with the state explosion problem due to Cubicle's purely nondeterministic semantics. This causes them to struggle at discovering critical states, hindering invariant generation. CFL replaces this approach with a powerful DFS-like algorithm inspired by fuzzing. Cubicle's purely nondeterministic execution loop is modified to provide feedback on newly discovered states and visited transitions. This feedback is used by CFL to construct schedulers that guide the model exploration. Not only does this provide Cubicle with a bigger variety of states for generating invariants, it also quickly identifies unsafe models. As a bonus, it adds testing capabilities to Cubicle, such as the ability to detect deadlocks. Our first experiments have yielded promising results. CFL effectively allows Cubicle to generate crucial invariants, useful to handle hierarchical systems, while also being able to trap bad states and deadlocks in hardto-reach areas of such models.

Published
2023

13. Combining Scrum and Model Driven Architecture for the development of an epidemiological surveillance software

Author

Azanzi, Jiomekong, Tapamo, Hippolyte, and Camara, Gaoussou

Subjects
Epidemiological surveillance systems, Agile, Model Driven Engineering, EPICAM, Tuberculosis, [INFO]Computer Science [cs], [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Model Driven Architecture, Scrum
Abstract

Epidemiological surveillance systems evolve with time, depending on the context and the data already collected. Then, the software used must evolve in order to meet requirements. However, introducing new requirements in order to update the software takes time, is expensive and may lead to the problem of software regression. The problem of failed software developed for epidemiological surveillance are often the result of an unsystematic transfer of business requirements to the implementation. This problem can be avoided if the system is established using a well-defined framework/architecture permitting the rapid development/update of the surveillance software. Empirical research shows on the one hand that Model Driven Techniques such as Model Driven Architecture (MDA) are more effective than code-centric approaches for the development and the maintenance of software. On the other hand, Agile Processes such as Scrum are more effective than Structured Processes when requirements are subject to frequent change. Researchers demonstrated that developers of medical software such as epidemiological surveillance software are experiencing difficulties when following Structured Processes and code-centric approaches. The main goal of this empirical study was to apply the combination of Scrum and Model Driven Architecture for the development of epidemiological surveillance of tuberculosis. During this research, we found the approach ease of use and very useful when the MDA tool can generate the complete source code. It has had positive effects on programmer productivity and satisfaction, cost-effectiveness, timelines and customer satisfaction. In addition, we learned that to involve non-informatic experts in the development/update, the modeling user interface must be as simple as possible., Les systèmes de surveillance épidémiologiques évoluent avec le temps, en tenant compte du contexte et des données collectées. Ainsi, les logiciels utilisés doivent aussi évoluer pour pouvoir répondre aux besoins. Cependant, de nouvelles exigences des clients peuvent prendre du temps pour être implémentées, coûter plus cher (dans le cas où il faut recruter des programmeurs) et causer des problèmes comme le problème de régression logiciel. Ainsi, le logiciel peut devenir défaillant. Ceci est dû à un mauvais transfert des exigences des clients vers la mise en œuvre. Ce problème peut être évité si le système est développé en utilisant un framework et une architecture permettant le développement/la mise à jour rapide des logiciels de surveillance. La recherche empirique d'une part montre que l'Ingénierie Dirigée par les Modèles (par exemple, Architecture Dirigée par les Modèles ou Model-Driven Architecture - MDA) est plus efficace que les approches basées sur le code pour le développement et la maintenance de certains logiciels. D'autre part, les processus agiles tels que Scrum sont plus efficaces que les processus structurés lorsque les exigences sont sujettes aux changements fréquents. Il a été démontré que le développement des logiciels de santé comme les logiciels de surveillance épidémiologique en utilisant les processus structurés ou les approches de développement centrées sur le code n'est pas évident car ces logiciels sont sujettes aux changements fréquents. Dans ce travail, nous étudions la combinaison de Scrum avec MDA pour le développement du système de surveillance épidémiologique de la tuberculose. A son terme, nous avons trouvé la combinaison de Scrum et MDA simple, très utile lorsque l'outil sous-jacent peut générer tout le code source. La combinaison de Scrum et MDA a eu des effets positifs sur la productivité et la satisfaction des programmeurs et des clients. En plus, nous avons constaté que pour impliquer les non-informaticiens dans le développement ou la mise à jour, l'interface de modélisation doit être aussi simple que possible.

Published
2023

14. Demo: comDeX unveiled demonstrating the future of IoT-Enhanced communities

Author

Papadakis, Nikolaos, Bouloukakis, Georgios, Magoutis, Kostas, Institut Polytechnique de Paris (IP Paris), Département Informatique (TSP - INF), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Algorithmes, Composants, Modèles Et Services pour l'informatique répartie (ACMES-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Institute of Computer Science [FORTH, Heraklion] (ICS-FORTH), Foundation for Research and Technology - Hellas (FORTH), Middleware on the Move (MIMOVE), Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Computer Science Department [Crete] (CSD-UOC), School of Sciences and Engineering [Crete] (SSE-UOC), and University of Crete [Heraklion] (UOC)-University of Crete [Heraklion] (UOC)

Subjects
Middleware, Information integration, Data Exchange, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO]Computer Science [cs], [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Smart Communities
Abstract

International audience; The rapidly expanding field of Internet of Things (IoT) has necessitated the development of effective and efficient systems for handling the vast quantities of data that are generated. However, the inherent diversity and complexity of IoT environments, coupled with the large volume of data, pose significant challenges to achieving interoperability and efficient data exchange. ComDeX, is a novel approach designed to meet these challenges. This demo paper presents the prototype of ComDeX, which is designed to facilitate efficient data exchange in smart communities using a federation of message brokers. The prototype harnesses NGSI-LD and MQTT standards along with an advertisement-based mechanism to enable dynamic data exchange. We detail its implementation and key functionalities, demonstrating its applicability through scenarios that mimic real-world smart communities.

Published
2023

15. ComDeX: a context-aware federated platform for IoT-enhanced communities

Author

Papadakis, Nikolaos, Bouloukakis, Georgios, Magoutis, Kostas, Institut Polytechnique de Paris (IP Paris), Département Informatique (TSP - INF), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Algorithmes, Composants, Modèles Et Services pour l'informatique répartie (ACMES-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Institute of Computer Science [FORTH, Heraklion] (ICS-FORTH), Foundation for Research and Technology - Hellas (FORTH), Middleware on the Move (MIMOVE), Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Computer Science Department [Crete] (CSD-UOC), School of Sciences and Engineering [Crete] (SSE-UOC), and University of Crete [Heraklion] (UOC)-University of Crete [Heraklion] (UOC)

Subjects
Middleware, IoT, Pub/Sub, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO]Computer Science [cs], [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Federation, Smart Communities
Abstract

International audience; This paper presents ComDeX, a context-aware federated architecture and IoT platform for enabling data exchange between IoT enhanced communities. Today, such smart communities are highly heterogeneous and siloed as they can offer IoT applications and services only to their local community inhabitants. ComDeX uses property graphs to represent smart community entities and automatically maps them to context-aware publish/subscribe messages. Such messages can be discovered and exchanged between communities via a hierarchical federated topology and an advertisement-based mechanism. The ComDeX prototype is implemented using well-known IoT technologies such as MQTT and NGSI-LD. ComDeX is evaluated using a realistic smart port scenario and compared against different federation topologies. The experimental results demonstrate that our approach outperforms existing NGSI-LD solutions in realistic IoT scenarios with synthetically generated workloads, with low impact in larger deployments where the number of hops between brokers of the federation increases.

Published
2023

16. DONNA: a data model for enabling extensible and efficient metaverse applications

Author

Bouloukakis, Georgios, Kattepur, Ajay, Institut Polytechnique de Paris (IP Paris), Département Informatique (TSP - INF), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Algorithmes, Composants, Modèles Et Services pour l'informatique répartie (ACMES-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Middleware on the Move (MIMOVE), Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), and Ericsson AI Research [Bangalore]

Subjects
Data Model, Metaverse, Extensibility, Property Graphs, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]
Abstract

International audience; The advent of Metaverse applications, that exploit extended reality technologies, has the potential to disrupt multiple industries including gaming, social networks, entertainment and travel. While there has been initial work on network, compute and synchronization features needed for the Metaverse, a comprehensive data model that captures the interactions between the physical and virtual worlds has not been evaluated extensively. Providing a formal data model would be crucial to ensure interoperability, model extensibility and applicability to multiple use cases. In this paper, we propose DONNA: A Data Model for Enabling Extensible and Efficient Metaverse Applications. DONNA provides a detailed data model of interactions between physical space, virtual spaces, sensors, devices, physical participants and avatars. Via the use of property graph schemas, we demonstrate the varied interactions between the physical and virtual worlds and the extensibility of the approach across multiple use cases. The data model is specifically demonstrated over a virtual museum visit use case to explain the nuances of sensing, dynamic property update and semantic interactions between physical and virtual objects.

Published
2023

17. Toward Run-time Coordination of Reconfiguration Requests in Cloud Computing Systems

Author

Farhat, Salman, Bliudze, Simon, Duchien, Laurence, Kouchnarenko, Olga, University of Lille, Self-adaptation for distributed services and large software systems (SPIRALS), Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS), Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174) (FEMTO-ST), Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Centre National de la Recherche Scientifique (CNRS)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC), ANR-16-IDEX-0004,ULNE,ULNE(2016), ANR-17-EURE-0002,EIPHI,Ingénierie et Innovation par les sciences physiques, les savoir-faire technologiques et l'interdisciplinarité(2017), Self-adaptation for distributed services and large software systems [SPIRALS], and Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174) [FEMTO-ST]

Subjects
Variability Models, Dynamic Reconfiguration, Concurrent Component-based Systems, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Self-Configuration
Abstract

International audience; Cloud applications and cyber-physical systems are becoming increasingly complex, requiring frequent reconfiguration to adapt to changing needs and requirements. Existing approaches compute new valid configurations either at design time, at runtime, or both. However, these approaches can lead to significant computational or validation overheads for each reconfiguration step. We propose a component-based approach that avoids computational and validation overheads using a representation of the set of valid configurations as a variability model. More precisely, our approach leverages feature models to automatically generate, in a component-based formalism called JavaBIP, run-time variability models that respect the feature model constraints. Produced run-time variability models enable control over application reconfiguration by executing reconfiguration requests in such a manner as to ensure the (partial) validity of all reachable configurations. We evaluate our approach on a simple web application deployed on the Heroku cloud platform. Experimental results show that the overheads induced by generated run-time models on systems involving up to 300 features are negligible, demonstrating the practical interest of our approach.

Published
2023

18. PyroBuildS: Enabling Efficient Exploration of Linux Configuration Space with Incremental Build

Author

Randrianaina, Georges Aaron, Khelladi, Djamel Eddine, Zendra, Olivier, Acher, Mathieu, Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Diversity-centric Software Engineering (DiverSe), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Université de Rennes (UR), Centre National de la Recherche Scientifique (CNRS), Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA), Institut Universitaire de France (IUF), and Ministère de l'Education nationale, de l’Enseignement supérieur et de la Recherche (M.E.N.E.S.R.)

Subjects
Highly-configurable Systems, Linux Kernel, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Build System, Incremental Build
Abstract

Software engineers are acutely aware that the build of software is an essential but resource-intensive step in any software development process. This is especially true when building large systems or highly configurable systems whose vast number of configuration options results in a space explosion in the number of versions that should ideally be built and evaluated. Linux is precisely one such large and highly configurable system with thousands of options that can be combined. Previous study showed the benefit of incremental build, however, only on small-sized configurable software systems, unlike Linux. Although incremental compilation for post-commit is used in Linux, we show in this paper that the build of large numbers of random Linux configurations does not benefit from incremental build. Thus, we introduce and detail PyroBuildS, our new approach to efficiently explore, with incremental builds, the very large configuration space of Linux. Very much like fireworks, PyroBuildS starts from several base configurations ("rockets") and generates mutated configurations ("sparks") derived from each of the base ones. This enables exploring the configuration space with an efficient incremental build of the mutants, while keeping a good amount of diversity. We show on a total of 2520 builds that our PyroBuildS approach does trigger synergies with the caching capabilities of Make, hence significantly decreasing builds time with gains up to 85%, while having a diversity of 33% of options and 15 out of 17 subsystems. Overall, individual contributors and continuous integration services can leverage PyroBuildS to efficiently augment their configuration builds, or reduce the cost of building numerous configurations.

Published
2023

19. Polyglot AST: Towards Enabling Polyglot Code Analysis

Author

Houdaille, Philémon, Khelladi, Djamel, Briend, Romain, Jongeling, Robbert, Combemale, Benoit, Université de Rennes (UR), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Diversity-centric Software Engineering (DiverSe), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Centre National de la Recherche Scientifique (CNRS), Ecole Superieure d'Ingenieurs de Rennes [Rennes] (ESIR), and Mälardalen University (MDH)

Subjects
polyglot programming code analysis development tooling, [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], code analysis, [INFO]Computer Science [cs], [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], polyglot programming, development tooling
Abstract

International audience; Today, a plethora of programming languages exists, each better suited for a particular concern. For example, Python is suited for data analysis but not web development, whereas JavaScript is the inverse. As software complexity grows and needs to address multiple concerns, different programming languages are often used in combination, despite the burden of bridging them (e.g., using Java Native Interface). Polyglot programming emerged as a solution allowing the seamless mixing of multiple programming languages. GraalVM and PolyNote are examples of runtimes allowing polyglot programming. However, there is a striking lack of support at design time for building and analyzing polyglot code. To the best of our knowledge, there is no uniform language-agnostic way of reasoning over multiple languages to provide seamless code analysis, since each language comes with its own form of Abstract Syntax Trees (AST). In this paper, we present an approach to build a uniform yet polyglot AST over polyglot code, so that it is easier to perform global analysis. We first motivate this challenge and identify the main requirements for building a polyglot AST. We then propose a proof of concept implementation of our solutions on GraalVM's polyglot API. On top of the polyglot AST, we demonstrate the ability to implement several polyglot-specific analysis services, namely auto-completion, consistency checking, type inference, and rename refactoring. Our evaluation on three polyglot projects taken from GitHub, and involving JavaScript and Python code, shows that we can build a polyglot AST without significant overhead. We also demonstrate the usefulness of the polyglot analysis services through the provided automation, as well as their scalability.

Published
2023

20. Configuration Optimization with Limited Functional Impact

Author

Guégain, E. (Edouard), Taherkordi, A. (Amir), Quinton, C. (Clément), Self-adaptation for distributed services and large software systems (SPIRALS), Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS), University of Oslo (UiO), ANR-19-CE25-0003,Koala,Configurations d'environnements fog large-échelle(2019), Self-adaptation for distributed services and large software systems [SPIRALS], and University of Oslo [UiO]

Subjects
Optimization, Performance, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Variability, Software
Abstract

International audience; Dealing with a large configuration space is a complex task for developers, especially when configurations must comply with both functional constraints and non-functional goals. In this paper, we introduce an approach to optimize any set of performance indicators for an existing configuration, while meeting functional requirements. The efficiency of this approach is assessed by exhaustively optimizing a configurable system, and by analyzing how the algorithm navigates through the configuration space. This approach proves especially efficient at optimizing configurations through a minimal number of changes, thus limiting the impact on their functional behavior.

Published
2023

21. Towards Leveraging Tests to Identify Impacts of Metamodel and Code Co-evolution

Author

Kebaili, Zohra Kaouter, Khelladi, Djamel Eddine, Acher, Mathieu, Barais, Olivier, Diversity-centric Software Engineering (DiverSe), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), and ANR-20-CE25-0003,MC-Evo,MC-Evo²: Co-évolution multidimensionnelle des logiciels en évolution(2020)

Subjects
Model evolution, Model evolution Code co-evolution Unit tests Testing co-evolution, Code co-evolution, [INFO]Computer Science [cs], [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Testing co-evolution, Unit tests
Abstract

International audience; Models play a significant role in Model-Driven Engineering (MDE) and metamodels are commonly transformed into code. Developers intensively rely on the generated code to build language services and tooling, such as editors and views which are also tested to ensure their behavior. The metamodel evolution between releases updates the generated code, and this may impact the developers' additional, client code. Accordingly, the impacted code must be co-evolved too, but there is no guarantee of preserving its behavior correctness. This paper envisions an automatic approach for ensuring code co-evolution correctness. It first aims to trace the tests impacted by the metamodel evolution before and after the code co-evolution, and then compares them to analyze the behavior of the code. Preliminary evaluation on two implementations of OCL and Modisco Eclipse projects. showed that we can successfully traced the impacted tests automatically by selecting 738 and 412 tests, before and after co-evolution respectively, based on 303 metamodel changes. By running these impacted tests, we observed both behaviorally correct and incorrect code co-evolution.

Published
2023

22. An extensible production-level debugger

Author

Vanègue, Adrien, Costiou, Steven, Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS), Analyses and Languages Constructs for Object-Oriented Application Evolution (RMOD), Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS), Reflective Evolution of Ever-running Software Systems (EVREF), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille-Berger-Levrault-Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), and ANR-21-CE25-0004,OCRE,OCRE: Réduire le coût du debugging avec la première génération de debuggers orientés objet(2021)

Subjects
[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]
Abstract

International audience

Published
2023

23. Uncovering the Environmental Impact of Software Life Cycle

Author

Simon, Thibault, Rust, Pierre, Rouvoy, Romain, Penhoat, Joël, Self-adaptation for distributed services and large software systems [SPIRALS], Orange Labs R&D [Rennes], Orange Labs [Lannion], Self-adaptation for distributed services and large software systems (SPIRALS), Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS), France Télécom, and ANR-21-CE25-0022,DISTILLER,Service de recommandation pour des logiciels en ligne plus durables(2021)

Subjects
software life cycle, green software development, software life cycle software environmental impact green software development, software environmental impact, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]
Abstract

International audience; The environmental footprint of a software service development may be impacted by several factors, spanning human factors to infrastructure choices. To the best of our knowledge, the state of the art in the domain of environmental footprint fails i) to address the full spectrum of software services life cycle, from design to operation and maintenance and ii) to cover different categories of impacts. In this paper, we therefore introduce a methodology and the associated model to guide the software development ecosystem and their stakeholders in estimating the environmental footprint of their projects along multiple impact categories. This holistic approach delivers actionable insights to identify potential shifting between phases, such as development and usage, but also hotspots among resources consumed to produce and operate software services. We report on a sample case study that emphasizes the importance of development impact on a software life cycle and shows the relative importance of phases, as well as resources consumed.

Published
2023

24. A Survey on Distributed NFV Multi-Domain Orchestration from an Algorithmic Functional Perspective

Author

Castañeda Cisneros, Josué, Yangui, Sami, Pomares Hernández, Saúl Eduardo, Drira, Khalil, Équipe Services et Architectures pour Réseaux Avancés (LAAS-SARA), Laboratoire d'analyse et d'architecture des systèmes (LAAS), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT), Coordinación de Ciencias Computacionales [INAOE], and Instituto Nacional de Astrofísica, Óptica y Electrónica (INAOE)

Subjects
Close Federations, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Computer Networks and Communications, [INFO.INFO-WB]Computer Science [cs]/Web, Multi-domain Orchestration, [INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET], [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Electrical and Electronic Engineering, Network Function Virtualization, Computer Science Applications
Abstract

International audience; Under the Network Function Virtualization multidomain orchestration approach, many service providers jointly manage the lifecycle of network services composed by Virtual Network Functions (VNFs). Many orchestration algorithms have been published focusing on different tasks for the lifecycle of network services. Nowadays, some general-purpose and architectural orchestration surveys have been published. However, currently, no survey classifies and evaluates distributed multidomain orchestration algorithms. In this paper, we focus on multi-domain orchestration works from an algorithm perspective by considering the cooperative and competitive approaches. Algorithms are classified and evaluated. We propose a taxonomy for works that consider different lifecycle tasks of network services. Classification and evaluation are done by identifying key requirements present in competitive and cooperative scenarios. This allows us to have a perspective on the current state of multi-domain orchestration algorithms. We also identify future research directions based on such a current perspective.

Published
2022

25. Formula Synthesis in Propositional Dynamic Logic with Shuffle

Author

Pinchinat, Sophie, Rubin, Sasha, Schwarzentruber, François, Université de Rennes (UR), Logic and Applications (LogicA), École normale supérieure - Cachan (ENS Cachan)-Université de Rennes (UR)-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), The University of Sydney, Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), and Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)

Subjects
[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], General Medicine
Abstract

We introduce the formula-synthesis problem for Propositional Dynamic Logic with Shuffle (PDL || ). This problem, which generalises the model-checking problem againsts PDL || is the following: given a finite transition system and a regular term-grammar that generates (possibly infinitely many) PDL || formulas, find a formula generated by the grammar that is true in the structure (or return that there is none). We prove that the problem is undecidable in general, but add certain restrictions on the input structure or on the input grammar to yield decidability. In particular, we prove that (1) if the grammar only generates formulas in PDL (without shuffle), then the problem is EXPTIME-complete, and a further restriction to linear grammars is PSPACE-complete, and a further restriction to non-recursive grammars is NP-complete, and (2) if one restricts the input structure to have only simple paths then the problem is in 2-EXPTIME. This work is motivated by and opens up connections to other forms of synthesis from hierarchical descriptions, including HTN problems in Planning and Attack-tree Synthesis problems in Security.

Published
2022

26. Causal reasoning and symbolic relationships in Medieval Illuminations

Author

Djibril Diarra, Martine Clouzot, and Christophe Nicolle

Subjects
symbolic relation, semantic relation, medieval illumination, social network, ontology, [info.info-ai]computer science [cs]/artificial intelligence [cs.ai], [info.info-db]computer science [cs]/databases [cs.db], [info.info-si]computer science [cs]/social and information networks [cs.si], [info.info-se]computer science [cs]/software engineering [cs.se], [info.info-cy]computer science [cs]/computers and society [cs.cy], [info.info-wb]computer science [cs]/web, History of scholarship and learning. The humanities, AZ20-999, Bibliography. Library science. Information resources
Abstract

This work applies knowledge engineering’s techniques to medieval illuminations. Inside it, an illumination is considered as a knowledge graph which was used by some elites in the Middle Ages to represent themselves as a social group and exhibit the events in their lives, and their cultural values. That graph is based on combinations of symbolic elements linked each to others with semantic relations. Those combinations were used to encode visual metaphors and influential messages whose interpretations are sometimes tricky for not experts. Our work aims to describe the meaning of those elements through logical modelling using ontologies. To achieve that, we construct logical reasoning rules and simulate them using artificial intelligence mechanisms. The goal is to facilitate the interpretation of illuminations and provide, in a future evolution of current social media, logical formalisation of new encoding and information transmission services.

Published
2019
Full Text
View/download PDF

27. Une approche holistique pour la migration des systèmes légataires industriels

Author

Bragagnolo, Santiago, Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria), Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS), Université de Lille, Berger-Levrault, Analyses and Languages Constructs for Object-Oriented Application Evolution (RMOD), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS), Reflective Evolution of Ever-running Software Systems (EVREF), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille-Berger-Levrault-Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Universite de Lille, Inria, Stephane Ducasse, and Nicolas Anquetil

Subjects
Transformation du langage, Industriel, Visualisations, Metrics, Industrial, Métriques, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Language Transformation, Software Migration, Software Modernisation, Migration des logiciels legataires, Modernisation des logiciels legataires
Abstract

Context This project takes place in the context of a collaboration with Berger-Levrault, a large software company providing several services and applications developed with different technologies. In a business-critical quest for technological unification, cost reduction, and access to new markets, Berger-Levrault started an extensive program of software modernisation.Problem Berger-Levrault has more than 90 applications written in Microsoft Access. We work on migrating an extensive Microsoft Access application, with nearly 20 years of development, to a web-technology-based solution. As Microsoft Access is a rich language, the project entails the migration of language, library, infrastructure, paradigm, user interface and architecture.Such migration cannot be adequately split into multiple independent, successful migrations, as language migration directly affects all the other migrations. Furthermore, the solutions for each kind of migration vary in knowledge and technological requirements; no single homogenous approach could tackle this kind of migration, which pushes us to think of a higher-order solution.Solution (contribution) This thesis presents (i) A reverse engineering approach can extract models from Microsoft Access. (ii) A migrating meta-model able to represent multiple languages. (iii) A set of migration metrics measuring the technological gap between the source system and the expected target. (iv) Visualisations to gain insight into the required work to make possible an architectural migration. (v) An interactive iterative approach to software migration allowing multiple destinations to migrate. (vi) We provide a rule-based migration engine allowing: partial migrations, based on the immediate and delayed application of contextualised rules, over multiple targets.Validation and results To validate our solutions, we conduct multiple experi- ments yielding encouraging results. (i) We validate our reverse engineering over 10 projects by measuring information loss, proving that we can migrate with the available information. (ii) We validate our modelling approach over 34 projects by representing five technologies and still detect errors in a model of a specific language. (iii-iv) We use metrics and visualisations to help build source code and architectural blueprints and write migration feasibility reports for two large industrial projects. We also use the models and metrics to profile the used libraries to guide the construction of a testing application representing the usage of the libraries based on the Pareto rule. (v-vi) We validated over a full form migration to back-end Java SpringBoot back end and Typescript Angular front-end. Migrating 47 tables and queries to Java and Typescript and 53 library artefacts to Java and Pharo.; Contexte Ce projet se déroule dans le cadre d’une collaboration avec Berger- Levrault, une grande entreprise de logiciels fournissant plusieurs services et ap- plications développés avec différentes technologies. Dans un souci d’unification technologique, de réduction des coûts et d’accès à de nouveaux marchés, Berger-Levrault a lancé un vaste programme de modernisation de ses logiciels.Problème Berger-Levrault possède plus de 90 applications écrites en Microsoft Access. Nous travaillons sur la migration d’une application Microsoft Access étendue, avec près de 20 ans de développement, vers une solution basée sur la technologie web. Comme Microsoft Access est un langage riche, le projet implique la migration du langage, de la bibliothèque, de l’infrastructure, du paradigme, de l’interface utilisateur et de l’architecture.Une telle migration ne peut être divisée en plusieurs migrations indépendantes et réussies, car la migration du langage affecte directement toutes les autres migrations. En outre, les solutions pour chaque type de migration varient en termes de connaissances et d’exigences technologiques ; aucune approche homogène ne pourrait aborder ce type de migration, ce qui nous pousse à réfléchir à une solution d’ordre supérieur.Solution (contribution) Cette thèse présente (i) Une approche de rétro-ingénierie capable d’extraire des modèles de Microsoft Access. (ii) Un méta-modèle de migration capable de représenter plusieurs langages tout en garantissant qu’un modèle est correct pour une technologie concrète. (iii) Un ensemble de mesures de migration mesurant l’écart technologique entre le système source et la cible prévue. (iv) Des visualisations permettant de se faire une idée du travail nécessaire pour rendre possible une migration architecturale. (v) Une approche itérative interactive de la migration logicielle permettant de migrer vers plusieurs destinations. (vi) Nous fournissons un moteur de migration basé sur des règles permettant : des migrations partielles, basées sur l’application immédiate et différée de règles contextualisées, sur des cibles multiples.Validation et résultats Pour valider nos solutions, nous menons plusieurs expériences qui donnent des résultats encourageants. (i) Nous validons notre rétro- ingénierie sur 10 projets en mesurant la perte d’information, prouvant que nous pouvons effectuer une migration avec les informations disponibles. (ii) Nous vali- dons notre approche de modélisation sur 34 projets en représentant cinq technolo- gies, et détectons encore des erreurs dans un modèle d’un langage spécifique. (iii- iv) Nous utilisons les métriques et les visualisations pour aider à construire le code source et les plans d’architecture et rédiger les rapports de faisabilité de la migra- tion pour deux grands projets industriels. Nous utilisons également les modèles et les métriques pour profiler les bibliothèques utilisées afin de guider la construction d’une application de test représentant l’utilisation des bibliothèques sur la base de la règle de Pareto. (v-vi) Nous avons validé la migration d’un formulaire complet vers un back-end Java SpringBoot et un front-end Angular Typescript. Migration de 47 tables et requêtes vers Java et Typescript et de 53 artefacts de bibliothèque vers Java et Pharo.

Published
2023

28. Run-time Coordination of Reconfiguration Requests in Cloud Computing Systems

Author

Farhat, Salman, Bliudze, Simon, Duchien, Laurence, Kouchnarenko, Olga, Self-adaptation for distributed services and large software systems (SPIRALS), Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS), Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174) (FEMTO-ST), Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Centre National de la Recherche Scientifique (CNRS)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC), Inria, ANR-16-IDEX-0004,ULNE,ULNE(2016), and ANR-17-EURE-0002,EIPHI,Ingénierie et Innovation par les sciences physiques, les savoir-faire technologiques et l'interdisciplinarité(2017)

Subjects
reconfiguration dynamique, Variability Models, modèles de variabilité, Dynamic Reconfiguration, Concurrent Component-based Systems, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Systèmes à base de composants concurrents, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Self-Configuration, auto-configuration
Abstract

Cloud applications and cyber-physical systems are becoming increasingly complex, requiring frequent reconfiguration to adapt to changing needs and requirements. Existing approaches compute new valid configurations either at design time, at runtime, or both. However, these approaches can lead to significant computational or validation overheads for each reconfiguration step. We propose a component-based approach that avoids computational and validation overheads using a representation of the set of valid configurations as a variability model. More precisely, our approach leverages feature models to automatically generate, in a component-based formalism called JavaBIP, run-time variability models that respect the feature model constraints. Produced run-time variability models enable control over application reconfiguration by executing reconfiguration requests in such a manner as to ensure the (partial) validity of all reachable configurations. We evaluate our approach on a simple web application deployed on the Heroku cloud platform. Experimental results show that the overheads induced by generated run-time models on systems involving up to 300 features are negligible, demonstrating the practical interest of our approach.; Les applications en nuage et les systèmes cyber-physiques deviennent de plus en plus complexes, nécessitant une reconfiguration fréquente pour s'adapter à l'évolution des besoins et des exigences. Les approches existantes calculent de nouvelles configurations valides lors de la conception du système, au moment de son exécution ou les deux. Cependant, ces approches peuvent entraîner des surcharges de calcul ou de validation importantes pour chaque étape de reconfiguration. Nous proposons une approche fondée sur un modèle à composants pour éviter les surcharges de calcul et de validation en utilisant une représentation de l'ensemble des configurations valides pour un système grâce aux modèles de variabilité. Plus précisément, notre approche exploite les modèles dits "feature models" pour générer automatiquement des modèles de variabilité dans un formalisme à composants, JavaBIP, qui respectent les mêmes contraintes. Ces modèles de variabilité permettent de contrôler la réconfiguration de l'application en temps d'exécution en exécutant les demandes de reconfiguration de manière à assurer la validité (partielle) de toutes les configurations atteignables. Afin d'évaluer l'intérêt de notre approche, nous l'avons expérimentée sur une application Web déployé sur la plateforme en nuage Heroku. Les surcharges induites par les modèles générés sur des systèmes comportant jusqu'à 300 features s'avèrent négligeables.

Published
2023

29. JavaBIP meets VerCors:Towards the Safety of Concurrent Software Systems in Java

Author

Bliudze, Simon, Bos, Petra van den, Huisman, Marieke, Rubbens, Robert, Safina, Larisa, Lambers, Leen, Uchitel, Sebastián, Self-adaptation for distributed services and large software systems [SPIRALS], Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL], Formal Methods and Tools [FMT group], Analyses and Languages Constructs for Object-Oriented Application Evolution [RMOD], Formal Methods and Tools, Digital Society Institute, Self-adaptation for distributed services and large software systems (SPIRALS), Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS), Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS), Formal Methods and Tools (FMT group), University of Twente, Analyses and Languages Constructs for Object-Oriented Application Evolution (RMOD), ANR-16-IDEX-0004,ULNE,ULNE(2016), ANR-21-CE48-0011,NARCO,Compositions Non-agrégatives de Resources(2021), and Bliudze, Simon

Subjects
[INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], [INFO.INFO-SE] Computer Science [cs]/Software Engineering [cs.SE], [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], [INFO.INFO-PL] Computer Science [cs]/Programming Languages [cs.PL]
Abstract

We present “Verified JavaBIP”, a tool set for the verification of JavaBIP models. A JavaBIP model is a Java program where classes are considered as components, their behaviour described by finite state machine and synchronization annotations. While JavaBIP guarantees execution progresses according to the indicated state machines, it does not guarantee properties of the data exchanged between components. It also does not provide verification support to check whether the behaviour of the resulting concurrent program is as (safe as) expected. This paper addresses this by extending the JavaBIP engine with run-time verification support, and by extending the program verifier VerCors to verify JavaBIP models deductively. These two techniques complement each other: feedback from run-time verification allows quicker prototyping of contracts, and deductive verification can reduce the overhead of run-time verification. We demonstrate our approach on the “Solidity Casino” case study, known from the VerifyThis Collaborative Long Term Challenge.

Published
2023

30. Fonctions d'utilisabilité dans les studios de conception de langages dédiés graphiques

Author

Giraudet, Théo, David, Pierre-Charles, Obeo [Carquefou], Université de Rennes (UR), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Diversity-centric Software Engineering (DiverSe), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), and Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique)

Subjects
[INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]
Abstract

National audience

Published
2023

31. Verifying Collision Risk Estimation using Autonomous Driving Scenarios Derived from a Formal Model

Author

Horel, Jean-Baptiste, Ledent, Philippe, Marsso, Lina, Muller, Lucie, Laugier, Christian, Mateescu, Radu, Paigwar, Anshul, Renzaglia, Alessandro, Serwe, Wendelin, Robots coopératifs et adaptés à la présence humaine en environnements (CHROMA), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-CITI Centre of Innovation in Telecommunications and Integration of services (CITI), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Inria Lyon, Institut National de Recherche en Informatique et en Automatique (Inria), Construction of verified concurrent systems (CONVECS ), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique de Grenoble (LIG), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA), Department of Computer Science [University of Toronto] (DCS), University of Toronto, PRISSMA project of French Grand Défi on Trustworthy AI for Industry, and European Project: 877539,H2020-EU.2.1.1. - INDUSTRIAL LEADERSHIP - Leadership in enabling and industrial technologies - Information and Communication Technologies (ICT),ArchitectECA2030(2020)

Subjects
Model checking, CADP, Mechanical Engineering, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Model-based testing, Industrial and Manufacturing Engineering, CMCDOT, Artificial Intelligence, Control and Systems Engineering, Behavior tree, [INFO.INFO-RB]Computer Science [cs]/Robotics [cs.RO], Electrical and Electronic Engineering, Quantitative analysis, CARLA, Software
Abstract

International audience; Verifying Collision Risk Estimation using Formally Derived Scenarios use formal conformance test generation tools to derive, from a verified formal model, sets of scenarios to be run in a simulator. Second, we model check the traces of the simulation runs to validate the probabilistic estimation of collision risks. Using formal methods brings the combined advantages of an increased confidence in the correct representation of the chosen configuration (temporal logic verification), a guarantee of the coverage and relevance of automatically generated scenarios (conformance testing), and an automatic quantitative analysis of the test execution (verification and statistical analysis on traces).

Published
2023

32. Specialization of Run-time Configuration Space at Compile-time: An Exploratory Study

Author

Tërnava, Xhevahire, Acher, Mathieu, Combemale, Benoit, Diversity-centric Software Engineering (DiverSe), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), and Tërnava, Xhevahire

Subjects
Software Engineering (cs.SE), FOS: Computer and information sciences, Computer Science - Software Engineering, software debloating, [INFO.INFO-SE] Computer Science [cs]/Software Engineering [cs.SE], [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], program specialization, performance, unused variability
Abstract

Numerous software systems are highly configurable through run-time options, such as command-line parameters. Users can tune some of the options to meet various functional and non-functional requirements such as footprint, security, or execution time. However, some options are never set for a given system instance, and their values remain the same whatever the use cases of the system. Herein, we design a controlled experiment in which the system's run-time configuration space can be specialized at compile-time and combinations of options can be removed on demand. We perform an in-depth study of the well-known x264 video encoder and quantify the effects of its specialization to its non-functional properties, namely on binary size, attack surface, and performance while ensuring its validity. Our exploratory study suggests that the configurable specialization of a system has statistically significant benefits on most of its analysed non-functional properties, which benefits depend on the number of the debloated options. While our empirical results and insights show the importance of removing code related to unused run-time options to improve software systems, an open challenge is to further automate the specialization process., Comment: 14 pages, 3 Figures (not counted the subfigures), 5 Tables, and 1 Algorithm

Published
2023

33. Deriving metrics for software architectures from the 'protected entry points' security patterns

Author

Buitrago, Monica, Borne, Isabelle, Buisson, Jeremy, Advanced Technologies for Operated Networks (ARCHWARE), LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Université de Bretagne Sud (UBS), Centre de Recherche de l'École de l'air (CReA), Armée de l'air et de l'espace, Centre de Recherche des Ecoles de St-Cyr Coëtquidan (CREC), and Ecoles de St-Cyr Coëtquidan

Subjects
Security by design, Software architecture, Case study, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Security metrics, Security patterns
Abstract

International audience; Deciding, as early as the software architecture is designed, whether the resulting system will be secure is challenging. We propose three metrics inspired by a security-related design pattern in the structural architecture model, the "protected entry points" pattern. We evaluate these metrics on the real-life Bitwarden web client and server, as well as a synthetic system.

Published
2023

34. The ICO Tool Suite: Optimizing Highly Configurable Systems

Author

Guégain, Edouard, Taherkordi, Amirhosein, Quinton, Clément, Self-adaptation for distributed services and large software systems (SPIRALS), Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), and Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)

Subjects
tools software variability optimization performance, software, variability, tools, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], optimization, performance
Abstract

Dealing with large configuration spaces is a complex task for developers, especially when manually searching for the configuration that best suits some given requirements. In this paper, we present the ICO tool suite, a set of software components designed to help developers optimize their configuration w.r.t a set of performance indicators. This tool suite can be used through a command-line client or an Eclipse plugin, while the loose coupling with its core library make it flexible-enough to be integrated into existing tools. ICO is assessed by evaluating the time it saves to users over a manual optimization.

Published
2023

35. Analyse de code en boîte noire pour la rétro ingénierie via acquisition de contraintes et synthèse de code

Author

Menguy, Grégoire, Département Ingénierie Logiciels et Systèmes (DILS), Laboratoire d'Intégration des Systèmes et des Technologies (LIST (CEA)), Direction de Recherche Technologique (CEA) (DRT (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Direction de Recherche Technologique (CEA) (DRT (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay, Université Paris-Saclay, Julien Signoles, Sébastien Bardin, and Nadjib Lazaar

Subjects
[INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Contract inférence, Inférence de contrats, Constraint acquisition, Machine learning, Code understanding, Compréhension de code, Acquisition de contraintes, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Program synthesis, Apprentissage, Synthèse de code, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
Abstract

Software always becomes larger and more complex, making crucial tasks like code testing, verification, or code understanding highly difficult for humans. Hence the need for methods to reason about code automatically. These are usually white-box, and use the code syntax to deduce its properties. While they have proven very powerful, they also show limitations: they need the source code, the code size and the data structures' complexity degrade their efficiency, they are highly impacted by syntactic code complexity amplified by optimizations obfuscations. This thesis explores how black-box code analysis can infer valuable properties for reverse engineering through data-driven learning. First, we consider the function contracts inference problem, which aims to infer over which inputs a code function can be executed to get good behaviors only. We extend the constraint acquisition learning framework, notably solving one of its major flaws: the dependency on a human user. It leads to PreCA, the first black-box approach enjoying clear theoretical guarantees. It makes PreCA especially suitable for development uses. Second, we consider the deobfuscation problem, which aims to simplify obfuscated code. Our proposal, Xyntia, synthesizes code block semantics through S-metaheuristics to offer an understandable version of the code. Xyntia significantly improves the state-of-the-art in terms of robustness and speed. In addition, we propose the two first protections efficient against black-box deobfuscation.; Les logiciels sont de plus en plus grands et complexes. Ainsi, certaines tâches comme le test et la vérification de code, ou la compréhension de code, sont de plus en plus difficiles à réaliser pour un humain. D'où la nécessité de développer des méthodes d'analyse automatique. Celles-ci sont usuellement en boîte blanche, utilisant la syntaxe du code pour déduire ses propriétés. Elles sont très efficaces mais présentent certaines limitations: le code source est nécessaire, la taille et la complexité syntaxique du code (accentuée par des optimisations et de l'obfuscation) impactent leur efficacité. Cette thèse explore comment les méthodes en boîte noire peuvent inférer des propriétés utiles pour la rétro-ingénierie. Nous étudions, tout d'abord, l'inférence de contrat de fonction qui tente d'apprendre sur quelles entrées une fonction peut être exécutée pour obtenir les sorties souhaitées. Nous adaptons l'acquisition de contraintes, en résolvant une de ses principales limitations: la dépendance à un être humain. En ressort PreCA, la première approche totalement boîte noire offrant des garanties claires de correction. PreCA est ainsi particulièrement approprié pour l'aide au développement. Nous étudions ensuite la déobfuscation, qui vise à simplifier du code obfusqué. Nous proposons Xyntia qui synthétise, via des S-métaheuristiques, une version compréhensible de blocs de code. Xyntia est plus rapide et robuste que l'état de l'art. De plus, nous proposons les deux premières protections contre la déobfuscation en boîte noire.

Published
2023

36. Verification of Inference Observability in Supervisory Control of Discrete-Event Systems

Author

Sharpe, C, Ricker, Laurie, Marchand, Hervé, Department of Mathematics and Computer Science [Mount Allison University], Mount Allison University, Logic and applications (LOGICA), LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Inria Rennes – Bretagne Atlantique, and Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]
Abstract

We present a new algorithm to verify inference observability in supervisory control of decentralized discreteevent systems. The algorithm's success relies on the following idea. An inferencing solution exists only when a language does not contain any inferencing cycles.

Published
2023

37. The teaching of computer ethics on computer science and related degree programmes. a European survey

Author

Andrea Curley, Gordana Dodig-Crnkovic, Brendan Tierney, Stephane Maag, Anna Becevel, Svetlana Tikhonenko, Damian Gordon, Francesco Agresta, J.Paul Gibson, Michael Collins, Ioannis Stavrakakis, Dympna O'Sullivan, Emma Murphy, Cristina Pereira, Viola Schiaffonati, Radu Dobrin, Technological University [Dublin] (TU), Chalmers University of Technology [Gothenburg, Sweden], Mälardalen University (MDH), Department of Electronics, Information, and Bioengineering [Milano] (DEIB), Politecnico di Milano [Milan] (POLIMI), Informatics Europe, Méthodes et modèles pour les réseaux (METHODES-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Département Informatique (INF), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Institut Polytechnique de Paris (IP Paris), Département Réseaux et Services Multimédia Mobiles (RS2M), and European Digital Learning Network (DLEARN )

Subjects
Computer ethics, media_common.quotation_subject, Computer Science Education, 02 engineering and technology, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Teaching Computer Ethics, [INFO.INFO-CY]Computer Science [cs]/Computers and Society [cs.CY], [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], 020204 information systems, Agency (sociology), 0202 electrical engineering, electronic engineering, information engineering, Institution, ComputingMilieux_COMPUTERSANDEDUCATION, [INFO]Computer Science [cs], Curriculum, Pace, media_common, Ethics, ComputingMilieux_THECOMPUTINGPROFESSION, business.industry, 4. Education, 05 social sciences, 050301 education, Information technology, Computer Ethics, Engineering ethics, [INFO.EIAH]Computer Science [cs]/Technology for Human Learning, business, 0503 education, Personally identifiable information, Range (computer programming)
Abstract

Within the Computer Science community, many ethical issues have emerged as significant and critical concerns. Computer ethics is an academic field in its own right and there are unique ethical issues associated with information technology. It encompasses a range of issues and concerns including privacy and agency around personal information, Artificial Intelligence and pervasive technology, the Internet of Things and surveillance applications. As computing technology impacts society at an ever growing pace, there are growing calls for more computer ethics content to be included in Computer Science curricula. In this paper we present the results of a survey that polled faculty from Computer Science and related disciplines about teaching practices for computer ethics at their institutions. The survey was completed by respondents from 61 universities across 23 European countries. Participants were surveyed on whether or not computer ethics is taught to Computer Science students at each institution, the reasons why computer ethics is or is not taught, how computer ethics is taught, the background of staff who teach computer ethics and the scope of computer ethics curricula. This paper presents and discusses the results of the survey.

Published
2022

38. Facilitating the migration to the microservice architecture via model-driven reverse engineering and reinforcement learning

Author

MohammadHadi Dehghani, Shekoufeh Kolahdouz-Rahimi, Massimo Tisi, Dalila Tamzalit, Isfahan University of Technology, Département Automatique, Productique et Informatique (IMT Atlantique - DAPI), IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), NaoMod - Nantes Software Modeling Group (LS2N - équipe NaoMod), Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Nantes Université (Nantes Univ), and University of Isfahan

Subjects
[INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], Modeling and Simulation, Reinforcement learning, Model-driven reverse engineering, [INFO]Computer Science [cs], [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Microservice architecture, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, Migration, Software
Abstract

International audience; The microservice architecture has gained remarkable attention in recent years. Microservices allow developers to implement and deploy independent services, so they are a naturally effective architecture for continuously deployed systems. Because of this, several organizations are undertaking the costly process of manually migrating their traditional software architectures to microservices. The research in this paper aims at facilitating the migration from monolithic software architectures to microservices. We propose a framework which enables software developers/architects to migrate their software systems more efficiently by helping them remodularize the source code of their systems. The framework leverages model-driven reverse engineering to obtain a model of the legacy system, and reinforcement learning to propose a mapping of this model towards a set of microservices.

Published
2022

39. Low-code development and model-driven engineering: Two sides of the same coin?

Author

Davide Di Ruscio, Dimitris Kolovos, Juan de Lara, Alfonso Pierantonio, Massimo Tisi, Manuel Wimmer, University of L'Aquila [Italy] (UNIVAQ), University of York [York, UK], Universidad Autónoma de Madrid (UAM), Department of Information Engineering, Computer Science and Mathematics = Dipartimento di Ingegneria e Scienze dell'Informazione e Matematica [L'Aquila] (DISIM), Università degli Studi dell'Aquila = University of L'Aquila (UNIVAQ), Département Automatique, Productique et Informatique (IMT Atlantique - DAPI), IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), NaoMod - Nantes Software Modeling Group (LS2N - équipe NaoMod), Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Nantes Université (Nantes Univ), and Johannes Kepler University Linz [Linz] (JKU)

Subjects
[INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], Modeling and Simulation, Low-code development, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Model-driven engineering, No-code development, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, Software
Abstract

The last few years have witnessed a significant growth of so-called low-code development platforms (LCDPs) both in gaining traction on the market and attracting interest from academia. LCDPs are advertised as visual development platforms, typically running on the cloud, reducing the need for manual coding and also targeting non-professional programmers. Since LCDPs share many of the goals and features of model-driven engineering approaches, it is a common point of debate whether low-code is just a new buzzword for model-driven technologies, or whether the two terms refer to genuinely distinct approaches. To contribute to this discussion, in this expert-voice paper, we compare and contrast low-code and model-driven approaches, identifying their differences and commonalities, analysing their strong and weak points, and proposing directions for cross-pollination.

Published
2022

40. Separation of Concerns in an Edge-Based Compartmental Modeling Framework

Author

Guifo Fodjo, A Yvan, Lacmou Zeutouo, Jerry, Bowong, Samuel, Modélisation et Vérification (MoVe), LIP6, Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), Algorithms and Software Architectures for Distributed and HPC Platforms (AVALON), Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Lyon, Institut National de Recherche en Informatique et en Automatique (Inria), Unité de modélisation mathématique et informatique des systèmes complexes [Bondy] (UMMISCO), and Université de Yaoundé I-Institut de la francophonie pour l'informatique-Université Cheikh Anta Diop [Dakar, Sénégal] (UCAD)-Université Gaston Bergé (Saint-Louis, Sénégal)-Université Cadi Ayyad [Marrakech] (UCA)-Sorbonne Université (SU)-Institut de Recherche pour le Développement (IRD [France-Nord])

Subjects
Separation of concerns, Epidemiology modeling tool, [SDV]Life Sciences [q-bio], Edge-based compartmental network, [INFO]Computer Science [cs], [SDV.SPEE]Life Sciences [q-bio]/Santé publique et épidémiologie, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Compartmental models, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, Contact network
Abstract

International audience; A well-known framework with strong potential for epidemic prediction and the ability to incorporate realistic contact structures is edge-based compartmental modeling (EBCM). However, models built from this framework lead to a multiplication of ordinary differential equations and many parameters to be estimated, which make the models complex and difficult to extend or to reuse. The Kendrick approach has shown promising results in generalizing compartmental models to take into account aspects of contact networks while preserving the separation of concerns, thus allowing to define modular, extensible and reusable models. But this generalization of compartmental models to contact network aspects is still limited to a few contact networks. In this paper, we present an attempt to extend Kendrick's approach from an approximation of EBCM models to further support aspects of contact networks, thereby improving the predictive quality of models with significant heterogeneity in contact structure, while maintaining the simplicity of compartmental models. This extension consists of an integration of the basic reproductive number R 0 into the compartmental SIR framework. This attempted is validated using Miller's mass action and the approximation of EBCM configuration model.

Published
2023

41. Rapport d'activités Guix-HPC 2021–2022

Author

Acary-Robert, Céline, Courtès, Ludovic, Dupont, Yann, Felšöci, Marek, Hinsen, Konrad, Lünsdorf, Ontje, Prins, Pjotr, Swartvagher, Philippe, Tournier, Simon, Wurmus, Ricardo, Grenoble Alpes Recherche-Infrastructure de CAlcul intensif et de Données (GRICAD), Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA), Service Expérimentation et Développement [Bordeaux] (SED), Inria Bordeaux - Sud-Ouest, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Nantes Université (Nantes Univ), COmposabilité Numerique and parallèle pour le CAlcul haute performanCE (CONCACE), Centre Européen de Recherche et de Formation Avancée en Calcul Scientifique (CERFACS)-Airbus [France]-Inria Bordeaux - Sud-Ouest, Synchrotron SOLEIL (SSOLEIL), Centre National de la Recherche Scientifique (CNRS), Max Delbrück Center for Molecular Medicine [Berlin] (MDC), Helmholtz-Gemeinschaft = Helmholtz Association, The University of Tennessee Health Science Center [Memphis] (UTHSC), Topology-Aware System-Scale Data Management for High-Performance Computing (TADAAM), Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS)-Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS)-Inria Bordeaux - Sud-Ouest, Université Paris Cité (UPCité), Inria, Max Delbrück Center for Molecular Medicine, and Utrecht Bioinformatics Center

Subjects
Open Science, HPC, [INFO]Computer Science [cs], Software Deployment, [INFO.INFO-OS]Computer Science [cs]/Operating Systems [cs.OS], [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Reproducibility
Abstract

Guix-HPC is a collaborative effort to bring reproducible software deployment to scientific workflows and high-performance computing (HPC). Guix-HPC builds upon the GNU Guix software deployment tool and aims to make it a better tool for HPC practitioners and scientists concerned with reproducible research.This report highlights key achievements of Guix-HPC between our previous report a year ago and today, February 2023, including: developments in Guix and related tools such as the Guix Workflow Language, use cases of Guix in support of reproducible research and open science, and the celebration of ten years of Guix with a three-day conference.; Guix-HPC est un travail collaboratif pour donner les moyens du déploiement logiciel reproductible aux travaux scientifiques et au calcul intensif (HPC). Guix-HPC repose sur l'outil de déploiement logiciel GNU Guix et a pour ambition d’en faire un meilleur outil pour le calcul intensif et pour les scientifiques souhaitant faire des travaux de recherche reproductibles.Ce rapport souligne les réalisations clef de Guix-HPC depuis le précédent rapport, un an auparavant, et aujourd’hui, février 2023, avec notamment : les développements dans Guix et les outils qui lui sont liés, comme le Guix Workflow Language (GWL), les cas d’usage de Guix comme support à la recherche reproductible et à la science ouverte, et enfin la célébration de dix ans de Guix avec un colloque de trois jours.

Published
2023

42. SFTM: Fast Matching of Web Pages using Similarity-based Flexible Tree Matching

Author

Sacha Brisset, Romain Rouvoy, Lionel Seinturier, Renaud Pawlak, Self-adaptation for distributed services and large software systems (SPIRALS), Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS), and Cinchéo

Subjects
Hardware and Architecture, [INFO.INFO-WB]Computer Science [cs]/Web, Tree matching, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Information Extraction, Software, Web, Information Systems
Abstract

International audience; Tree matching techniques have been investigated in many fields, including web data mining and extraction, as a key component to analyze the content of web pages. However, when applied to existing web pages, traditional tree matching approaches, covered by algorithms like Tree-Edit Distance (TED) or XyDiff, either fail to scale beyond a few hundred nodes or exhibit a relatively low accuracy. In this article, we therefore propose a novel algorithm, named Similaritybased Flexible Tree Matching (SFTM), which enables high accuracy tree matching on real-life web pages, with practical computation times. We approach tree matching as an optimisation problem and leverage node labels and local topology similarity in order to avoid any combinatorial explosion. Our practical evaluation demonstrates that SFTM significantly improves the state of the art in terms of accuracy, while allowing computation times significantly lower than the most accurate solutions. By gaining on these two dimensions, SFTM therefore offers an affordable solution to match complex trees in practice.

Published
2023

43. Formal domain-driven system development in Event-B: Application to interactive critical systems

Author

Ismail Mendil, Yamine Aït-Ameur, Neeraj Kumar Singh, Guillaume Dupont, Dominique Méry, Philippe Palanque, Assistance à la Certification d’Applications DIstribuées et Embarquées (IRIT-ACADIE), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), Modeling and Verification of Distributed Algorithms and Systems (VERIDIS), Max-Planck-Institut für Informatik (MPII), Max-Planck-Gesellschaft-Max-Planck-Gesellschaft-Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Formal Methods (LORIA - FM), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), TELECOM Nancy, Université de Lorraine (UL), Proof-oriented development of computer-based systems (MOSEL), Department of Formal Methods (LORIA - FM), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Interactive Critical Systems (IRIT-ICS), ANR-16-CE25-0007,FORMEDICIS,Méthodes formelles pour le développement et l'ingénierie de systèmes interactifs critiques(2016), and ANR-19-CE25-0010,EBRP-EventB-Rodin-Plus,Enrichissement de EventB et de RODIN : EventB-Rodin-Plus(2019)

Subjects
TCAS, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], Hardware and Architecture, Ontology, Refinement and proofs, Formal methods, Domain knowledge, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], Event-B, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Interactive system, Software
Abstract

International audience; The design of complex and/or critical systems requires handling the environment constraints in which these systems evolve. Formal methods allow system developers to design models of such systems. They provide constructs for modelling components and views of these systems. However, these formal methods do not include built-in constructs for modelling the environment, and more broadly, domain knowledge associated with system models. Although ontologies have demonstrated their efficiency in modelling domain-specific features, they are not available as built-in constructs in formal methods.This paper shows how formal ontologies can be used to model domain-specific knowledge, as well as how system models may refer to these ontologies through annotation. We rely on the Event-B refinement and proof state-based method, and the associated theories, to define a framework in which domain-specific knowledge ontologies are formalised as Event-B theories defining data types used to type Event-B system design models. Finally, this framework is deployed for the specific case of interactive critical systems. To illustrate the proposed approach, a case study of the Traffic Collision Avoidance System (TCAS) is developed.

Published
2023

44. Good-for-Game QPTL: An Alternating Hodges Semantics

Author

Massimo Benerecetti, Dylan Bellier, Fabio Mogavero, Dario Della Monica, Logic and applications (LOGICA), LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Department of Electrical Engineering and Information Technologies, University of Naples Federico II, University of Naples Federico II = Università degli studi di Napoli Federico II, and Università degli Studi di Udine, Italy

Subjects
FOS: Computer and information sciences, Computer Science - Logic in Computer Science, behavioral quantifications, compositional and game-theoretical semantics, good-for-game logics, Quantified Propositional Temporal Logic, reactive synthesis, realizability, satisfiability and model-checking, Strategic Reasoning, General Computer Science, Logic, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Computational Complexity (cs.CC), Logic in Computer Science (cs.LO), Theoretical Computer Science, Computer Science - Computational Complexity, Computational Mathematics
Abstract

An extension of QPTL is considered where functional dependencies among the quantified variables can be restricted in such a way that their current values are independent of the future values of the other variables. This restriction is tightly connected to the notion of behavioral strategies in game-theory and allows the resulting logic to naturally express game-theoretic concepts. Inspired by the work on logics of dependence and independence, we provide a new compositional semantics for QPTL that allows for expressing such functional dependencies among variables. The fragment where only restricted quantifications are considered, called behavioral quantifications , allows for linear-time properties that are satisfiable if and only if they are realisable in the Pnueli-Rosner sense. This fragment can be decided, for both model checking and satisfiability , in 2 Exp Time and is expressively equivalent to QPTL , though significantly less succinct.

Published
2023

45. A Call for Removing Variability

Author

Mathieu Acher, Luc Lesoil, Georges Aaron Randrianaina, Xhevahire Tërnava, Olivier Zendra, Diversity-centric Software Engineering (DiverSe), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), and Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)

Subjects
software variability, removing variability, software bloat, [INFO]Computer Science [cs], [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]
Abstract

International audience; Software variability is largely accepted and explored in software engineering and seems to have become a norm and a must, if only in the context of product lines. Yet, the removal of superfluous or unneeded software artefacts and functionalities is an inevitable trend. It is frequently investigated in relation to software bloat. This paper is essentially a call to the community on software variability to devise methods and tools that will facilitate the removal of unneeded variability from software systems. The advantages are expected to be numerous in terms of functional and non-functional properties, such as maintainability (lower complexity), security (smaller attack surface), reliability, and performance (smaller binaries).

Published
2023

46. Explicit or Implicit? On Feature Engineering for ML-based Variability-intensive Systems

Author

Paul Temple, Gilles Perrouin, and Université de Rennes (UR)

Subjects
software variability, machine learning, feature machine learning software variability, [INFO]Computer Science [cs], feature, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
Abstract

International audience; Software variability engineering benefits from Machine Learning (ML) to learn e.g., variability-aware performance models, explore variants of interest and minimize their energy impact. As the number of applications of combining variability with ML grows, we would like to reflect on what is the core to the configuration process in software variability and inference in ML: feature engineering. These disciplines previously managed features explicitly, easing graceful combinations. Now, deep learning techniques derive automatically obscure but efficient features from data. Shall we give up explicit feature management in variability-intensive systems to embrace machine learning advances?

Published
2023

47. Compositional Verification of Stigmergic Collective Systems

Author

Di Stefano, Luca, Lang, Frederic, Construction of verified concurrent systems (CONVECS ), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique de Grenoble (LIG), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA), and University of Gothenburg (GU)

Subjects
[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]
Abstract

International audience; Collective adaptive systems may be broadly defined as ensembles of autonomous agents, whose interaction may lead to the emergence of global features and patterns. Formal verification may provide strong guarantees about the emergence of these features, but may suffer from scalability issues caused by state space explosion. Compositional verification techniques, whereby the state space of a system is generated by combining (an abstraction of) those of its components, have shown to be a promising countermeasure to the state space explosion problem. Therefore, in this work we apply these techniques to the problem of verifying collective adaptive systems with stigmergic interaction. Specifically, we automatically encode these systems into networks of LNT processes, apply a static value analysis to prune the state space of individual agents, and then reuse compositional verification procedures provided by the CADP toolbox. We demonstrate the effectiveness of our approach by verifying a collection of representative systems. ⋆ Work partially funded by ERC consolidator grant no. 772459 D-SynMA (Distributed Synthesis: from Single to Multiple Agents).

Published
2023

48. BURST: Benchmarking Uniform Random Sampling Techniques

Author

Mathieu Acher, Gilles Perrouin, Maxime Cordy, Diversity-centric Software Engineering (DiverSe), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA), Institut Universitaire de France (IUF), Ministère de l'Education nationale, de l’Enseignement supérieur et de la Recherche (M.E.N.E.S.R.), Université de Namur [Namur] (UNamur), Security, Reliability and Trust Interdisciplibary Research Centre (S'nT), and Université du Luxembourg (Uni.lu)

Subjects
variability model, sampling, benchmark, software product lines, configurable systems, SAT, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Software, feature model, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
Abstract

International audience; BURST is a benchmarking platform for uniform random sampling (URS) techniques. Given: i) the description of a sampling space provided as a Boolean formula (DIMACS), and ii) a sampling budget (time and strength of uniformity), BURST evaluates ten samplers for scalability and uniformity. BURST measures scalability based on the time required to produce a sample, and uniformity based on the state-of-the-art and proven statistical test Barbarik. BURST is easily extendable to new samplers and offers: i) 128 feature models (for highly-configurable systems), ii) many other models mined from the artificial intelligence/satisfiability solving benchmarks. BURST envisions supporting URS assessment and design across multiple research communities.

Published
2023

49. A formal toolchain for offline and run-time verification of robotic systems

Author

Silvano Dal Zilio, Pierre-Emmanuel Hladik, Félix Ingrand, Anthony Mallet, Équipe Verification de Systèmes Temporisés Critiques (LAAS-VERTICS), Laboratoire d'analyse et d'architecture des systèmes (LAAS), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ), Équipe Robotique et InteractionS (LAAS-RIS), Service Informatique : Développement, Exploitation et Assistance (LAAS-IDEA), ANR-19-P3IA-0004,ANITI,Artificial and Natural Intelligence Toulouse Institute(2019), and European Project: 101016442,AIPlan4EU

Subjects
[INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], Control and Systems Engineering, General Mathematics, runtime verification, UAV controller, [INFO.INFO-RB]Computer Science [cs]/Robotics [cs.RO], [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], formal verification, Software, model checking, Computer Science Applications, robotic software engineering
Abstract

International audience; Validation and Verification (V&V) of autonomous robotic system software is becoming a critical issue. Among the V&V techniques at our disposal, formal approaches are among the most rigorous and trustworthy ones. Yet, the level of skills and knowledge required to use and deploy formal methods is usually quite high and rare. In this paper, we describe an approach that starts from a regular, but rigorous, framework to specify and deploy robotic software components, which can also automatically synthesize a formal model of these components.We describe how we can execute the resulting formal model, in place of a traditional imple- mentation, and show how this provides the opportunity to add powerful monitoring and runtime verification capabilities to a system, e.g., to prevent collisions, or trigger an emergency landing. Since the runtime used to execute formal models is specifically designed to be faithful to their se- mantics, every execution (in the implementation) can be mapped to a trace in the specification. As a result, we can also prove many interesting properties offline, using model-checking techniques. We give several examples, such as properties about schedulability, worst-case traversal time, or mutual exclusion.We believe that having a consistent workflow, from an initial specification of our system, down to a formal, executable specification is a major advance in robotics and opens the way for verification of functional components of autonomous robots and beyond. We illustrate this claim by describing a complete example based on a genuine drone flight controller.

Published
2023

50. Migrating the Communication Protocol of Client-Server Applications

Author

Darbord, Gabriel, Verhaeghe, Benoît, Etien, Anne, Anquetil, Nicolas, Derras, Mustapha, Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria), Berger-Levrault, Analyses and Languages Constructs for Object-Oriented Application Evolution (RMOD), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS), Université de Lille, Centre de Recherche en Informatique de Paris 1 (CRI), Université Paris 1 Panthéon-Sorbonne (UP1), Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS), Analyses and Languages Constructs for Object-Oriented Application Evolution [RMOD], Centre de Recherche en Informatique de Paris 1 [CRI], and Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]

Subjects
Client server architecture, Communication protocols, Software migration, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]
Abstract

International audience; As part of a collaboration with Berger-Levrault, an international IT company, we are working on the migration of client-server applications. To escape legacy technologies and to evolve towards a "software as a service" model, the company decided to migrate the client side of its applications to Angular 14 and the server side to Spring Boot. In this paper, we focus on the migration of client-server communication from RMI and GWT-RPC to the REST architectural style. We identify issues associated with such a migration and propose a tool-based approach to address them. The migration involves (1) identifying existing services and exchanged data structures; (2) migrating the services; (3) migrating the data structures on the new client side; and (4) in some cases, reducing the amount of exchanged data to address performance issues. We experimented with our approach on four of the company's applications currently using RMI or GWT-RPC.

Published
2023

Catalog

Books, media, physical & digital resources
See catalog results