Volume
OASIcs, Volume 143
30th Ada-Europe International Conference on Reliable Software Technologies (AEiC 2026)
- Part of: Series: Open Access Series in Informatics (OASIcs)
Event
Editors
Publication Details
- published at: 2026-06-03
- Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
- ISBN: 978-3-95977-425-3
Access Numbers
- Detailed Access Statistics available here
-
Total Accesses (updated on a weekly basis)
0Documents
Documents
No documents found matching your filter selection.
Document
Complete Volume
OASIcs, Volume 143, AEiC 2026, Complete Volume
Abstract
OASIcs, Volume 143, AEiC 2026, Complete Volume
Cite as
30th Ada-Europe International Conference on Reliable Software Technologies (AEiC 2026). Open Access Series in Informatics (OASIcs), Volume 143, pp. 1-144, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@Proceedings{filieri_et_al:OASIcs.AEiC.2026,
title = {{OASIcs, Volume 143, AEiC 2026, Complete Volume}},
booktitle = {30th Ada-Europe International Conference on Reliable Software Technologies (AEiC 2026)},
pages = {1--144},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-425-3},
ISSN = {2190-6807},
year = {2026},
volume = {143},
editor = {Filieri, Antonio and Backeman, Peter},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.AEiC.2026},
URN = {urn:nbn:de:0030-drops-261367},
doi = {10.4230/OASIcs.AEiC.2026},
annote = {Keywords: OASIcs, Volume 143, AEiC 2026, Complete Volume}
}
Document
Front Matter
Front Matter, Table of Contents, Preface, Conference Organization
Abstract
Front Matter, Table of Contents, Preface, Conference Organization
Cite as
30th Ada-Europe International Conference on Reliable Software Technologies (AEiC 2026). Open Access Series in Informatics (OASIcs), Volume 143, pp. 0:i-0:x, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{filieri_et_al:OASIcs.AEiC.2026.0,
author = {Filieri, Antonio and Backeman, Peter},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {30th Ada-Europe International Conference on Reliable Software Technologies (AEiC 2026)},
pages = {0:i--0:x},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-425-3},
ISSN = {2190-6807},
year = {2026},
volume = {143},
editor = {Filieri, Antonio and Backeman, Peter},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.AEiC.2026.0},
URN = {urn:nbn:de:0030-drops-261354},
doi = {10.4230/OASIcs.AEiC.2026.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
Document
Model-Agnostic Uncertainty-Aware Semantic Segmentation with Conformal Risk Guarantees for Scene Understanding
Abstract
Accurate and reliable scene segmentation is a fundamental requirement for autonomous navigation systems operating in open and dynamic environments. As these systems increasingly rely on data-driven perception modules, their safety and operational robustness hinge on well-calibrated uncertainty estimates that can support explicit control of prediction errors through conformal calibration. Most existing uncertainty-aware segmentation approaches remain architecture-specific and are not evaluated under a common uncertainty-and-calibration protocol across distinct segmentation architectures and datasets. This work introduces a model-agnostic conformal segmentation pipeline that enables operationally meaningful, calibration-based error control in real-world deployments. The proposed framework treats segmentation networks as black boxes and operates on per-pixel class probabilities that are fine-tuned through evidential deep learning (EDL) to decompose aleatoric and epistemic uncertainties. We then apply pixel-wise, class-conditional split-conformal calibration to derive acceptance thresholds for user-defined target error rates. We instantiate the pipeline with DINOv2, Mask2Former, and SegFormer and evaluate it on a newly collected Lisbon street scene (LiSS) dataset; additional cross-dataset results on COCO, using a restricted set of safety-relevant classes, are reported in the appendix. Results show architecture- and class-dependent in-domain uncertainty-error alignment and indicate that dataset shift weakens uncertainty-based filtering and conformal risk control. This motivates continuous monitoring and recalibration as a practical requirement for trustworthy segmentation in safety-critical navigation.
Cite as
Bakary Badjie, José Cecílio, Nils-Jonathan Friedrich, Norman Seyffer, Georg Jäger, and António Casimiro. Model-Agnostic Uncertainty-Aware Semantic Segmentation with Conformal Risk Guarantees for Scene Understanding. In 30th Ada-Europe International Conference on Reliable Software Technologies (AEiC 2026). Open Access Series in Informatics (OASIcs), Volume 143, pp. 1:1-1:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{badjie_et_al:OASIcs.AEiC.2026.1,
author = {Badjie, Bakary and Cec{\'\i}lio, Jos\'{e} and Friedrich, Nils-Jonathan and Seyffer, Norman and J\"{a}ger, Georg and Casimiro, Ant\'{o}nio},
title = {{Model-Agnostic Uncertainty-Aware Semantic Segmentation with Conformal Risk Guarantees for Scene Understanding}},
booktitle = {30th Ada-Europe International Conference on Reliable Software Technologies (AEiC 2026)},
pages = {1:1--1:20},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-425-3},
ISSN = {2190-6807},
year = {2026},
volume = {143},
editor = {Filieri, Antonio and Backeman, Peter},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.AEiC.2026.1},
URN = {urn:nbn:de:0030-drops-259199},
doi = {10.4230/OASIcs.AEiC.2026.1},
annote = {Keywords: semantic segmentation, uncertainty quantification, evidential deep learning, conformal prediction, risk control, selective prediction}
}
Document
Discovering and Repairing Flaws in C Binaries Without Requiring Codebase and Instrumentation
Abstract
Industrial and embedded software systems frequently integrate various third-party components sourced from diverse providers into their codebases. These systems are commonly developed in C, a language known for its lack of variable bounds checking, making it vulnerable to Buffer Overflows (BOs), which, when exploited, can cause severe damage. Consequently, the binary code resulting from vulnerable C programs is also vulnerable and remains so in the final products. Fixing these software systems is challenging because only binary code is available. This paper presents PatchBin, a binary patching tool to automatically fix BO vulnerabilities and validate the effectiveness of fixes while ensuring no new flaws are introduced. The approach involves a combination of fuzzing, reverse static analysis and static rewriting techniques to, respectively, (i) identify possible malicious inputs that can trigger BOs, (ii) find their root cause by employing reverse data flow analysis, and (iii) remove them by rewriting the binary code with effective validation, thus generating a new binary without the original flaws and new ones. Experimental evaluations with synthetic and real-world applications demonstrated that PatchBin detects and fixes BO in binary programs without introducing new vulnerabilities. The results showed that PatchBin is an important aid for industrial partners, enabling them to test and fix their products, including third-party components, without access to source code, but only to binary code.
Cite as
Diogo Ferreira and Ibéria Medeiros. Discovering and Repairing Flaws in C Binaries Without Requiring Codebase and Instrumentation. In 30th Ada-Europe International Conference on Reliable Software Technologies (AEiC 2026). Open Access Series in Informatics (OASIcs), Volume 143, pp. 2:1-2:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{ferreira_et_al:OASIcs.AEiC.2026.2,
author = {Ferreira, Diogo and Medeiros, Ib\'{e}ria},
title = {{Discovering and Repairing Flaws in C Binaries Without Requiring Codebase and Instrumentation}},
booktitle = {30th Ada-Europe International Conference on Reliable Software Technologies (AEiC 2026)},
pages = {2:1--2:19},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-425-3},
ISSN = {2190-6807},
year = {2026},
volume = {143},
editor = {Filieri, Antonio and Backeman, Peter},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.AEiC.2026.2},
URN = {urn:nbn:de:0030-drops-259209},
doi = {10.4230/OASIcs.AEiC.2026.2},
annote = {Keywords: Buffer Overflow Vulnerabilities, Binary Patching, Reverse Engineering, Static Analysis, Software Security}
}
Document
A Certifiable Approach to Multicore Using Ada
Abstract
The adoption of multicore processors in safety-critical systems, such as avionics, automotive, and rail, introduces significant certification challenges, primarily related to determinism, predictability, and interference management. This paper examines how the Ada programming language, together with its restricted tasking profiles (Ravenscar and Jorvik) and bare-metal run-time libraries, provide a robust and certifiable execution model for multicore systems compliant with guidance such as AC 20-193.
By enforcing static task partitioning, fixed-priority scheduling, and a simple synchronization model, the Ada approach systematically limits interference channels and timing variability. This model enables accurate schedulability analysis, simplifies verification activities, and allows the multicore run-time library itself and the application built on top of it to be certified.
Cite as
José F. Ruiz. A Certifiable Approach to Multicore Using Ada. In 30th Ada-Europe International Conference on Reliable Software Technologies (AEiC 2026). Open Access Series in Informatics (OASIcs), Volume 143, pp. 3:1-3:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{ruiz:OASIcs.AEiC.2026.3,
author = {Ruiz, Jos\'{e} F.},
title = {{A Certifiable Approach to Multicore Using Ada}},
booktitle = {30th Ada-Europe International Conference on Reliable Software Technologies (AEiC 2026)},
pages = {3:1--3:15},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-425-3},
ISSN = {2190-6807},
year = {2026},
volume = {143},
editor = {Filieri, Antonio and Backeman, Peter},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.AEiC.2026.3},
URN = {urn:nbn:de:0030-drops-259217},
doi = {10.4230/OASIcs.AEiC.2026.3},
annote = {Keywords: multicore, certification, Ada}
}
Document
HASCO: A Hybrid AI Simulation Compiler for Semantic Accident Reconstruction
Abstract
The validation of Automated Driving Systems (ADSs) has shifted from distance-based metrics to Scenario-Based Testing (SBT). Large Language Models (LLMs) have emerged as powerful tools with potential for generating vehicular scenarios at scale. However, generative models, used for direct simulation synthesis, produce inadequate output, therefore necessitating a more structured compilation approach. In this regard, we present HASCO (Hybrid AI Simulation COmpiler), a system that translates natural-language driving scene specifications into executable simulation artifacts (XOSC/XODR files) for the esmini/OpenSCENARIO ecosystem. While LLMs excel at narrative parsing, we demonstrate that direct synthesis of simulation artifacts fails in the vast majority of cases due to hallucinated physics or schema violations. To resolve this, HASCO treats scenario creation as a compilation task rather than a generative one. The pipeline supports three compilation paths: direct synthesis, a Python intermediate (via scenariogeneration), and an ontology-guided path that grounds intent into an intermediate representation (IR) before compilation. We further evaluate a self-judging mechanism for automated repair. Across six operating modes evaluated on 40 real-world accident reports, the ontology-guided compiler and Python-based compiler achieve 95% and 90% executability rates, respectively (compared to 5% for direct synthesis). Additionally, we evaluate outputs on semantic fidelity, positioning HASCO as a robust tool for forensic scene reconstruction.
Cite as
Edin Jelačić, Rong Gu, Cristina Seceleanu, Ning Xiong, Peter Backeman, Tiberiu Seceleanu, Zhennan Fei, and Ali Nouri. HASCO: A Hybrid AI Simulation Compiler for Semantic Accident Reconstruction. In 30th Ada-Europe International Conference on Reliable Software Technologies (AEiC 2026). Open Access Series in Informatics (OASIcs), Volume 143, pp. 4:1-4:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{jelacic_et_al:OASIcs.AEiC.2026.4,
author = {Jela\v{c}i\'{c}, Edin and Gu, Rong and Seceleanu, Cristina and Xiong, Ning and Backeman, Peter and Seceleanu, Tiberiu and Fei, Zhennan and Nouri, Ali},
title = {{HASCO: A Hybrid AI Simulation Compiler for Semantic Accident Reconstruction}},
booktitle = {30th Ada-Europe International Conference on Reliable Software Technologies (AEiC 2026)},
pages = {4:1--4:22},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-425-3},
ISSN = {2190-6807},
year = {2026},
volume = {143},
editor = {Filieri, Antonio and Backeman, Peter},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.AEiC.2026.4},
URN = {urn:nbn:de:0030-drops-259220},
doi = {10.4230/OASIcs.AEiC.2026.4},
annote = {Keywords: Autonomous Driving, OpenSCENARIO, Large Language Models, Scenario Generation, Semantic Reconstruction}
}
Document
A Rust Framework for Real-Time Parallel Programming
Abstract
Real-time systems increasingly rely on parallel execution to meet performance and timing requirements. While several programming languages provide mechanisms for combining real-time and parallel programming, Rust currently lacks dedicated frameworks that address both aspects in an integrated way.
In previous work, we proposed a high-level design of a framework for real-time parallel programming in Rust. In this paper, we describe the design of a prototype implementation of this framework as a Rust library. The prototype provides abstractions for creating and managing real-time threads with priorities, as well as thread pools that enable structured parallel execution while respecting priority-based scheduling.
We describe the architecture of the prototype, its implementation and illustrate its use through examples. This implementation demonstrates the feasibility of supporting real-time parallel programming patterns in Rust and serves as a foundation for future extensions of the framework.
Cite as
Hugo Silva, Tiago Carvalho, and Luis Miguel Pinho. A Rust Framework for Real-Time Parallel Programming. In 30th Ada-Europe International Conference on Reliable Software Technologies (AEiC 2026). Open Access Series in Informatics (OASIcs), Volume 143, pp. 5:1-5:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{silva_et_al:OASIcs.AEiC.2026.5,
author = {Silva, Hugo and Carvalho, Tiago and Pinho, Luis Miguel},
title = {{A Rust Framework for Real-Time Parallel Programming}},
booktitle = {30th Ada-Europe International Conference on Reliable Software Technologies (AEiC 2026)},
pages = {5:1--5:17},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-425-3},
ISSN = {2190-6807},
year = {2026},
volume = {143},
editor = {Filieri, Antonio and Backeman, Peter},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.AEiC.2026.5},
URN = {urn:nbn:de:0030-drops-259231},
doi = {10.4230/OASIcs.AEiC.2026.5},
annote = {Keywords: Real-time systems, Parallel programming, Rust}
}
Document
Task-Based Constant Bandwidth Server in the Zephyr Operating System
Abstract
The Constant Bandwidth Server (CBS) is a widely used method to support aperiodic soft real-time tasks in a system that uses dynamic scheduling algorithms, such as Earliest Deadline First (EDF), while providing end-to-end temporal guarantees through bandwidth reservation. We have recently proposed an approach to integrate CBS with the open-source real-time operating system, Zephyr, which involves developing CBS as a separate kernel component that can be shared by multiple execution contexts. In this paper, we propose an alternative approach, which provides each task with a dedicated CBS instance, which enables fine-grained control over task execution. The paper also presents a richer support for EDF scheduling in Zephyr, which is used to support the Task-Based CBS. The proposed method is validated through test cases, demonstrating its efficiency in supporting aperiodic real-time tasks with bandwidth constraints in Zephyr.
Cite as
Alexander Paschoaletto, Paulo Baltarejo Sousa, Luis Miguel Pinho, and Tiago Carvalho. Task-Based Constant Bandwidth Server in the Zephyr Operating System. In 30th Ada-Europe International Conference on Reliable Software Technologies (AEiC 2026). Open Access Series in Informatics (OASIcs), Volume 143, pp. 6:1-6:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{paschoaletto_et_al:OASIcs.AEiC.2026.6,
author = {Paschoaletto, Alexander and Sousa, Paulo Baltarejo and Pinho, Luis Miguel and Carvalho, Tiago},
title = {{Task-Based Constant Bandwidth Server in the Zephyr Operating System}},
booktitle = {30th Ada-Europe International Conference on Reliable Software Technologies (AEiC 2026)},
pages = {6:1--6:16},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-425-3},
ISSN = {2190-6807},
year = {2026},
volume = {143},
editor = {Filieri, Antonio and Backeman, Peter},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.AEiC.2026.6},
URN = {urn:nbn:de:0030-drops-259246},
doi = {10.4230/OASIcs.AEiC.2026.6},
annote = {Keywords: Constant Bandwidth Server, Zephyr Operating System}
}
Document
A Flexible Ada Framework for Jitter-Sensitive Mixed-Criticality Real-Time Systems
Abstract
Real-time systems often require combining time-triggered (TT) and event-triggered (ET) execution models to balance predictability and flexibility. Previous work proposed a unified framework supporting both paradigms, enabling the integration of jitter-sensitive activities within a static TT schedule while preserving the responsiveness of ET execution. However, that framework did not address the requirements of mixed-criticality systems (MCS), where tasks may exhibit different execution-time assumptions depending on the system criticality level.
This paper extends the original framework, designed for Ada under the Ravenscar profile, to support mixed-criticality workloads. First, the task model is enhanced to incorporate multiple execution-time estimates per job, allowing tasks to adapt their behaviour across criticality levels, including the possibility of selectively disabling jobs. Second, the TT scheduling model is extended to support criticality-aware execution, introducing adaptive slot durations, application-level overrun handling, and mechanisms to control the system criticality level at run time. Third, the framework preserves the semantic consistency of multi-frame tasks under criticality-level changes by defining a clear separation between system-wide and task-local criticality.
Additionally, the mode-change mechanism is extended to support timed mode changes, enabling precise control over plan transitions and facilitating synchronisation across distributed schedules.
The proposed approach maintains the predictability of TT execution while providing the flexibility required to support mixed-criticality behaviour. An execution example illustrates the applicability of the framework and the interaction between its main components.
Cite as
Sergio Sáez Barona and Jorge Real Sáez. A Flexible Ada Framework for Jitter-Sensitive Mixed-Criticality Real-Time Systems. In 30th Ada-Europe International Conference on Reliable Software Technologies (AEiC 2026). Open Access Series in Informatics (OASIcs), Volume 143, pp. 7:1-7:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{saezbarona_et_al:OASIcs.AEiC.2026.7,
author = {S\'{a}ez Barona, Sergio and Real S\'{a}ez, Jorge},
title = {{A Flexible Ada Framework for Jitter-Sensitive Mixed-Criticality Real-Time Systems}},
booktitle = {30th Ada-Europe International Conference on Reliable Software Technologies (AEiC 2026)},
pages = {7:1--7:21},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-425-3},
ISSN = {2190-6807},
year = {2026},
volume = {143},
editor = {Filieri, Antonio and Backeman, Peter},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.AEiC.2026.7},
URN = {urn:nbn:de:0030-drops-259253},
doi = {10.4230/OASIcs.AEiC.2026.7},
annote = {Keywords: Real-time systems, Time-triggered scheduling, Mixed-criticality systems, Ravenscar tasking profile, High-integrity systems, Embedded systems}
}