Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Julius Adelt

dblp:285/5713 · DBLP profile ↗
← Back
9ranked-venue papers
6as first author
9since 2021 · last 2024
0009-0000-5337-520XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 9 · 6 first-author · 9 since 2021Theory of computation · 4 · 2 first-author · 4 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Automated reasoning and model checking · 73% Logic in computer science · 27%
Software engineering, system software, and programming languages
1 paper
Program verification · 100%
Artificial intelligence
2 papers
Robot navigation and mapping · 60% Reinforcement learning · 40%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automated reasoning and model checking
hybrid systems verification
1.322024
Reusable Specification Patterns for Verification of Resilience in Autonomous Hybrid Systems · FM (2) 2024
Formal Verification of Intelligent Hybrid Systems that are Modeled with Simulink and the Reinforcement Learning Toolbox · FM 2021
Automated reasoning and model checking › program verification
deductive verification
0.812024
Reusable Specification Patterns for Verification of Resilience in Autonomous Hybrid Systems · FM (2) 2024
Logic in computer science › modal logic › dynamic logic
differential dynamic logic
0.812024
Reusable Specification Patterns for Verification of Resilience in Autonomous Hybrid Systems · FM (2) 2024
Program verification › system verification
embedded software verification
0.512021
Combining Forces: How to Formally Verify Informally Defined Embedded Systems · FM 2021
Robotics › Robot navigation and mapping
safe autonomous systems
0.212024
Reusable Specification Patterns for Verification of Resilience in Autonomous Hybrid Systems · FM (2) 2024
Embedded and real-time systems
cyber-physical system platforms
0.112021
Combining Forces: How to Formally Verify Informally Defined Embedded Systems · FM 2021

Methods — techniques the papers use, named apart from their topics

reinforcement learning · 1.5interactive theorem proving · 1.5hybrid contracts · 1.5
YearPublicationVenuePosition
2024 Reusable Specification Patterns for Verification of Resilience in Autonomous Hybrid Systems
abstract
Abstract Autonomous hybrid systems are systems that combine discrete and continuous behavior with autonomous decision-making, e.g., using reinforcement learning. Such systems are increasingly used in safety-critical applications such as self-driving cars, autonomous robots or water supply systems. Thus, it is crucial to ensure their safety and resilience, i.e., that they function correctly even in the presence of dynamic changes and disruptions. In this paper, we present an approach to obtain formal resilience guarantees for autonomous hybrid systems using the interactive theorem prover KeYmaera X. Our key ideas are threefold: First, we derive a formalization of resilience that is tailored to autonomous hybrid systems. Second, we present reusable patterns for modeling stressors, detecting disruptions, and specifying resilience as a service level response in the differential dynamic logic (d $$\mathcal {L}$$ L ). Third, we combine these concepts with an existing approach for the safe integration of learning components using hybrid contracts, and extend it towards dynamic adaptations to stressors. By combining reusable patterns for stressors, observers, and adaptation contracts for learning components, we provide a systematic approach for the deductive verification of resilience of autonomous hybrid systems with reduced specification effort. We demonstrate the applicability of our approach with two case studies, an autonomous robot and an intelligent water distribution system.
Julius Adelt, Robert Mensing, Paula Herber
FM (2)1
2024 Formal Verification of Cyber-Physical Systems Using Domain-Specific Abstractions
Paula Herber, Julius Adelt, Philip Tasche
SEFM2
2024 Reusable formal models for concurrency and communication in custom real-time operating systems
abstract
Abstract In embedded systems, the execution semantics of the real-time operating system (RTOS), which is responsible for scheduling and timely execution of concurrent processes, is crucial for the correctness of the overall system. However, existing approaches for the formal verification of embedded systems typically abstract from the RTOS completely, or provide a detailed and synthesizable formal model of the RTOS. While the former may lead to unsafe systems, the latter is not compatible with industrial design processes. In this paper, we present an approach for reusable abstract formal models that can be configured for custom RTOS. Our key idea is to formally capture common execution mechanisms of RTOS like preemptive scheduling, event synchronization, and communication abstractly in configurable timed automata models. These abstract formal models can be configured for a concrete custom RTOS, and they can be combined into a formal system model together with a concrete application. Our reusable models significantly reduce the manual effort of defining a formal model that captures concurrency and real-time behavior, together with the functionality of an application. The resulting formal model enables analysis, verification, and graphical simulation. We validate our approach by formalizing and analyzing a rescue robot application running the custom open source RTOS EV3RT.
Julius Adelt, Julian Gebker, Paula Herber
Int. J. Softw. Tools Technol. Transf.1
2023 Safe Integration of Learning in SystemC using Timed Contracts and Model Checking
Pauline Blohm, Julius Adelt, Paula Herber
MEMOCODE2
2022 Reusable Contracts for Safe Integration of Reinforcement Learning in Hybrid Systems
Julius Adelt, Daniel Brettschneider, Paula Herber
ATVA1
2022 Towards Reusable Formal Models for Custom Real-Time Operating Systems
Julius Adelt, Julian Gebker, Paula Herber
FMICS1
2022 Towards Safe and Resilient Hybrid Systems in the Presence of Learning and Uncertainty
Julius Adelt, Paula Herber, Mathis Niehage, Anne Remke
ISoLA (1)1
2021 Formal Verification of Intelligent Hybrid Systems that are Modeled with Simulink and the Reinforcement Learning Toolbox
Julius Adelt, Timm Liebrenz, Paula Herber
FM1
2021 Combining Forces: How to Formally Verify Informally Defined Embedded Systems
Paula Herber, Timm Liebrenz, Julius Adelt
FM3