6.1.1 CESAn

• Name:
  Core Erlang Semantics Analyzer
• Keyword:
  Formal semantics
• Functional Description:
  CESAn implements the semantics of a subset of Core Erlang. Given a Core Erlang program with finite semantics, it outputs its semantics in the form of a labeled transition system. The underlying small-step semantics faithfully represents message passing and signal handling in Erlang.
• Publication:
  hal-04222884
• Contact:
  Aurélie Kong Win Chang
• Participants:
  Aurélie Kong Win Chang, Jerome Feret, Gregor Goessler

6.1.2 cloudnet

• Name:
  Cloudnet
• Keywords:
  Cloud configuration, Tosca, Docker Compose, Heat Orchestration Template, Alloy
• Scientific Description:

  The multiplication of models, languages, APIs and tools for cloud and network configuration management raises heterogeneity issues that can be tackled by introducing a reference model. A reference model provides a common basis for interpretation for various models and languages, and for bridging different APIs and tools. The Cloudnet Computational Model formally specifies, in the Alloy specification language, a reference model for cloud configuration management. The Cloudnet software formally interprets several configuration languages in it, including the TOSCA configuration language, the OpenStack Heat Orchestration Template and the Docker Compose configuration language.

  The use of the software shoes, for examples, how the Alloy formalization allowed us to discover several classes of errors in the OpenStack HOT specification.

• Functional Description:

  Application of the Cloudnet model developed by Inria to software network deployment and reconfiguration description languages.

  The Cloudnet model allows syntax and type checking for cloud configuration templates as well as their visualization (network diagram, UML deployment diagram). Four languages are addressed for the moment: The OASIS's TOSCA specification, the ETSI's NFV SOL001 specification, OpenStack's HOT (Heat Orchestration Template), and Docker Compose.

  We can use directly the software from an Orange web portal: https://toscatoolbox.orange.com

• URL:
  https://­github.­com/­Orange-OpenSource/­Cloudnet-TOSCA-toolbox
• Publication:
  hal-02940938v1
• Contact:
  Philippe Merle
• Participants:
  Philippe Merle, Jean-Bernard Stefani, Roger Pissard-Gibollet, Souha Ben Rayana, Karine Guillouard, Meryem Ouzzif, Frédéric Klamm, Jean-Luc Coulin
• Partner:
  Orange Labs

6.1.3 MASTAG

• Name:
  Memory Analyzer and Scheduler for Task Graphs
• Keyword:
  Task scheduling
• Functional Description:

  The MASTAG software computes sequential schedules of a task graph or an SDF graph in order to minimize its memory peak.

  MASTAG is made of several components: (1) a set of local transformations that compress a task graph while preserving its optimal memory peak, (2) an optimized branch and bound algorithm able to find optimal schedules for medium sized (30-50 nodes) task graphs, (3) support to accommodate SDF graphs in particular, their conversion into task graphs and a suboptimal technique to reduce their size.

  MASTAG finds optimal sequential schedules in polynomial time for a wide range of directed acyclic task graphs (DAG), including trees and series-parallel DAG. On classic benchmarks, MASTAG always outperforms the state-of-the-art.

  From an optimal sequential schedule, MASTAG can derive a dynamic parallel schedule satisfying any practical memory constraints and achieving good speedups. MASTAG is efficient and always succeeds in finding a parallel schedule that respects the required memory constraints, unlike alternative tools.

• URL:
  https://­gitlab.­inria.­fr/­spades-pub/­mastag
• Contact:
  Alexandre Honorat

6.1.4 Tabvar

• Keywords:
  Coq, GUI (Graphical User Interface), Teaching
• Functional Description:
  This is a prototype of a graphical interface for the Coq proof assistant that includes graphical elements (here, curve sketching tabs). These elements are meant to interact with the usual textual proof of Coq, and help students learning how what a mathematical proof is expected to be.
• URL:
  https://­mbodin1.­gitlabpages.­inria.­fr/­td-math-coq/­interface.­html
• Publication:
  hal-04096240
• Contact:
  Martin Bodin
• Partner:
  LIG

7.1.1 Dynamicity in dataflow models

Dataflow Models of Computation (MoCs) are widely used in embedded systems, including multimedia processing, digital signal processing, telecommunications, and automatic control. One of the first and most popular dataflow MoCs, Synchronous Dataflow (SDF), provides static analyses to guarantee boundedness and liveness, which are key properties for embedded systems. However, SDF and most of its variants lack the capability to express the dynamism needed by modern streaming applications.

For many years, the Spades team has been working on more expressive and dynamic models that nevertheless allow the static analyses of boundedness and liveness. We have proposed several parametric dataflow models of computation (MoCs) (SPDF 49 and BPDF 39), we have written a survey providing a comprehensive description of the existing parametric dataflow MoCs 42, we have studied symbolic analyses of dataflow graphs 43 and an original method to deal with lossy communication channels in dataflow graphs 48. We have also proposed the RDF (Reconfigurable Dataflow) MoC 4 which allows dynamic reconfigurations of the topology of the dataflow graphs. RDF extends SDF with transformation rules that specify how the topology and actors of the graph may be dynamically reconfigured. The major feature and advantage of RDF is that it can be statically analyzed to guarantee that all possible graphs generated at runtime will be connected, consistent, and live, which in turn guarantees that they can be executed in bounded time and bounded memory. To the best of our knowledge, RDF is the only dataflow MoC allowing an arbitrary number of topological reconfigurations while remaining statically analyzable.

In 2022, we started focusing on optimizing the memory consumption of dataflow graphs. This objective is critical for embedded systems and neural networks which can be implemented in a dataflow fashion. We have first proposed new techniques to find optimal sequential schedules (optimal in the sense that their memory peak is minimal) of tasks graphs and SDF graphs. Then, we have studied how to find parallel schedules that satisfy memory constraints possibly the strongest ones.

We have proposed graph transformations that compress a task graph while preserving its optimal memory peak 14, 29. These transformations compress a large class of graphs into a single node representing their optimal schedule. In particular, we have formally proved that this is the case for all Series-Parallel Directed Acyclic Graphs (SP-DAGs). In addition, our graph transformations provides a simple characterization of optimal schedules for sets of independent tasks and allowed us to design an optimal compositional analysis dealing with single-source single-sink subgraphs (called S-T subgraphs). These S-T subgraphs can be analyzed separately and replaced by their best schedule. These results (correctness of the transformation rules, the compositional analysis, etc.) were formally proved. For graphs that cannot be compressed to a single node, we have designed an optimized branch and bound algorithm able to find optimal schedules for medium sized task graphs, between 30 and 50 nodes.

Our approach also applies to SDF graphs after converting them to task graphs. However, since that conversion may produce very large graphs, we also propose a new suboptimal method, similar to Partial Expansion Graphs, to reduce the problem size. We evaluated our approach on classic benchmarks, on which we always outperform the state-of-the-art.

A natural extension of this work was to consider parallel schedules with shared memory. The optimal memory peak found for a sequential execution provides a lower bound for all its parallel versions. Using a list scheduling scheduling algorithm adapted to take into account memory requirements, we were able to derive dynamic parallel schedules from the optimal sequential schedules 22. We produce parallel schedules that always meet the memory constraints (even the harshest ones) and enjoy relatively good speedups. As expected, the more relaxed the memory constraints, the better the speedups are. When memory constraints are close to their minimum, our approach always succeeds in finding a parallel schedule meeting the given constraints, whereas the previous state-of-the-art approaches mostly fail. Furthermore, our approach is faster and can deal with very large task graphs.

Finally, we have applied the Affine DataFlow Graph (ADFG) theory to the domain of reconfigurable processors (FPGA) 16. With the help of a few new equations, the theory of ADFG is adapted to minimize the buffer sizes of dataflow applications modeled by SDF graphs and executed on FPGA. This is particularly important for FPGAs which have a limited embedded memory. The corresponding open-source software PREESM is developped at INSA Rennes.

7.2.1 A Markov Decision Process approach for energy minimization policies

Since 2017 we have been working on a very general model of real-time systems, made of a single-core processor equipped with DVFS1 and an infinite sequence of preemptive real-time jobs. Each job $J_i$ is characterized by the triplet $({\tau }_i,w_i,d_i)$, where ${\tau }_i$ is the inter-arrival time between $J_i$ and $J_{i+1}$, $w_i$ is the actual size of $J_i$, upper-bounded by the maximal size $W$, and $d_i$ is the relative deadline of $J_i$, upper-bounded by $\Delta$. The key point is that the system is non-clairvoyant, meaning that, at release time, $w_i$ is not known until the job $J_i$ actually terminates. The only information available to the processor are the statistical information on the jobs' characteristics: release time, average execution time (AET), and relative deadline. In this context, we have proposed a Markov Decision Process (MDP) solution to compute the optimal online speed policy guaranteeing that each job completes before its deadline and minimizing the energy consumption 15. To the best of our knowledge, our MDP solution is the first to be optimal. We have also provided counter examples to prove that the two previous state of the art algorithms, namely OA  37 and PACE  62, 63, are both sub-optimal. Finally, we have proposed a new heuristic online speed policy called Expected Load (EL) that incorporates an aggregated term representing the future expected jobs into a speed equation similar to that of OA. Simulations show that our MDP solution outperforms the existing online solutions (OA, PACE, and EL), and can be very attractive in particular when the mean value of the execution time distribution is far from the worst-case execution time (WCET). This was the topic of Stéphan Plassart's PhD  53, 5251, who defended his PhD in June 2020 68.

7.3.1 Causal Explanations for Embedded and Concurrent Systems

In order to pinpoint the root causes of system failures and explain why an observed outcome occurred, we have been developing techniques based on counterfactual analysis. Counterfactual analyses determine causal dependencies beyond those captured by classical causal semantics for concurrent systems. Given a system model, our goal is to extract the part of a failing execution trace that is causally relevant for the failure. We have been continuing our work on this topic in two directions.

Following up on Thomas Mari's PhD thesis 64, we are currently working on a symbolic construction of robustness functions for real-time systems, allowing us to effectively generate explanations.

As part of the DCore project on causal debugging of concurrent programs, the goal of Aurélie Kong Win Chang's PhD thesis is to investigate the construction of causal explanations for Erlang programs. In 59 we have formalized a small step semantics for a subset of Core Erlang that models, in particular, its monitoring and signal systems. We have implemented this semantics in the Core Erlang Semantics Analizer (CESAn, 6.1.1). We are currently developing a tool that, based on this semantics, explains the causes of a program execution violating an expected safety property.

So far we assumed a system model to be known in order to assess causality. However, for many applications a faithful system model is not available. The goal of Alexander Obeid Guzman's PhD thesis is to leverage a measure of conditional algorithmic complexity in order to infer causal dependencies from the single observation of an execution trace of a telecommunications network.

7.3.2 Reversibility for concurrent and distributed debugging

Concurrent and distributed debugging is a promising application of the notion of reversible computation 54. As part of the ANR DCore project we contribute to the theory behind, and the developoment of the CauDEr reversible debugger for the Erlang programming language and system.

We have continued this year our work on two main themes: studying reversibility for distributed programs in presence of node and link failures with recovery, and studying reversibility for concurrent programs using a shared memory concurrency model.

Concerning reversibility for distributed programs, even though the Erlang programming language was the main application target for the DCore project, Erlang is a real-world language with a fair number of features to handle. For this reason, we decided to develop a small process calculus conceived as an abstraction of the behaviour of distributed Erlang systems, featuring crash failures for nodes running Erlang systems, and for communication links between Erlang nodes, as well as recoveries for nodes and links. Node recovery in Erlang has a fairly weak semantics, namely, a node that recovers from a crash failure restarts with no memory from its past execution. Furthermore, as we discovered from experiments with Erlang, Erlang makes use of incarnation numbers to distinguish between the different instances of a node across failures (an incarnation number tells the number of failures a node has had in the past), and maintains for each node a (possibly erroneuous) view of the current status of nodes it is linked to. Unfortunately we did not find in the litterature any process calculus analysis of distributed systems with crash failures and recoveries with a weak recovery semantics, incarnation numbers and imperfect node views. Our first achievement in this area thus concerned the development of a new process calculus with the preceding features, called D$\pi$FR (for distributed $\pi$-calculus with crash failures and recoveries), and the study of its behavioral theory, with a result of full abstraction, namely the characterization of contextual equivalence in D$\pi$FR by means of a bisimilarity relation. This work has been accepted to LMCS with minor revisions 46. Our second achievement is the development of two reversible semantics for D$\pi$FR, that constitutes two interesting design points in a range of possible reversible semantics for D$\pi$FR, depending on various assumptions pertaining e.g. to persistency of information across failures or the degree of cooperation between nodes. The first semantics, called non-cooperative, assumes that local causal dependency information is totally lost during a node crash and that nodes do not cooperate to exchange causal information during execution. The second semantics, called cooperative, still assumes that local causal dependecy information is lost during a node crash but that nodes cooperate during execution to exchange causal information, in a manner similar to causal logging checkpoint/rollback recovery schemes in the distributed algorithms literature. This work is reported in Giovanni Fabbretti's PhD thesis, which was successfully defended in October 2024.

Concerning reversibility for shared memory concurrency, we first considered imperative primitives from the Erlang environment providing access to a shared dictionary 17. A shared dictionary is a form of shared memory and this work demonstrated the complexities involved in defining from scratch a causally consistent reversible semantics for a concurrent programming language. We thus decided to first concentrate on developing a modular operational framework for the definition of shared memory models. In our framework, a concurrent language with a shared memory model takes the form of a synchronous product of three components: a set of concurrent threads of execution that cooperate by means of a memory whose concurrent access is governed by a scheduler. We have shown that our framework is expressive and general enough to faithfully capture diverse memory models, including a sequentially consistent memory model, weak memory models with memory access buffering and reordering, as well as strong and weak transactional memory models. We have then developed a theory for the causally consistent reversing of synchronous products of labelled transition systems with independence. We show that the causal consistent reversibility of a synchronous product of LTSs meeting a set of conditions (square property, independence of backward transitions, well-foundedness, and unambiguity of transitions), can be obtained by the same synchronous product of the reversible variants of the composed LTSs. This provides us with a general recipe for reversing memory models described with our framework. Devising LTSs with independence meeting the required conditions can itself be automated using the approach we have developed 47 for generating a reversible semantics from an operational one defined as a reduction relation formalized in Maude (a logical framework for conditional rewriting logic). These results on reversing concurrent memory models are documented in PIetro Lami's PhD thesis, which was successfully defended in December 2024.

9.1.1 ANR

9.1.2 Défi Inria

SIA

Participants: Baptiste de Goër, Sophie Quinton.

The SIA Exploratory Research project, supported by INRIA’s DGDS, funds the PhD work of Baptiste de Goër and provides funding for an upcoming postdoctoral fellow in Sciences and Technology Studies. The goal of the project is to provide interdisciplinary foundations for studying the complex relation- ship between computer science, information and communication technologies (ICT), society and the environment. We approach the problem from three complementary perspectives: 1) by contributing to an interdisciplinary overview of the state of knowledge on the environmental impacts of ICT; 2) by studying the complex connection between computer science and the Anthropocene through the way it is and could be taught in secondary schools; 3) by exploring, at a local scale, the possibility to deploy frugal or low tech alternatives to existing digital systems, following a participatory approach.

10.1.1 Scientific events: organisation

10.1.2 Scientific events: selection

10.1.3 Journal

10.1.4 Invited talks

• Alain Girault gave a talk titled “Synchronous programming of reactive systems (cyber-physical, real-time,embedded)” during the Orange Dev Days, Grenoble, France, December 2024.
• Sophie Quinton gave talks related to her SIA research project in Rennes (Séminaire d'éthique des mathématiques), Paris (Étudiant.es en lutte de Sorbonne Université) and Lyon (AG du CITI), and presented the Ateliers SEnS to Labos1point5's GT réflexion.

10.1.5 Leadership within the scientific community

• Sophie Quinton co-chairs a working group of the GDR CIS associated with the Center for Internet and Society focused on environmental issues. She also co-chairs the “ICT and sustainability” Persyval-lab axis.

10.1.6 Scientific expertise

• Sophie Quinton is a member of the scientific board of Grenoble Métropole and the Agence d'urbanisme de la région grenobloise.

10.1.7 Research administration

• Since October 2013, Pascal Fradet has been head of the committee for doctoral studies (“Responsable du comité des études doctorale”) of the Inria Grenoble research center. He is also the local correspondent for the young researchers Inria mission (“Mission jeunes chercheurs”) and serves as the substitute of the director of the Inria Grenoble research center at the doctoral school council (MSTII).
• In 2024, Pascal Fradet was member of the Inria Grenoble hiring committee for junior researchers (CRCN).
• Since January 2019, Alain Girault has been Deputy Scientific Director at INRIA, in charge of the “Algorithmics, Programming, Software and Architecture” research domain, which encompasses 46 research teams. In 2024, he launched two Inria research challenges (LLM4Code and CocoRISCo), organized a scientific workshop on RISC-V, and supported/audited the creation of four new Inria research teams. He was also one of the three Inria sherpas for the “Hardware Components of AI” French program, which will kick-off in 2025.
• Alain Girault was member of the INRIA Junior Researcher Admission jury in 2024.
• Gregor Goessler is member of the scientific jobs committee at Inria Grenoble.
• Sophie Quinton facilitates the SEnS-GRA group which hosts discussions and proposes actions regarding the environmental and societal impact of our research at Inria Grenoble.
• Sophie Quinton was a member of a hiring committee for 2 McF positions in Rennes.

10.2.1 Teaching

• Licence : Pascal Fradet, Théorie des Langages 1, 18 HeqTD, niveau L3, Grenoble INP (Ensimag), France
• Licence : Pascal Fradet, Modèles de Calcul : $\lambda$-calcul, CM & TD, 30 HeqTD, niveau L3, Univ. Grenoble Alpes, France
• Licence : Xavier Nicollin, Théorie des Langages 1, 40,5 HeqTD, niveau L3. Grenoble INP (Ensimag), France
• Licence : Xavier Nicollin, Théorie des Langages 2, 37,5 HeqTD, niveau L3, Grenoble INP (Ensimag), France
• Licence : Xavier Nicollin, Modèles de Calcul : Machines de Turing, 30 HeqTD, niveau L3, Univ. Grenoble Alpes, France
• Master : Xavier Nicollin, Analyse de Code pour la Sûreté et la Sécurité, 45 HeqTD, niveau M1, Grenoble INP (Ensimag), France
• Master : Xavier Nicollin, Algorithimque et Optimisation Discrète, 18 HeqTD, niveau M1, Grenoble INP (Ensimag), France
• Master : Xavier Nicollin, Fondements Logiques pour l'Informatique, 19,5 HeqTD, niveau M1, Grenoble INP (Ensimag), France
• Licence : Alain Girault, Modèles de Calcul : $\lambda$-calcul, 12 HeqTD, niveau L3, Univ. Grenoble Alpes, France
• Master : Sophie Quinton, Numérique responsable, 15 HeqTD, niveau M1, Grenoble INP (Ensimag), France
• Master : Sophie Quinton, Kaléidoscope, 3 HeqTD, niveau M1, Grenoble INP, France
• École doctorale: Sophie Quinton gave a 3h course "Sciences, environnements, sociétés" at the College des Écoles Doctorales.
• Master : Martin Bodin, Kaléidoscope, 1 HeqTD, niveau M1, Grenoble INP, France
• Licence : Martin Bodin, Modèles de Calcul : $\lambda$-calcul, 12 HeqTD, niveau L3, Univ. Grenoble Alpes, France
• Master : Martin Bodin, LTPF, 27 HeqTD, niveau M1, Polytech (UGA), France

10.2.2 Supervision

• Gregor Goessler: PhD in progress: Aurélie Kong Win Chang, "Causal explanations for concurrent programs in Erlang"; since January 2021; co-advised by Gregor Goessler and Jérôme Feret.
• Gregor Goessler: PhD in progress: Alexander Obeid Guzman, "Inference of causal models for networks from single observations"; since January 2024.
• Sophie Quinton et Alain Girault: PhD completed: Aina Rasoldier, "Comment évaluer le potentiel d'une solution numérique face à l'urgence écologique ? Application aux plateformes de covoiturage régulier à l'échelle locale".
• Sophie Quinton: PhD in progress: Baptiste de Goër, “Teaching ICT-related sustainability issues in computer science courses”.
• Sophie Quinton: PhD in progress: Ludmila Courtillat--Piazza, “Dépendance au numérique et vulnérabilités dans un contexte d'urgence écologique, abordées sous l'angle de la résilience des réseaux mobiles”.
• Jean-Bernard Stefani: PhD completed: Giovanni Fabbretti on reversibility for distributed programs (UGA), Pietro Lami on reversibility for shared memory concurrent programs (UGA and U. Bologna).
• Jean-Bernard Stefani: PhD in progress: Boubacar Diarra on verification of Kubernetes configurations (U. Lille).

10.2.3 Juries

• Gregor Goessler, president of the PhD jury of Lei Zan, UGA.
• Sophie Quinton, member of the PhD committee of Vincent Giraud, ENS.

10.3.1 Specific official responsibilities in science outreach structures

• Martin Bodin is local referent for Chiche!, a nationwide program to raise awareness of digital science and technology among second-grade students.

10.3.2 Productions (articles, videos, podcasts, serious games, ...)

• Sophie Quinton contributed to the serious game PhoneImpact.
• Sophie Quinton co-authored an article about water related issues of the cloud 13.

10.3.3 Participation in Live events

• Alain Girault gave an outreach talk titled “Régulateur Intelligent/Adaptatif de Vitesse” at the Conférence Sociéte Numérique en Question, Grenoble, March 2024.
• Sophie Quinton gave a conference on the social and environmental implications of ICT at the MathC2+ event and co-organized a workshop on ICT and water at the Fête de la science.
• Martin Bodin gave a talk at the MathC2+ event with Alain Girault.
• Martin Bodin animated an activity for high school students during the MathC2+ event.

International journals

• 13 articleS.Sylvain Bouveret, A.Aurélie Bugeau, A.-C.Anne-Cécile Orgerie and S.Sophie Quinton. De l'eau dans les nuages.Annales des Mines - Enjeux Numériques27September 2024, 40-47HALback to text
• 14 articleP.Pascal Fradet, A.Alain Girault and A.Alexandre Honorat. Graph Transformations for Memory Peak Minimization by Scheduling.ACM Transactions on Embedded Computing Systems (TECS)2024, 1-36In press. HALback to text
• 15 articleB.Bruno Gaujal, A.Alain Girault and S.Stéphan Plassart. An MDP-Based Solution for the Energy Minimization of Non-Clairvoyant Hard Real-Time Systems.Real-Time SystemsDecember 2024, 47HALDOIback to text
• 16 articleA.Alexandre Honorat, M.Mickaël Dardaillon, H.Hugo Miomandre and J.-F.Jean-François Nezan. Automated Buffer Sizing of Dataflow Applications in a High-Level Synthesis Workflow.ACM Transactions on Reconfigurable Technology and Systems (TRETS)171March 2024, 1-26HALDOIback to text
• 17 articleP.Pietro Lami, I.Ivan Lanese, J.-B.Jean-Bernard Stefani, C.Claudio Sacerdoti Coen and G.Giovanni Fabbretti. Reversible debugging of concurrent Erlang programs: Supporting imperative primitives.Journal of Logical and Algebraic Methods in Programming138April 2024, 100944HALDOIback to text

National journals

• 18 articleE.Emmanuel Beffara and M.Martin Bodin. Un jeu de plateau pour comprendre la dualité en logique.Adjectif : analyses et recherches sur les TICE20241April 2024, 1-5HAL

Invited conferences

• 19 inproceedingsI.Ivan Lanese and G.Gregor Gössler. Causal Debugging for Concurrent Systems.RC 2024 - 16th International Conference on Reversible ComputationLNCS-14680Reversible Computation : 16th International Conference, RC 2024, Toruń, Poland, July 4–5, 2024, ProceedingsTorun, PolandSpringer Nature SwitzerlandMay 2024, 3-9HALDOI

International peer-reviewed conferences

• 20 inproceedingsB.Boubacar Diarra, K.Karine Guillouard, M.Meryem Ouzzif, P.Philippe Merle and J.-B.Jean-Bernard Stefani. In-depth analysis of Kubernetes manifest verification tools for robust CNF deployment.ICIN 2024 - Conference on Innovation in Clouds, Internet and NetworksParis, France2024, 1-8HAL
• 21 inproceedingsG.Giovanni Fabbretti, I.Ivan Lanese and J.-B.Jean-Bernard Stefani. Reversibility with Holes.Lecture notes in computer scienceRC 2024 - 16th International Conference on Reversible ComputationLNCS-14680Reversible Computation : 16th International Conference, RC 2024, Toruń, Poland, July 4–5, 2024, ProceedingsTorun, PolandSpringer2024, 69 - 74HALDOI
• 22 inproceedingsP.Pascal Fradet, A.Alain Girault and A.Alexandre Honorat. Parallel scheduling of task graphs with minimal memory requirements.39th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2025)Milano, ItalyJune 2025HALback to text
• 23 inproceedingsB.Baptiste de Goër, H.Hersch Micha and S.Sophie Quinton. Informatique et durabilité, une difficile transposition didactique.Actes du colloque Didapro 10 sur la Didactique de l’informatique et des STIC. Volume 1DidaSTIC 2024 - Colloque Didapro 10 sur la Didactique de l’informatique et des STICLouvain-La-Neuve, Belgium2024, 23-32HALback to text
• 24 inproceedingsP.Pietro Lami, I.Ivan Lanese and J.-B.Jean-Bernard Stefani. A Small-Step Semantics for Janus.Lecture notes in computer scienceRC 2024 - 16th International Conference on Reversible ComputationLNCS-14680Reversible Computation : 16th International Conference, RC 2024, Toruń, Poland, July 4–5, 2024, ProceedingsTorun, PolandSpringer2024, 105 - 123HALDOI

Conferences without proceedings

• 25 inproceedingsC.Charles Assaad, E.Emilie Devijver, É.Éric Gaussier, G.Gregor Gössler and A.Anouar Meynaoui. Identifiability of total effects from abstractions of time series causal graphs.40th Conference on Uncertainty in Artificial IntelligenceBarcelone, Spain2024HAL
• 26 inproceedingsS.Sophie Quinton and J.-B.Jean-Bernard Stefani. Taking conviviality seriously (extended abstract).2024 - 1st conference on Undone Science in Computer ScienceNantes, France2024, 1-4HALback to text

Edition (books, proceedings, special issue of a journal)

• 27 periodicalIntroduction to the Special Issue on Specification and Design Languages (FDL 2021).ACM Transactions on Embedded Computing Systems (TECS)235August 2024, 1-4HALDOI

Doctoral dissertations and habilitation theses

• 28 thesisA.Aina Rasoldier. Assessing the potential of a digital Solution in the context of ecological urgency : application to regular carpooling platforms at local scale.Université Grenoble Alpes [2020-....]February 2024HALback to text

Reports & preprints

• 29 reportP.Pascal Fradet, A.Alain Girault and A.Alexandre Honorat. Graph Transformations for Memory Peak Minimization by Scheduling.RR-9554Inria - Research Centre Grenoble – Rhône-AlpesSeptember 2024, 1-42HALback to text

Scientific popularization

• 30 articleP.Philippe Ciblat, J.Jacques Combaz, M.Marceau Coupechoux, K.Kevin Marquet and A.-C.Anne-Cécile Orgerie. Effets environnementaux de la 5G (Partie 1) : La technologie 5G.1024 : Bulletin de la Société Informatique de France23April 2024, 53-72HALDOI
• 31 articleP.Philippe Ciblat, J.Jacques Combaz, M.Marceau Coupechoux, K.Kevin Marquet and A.-C.Anne-Cécile Orgerie. Effets environnementaux de la 5G (partie 2) : Applications envisagées et acteurs impliqués.1024 : Bulletin de la Société Informatique de France24November 2024, 99-127HALDOI
• 32 miscB.Baptiste de Goër. Parler de durabilité en cours d'informatique au lycée.April 2024HALback to text