activity
20062025
most citedReach Set Approximation through Decomposition with Low-dimensional Sets and High-dimensional Matrices

62 citations · 104 across the 15 of their papers we have counts for

collaborators

16 papers

cs.LO2025

Checking the HAL Interface Specification Continuously, Right from the Start

Manuel Bentele, Onur Altinordu, Jan Körner +2

The correct use of a Hardware Abstraction Layer (HAL) interface in embedded applications is crucial to prevent malfunctions, crashes, or even hardware damage. Software model checki…

cs.LO2025

Relevant HAL Interface Requirements for Embedded Systems

Manuel Bentele, Andreas Podelski, Axel Sikora +1

Embedded applications often use a Hardware Abstraction Layer (HAL) to access hardware. Improper use of the HAL can lead to incorrect hardware operations, resulting in system failur…

cs.SE2025

Temporal HAL-API Dependencies as a Gateway to Formal Embedded Software Development

Manuel Bentele, Andreas Podelski, Axel Sikora +1

Temporal HAL-API Dependencies (THADs) can be useful to capture an interesting class of correctness properties in embedded software development. They demand a moderate effort for sp…

cs.PL2023

Commutativity Simplifies Proofs of Parameterized Programs

Azadeh Farzan, Dominik Klumpp, Andreas Podelski

Commutativity has proven to be a powerful tool in reasoning about concurrent programs. Recent work has shown that a commutativity-based reduction of a program may admit simpler pro…

cs.LO2021

Temporal Prophecy for Proving Temporal Properties of Infinite-State Systems

Oded Padon, Jochen Hoenicke, Kenneth L. McMillan +3

Various verification techniques for temporal properties transform temporal verification to safety verification. For infinite-state systems, these transformations are inherently imp…

cs.LO2019★ 15 cited

Ultimate TreeAutomizer (CHC-COMP Tool Description)

Daniel Dietsch, Matthias Heizmann, Jochen Hoenicke +2

We present Ultimate TreeAutomizer, a solver for satisfiability of sets of constrained Horn clauses. Constrained Horn clauses (CHC) are a fragment of first order logic with attracti…