Peter Habermehl

Peter Habermehl

Auto-generated profile, based on publicly available information

Peter Habermehl

Université Paris Cité, IRIF

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 July 2024
Verified
Book Chapter
Open access
PDF file
PHPeter Habermehl
Peter Habermehl
VHVojtěch Havlena
Vojtěch Havlena
MHMichal Hečko
Michal Hečko
LHLukáš Holík
Lukáš Holík
OLOndřej Lengál
Ondřej Lengál
We present a new angle on solving quantified linear integer arithmetic based on combining the automata-based approach, where numbers are understood as bitvectors, with ideas from (nowadays prevalent) algebraic approaches, which work directly with numbers. This combination is enabled by a fine-grained version of the duality between automata and arithmetic formulae. In particular, we employ a construction where states of automaton are obtained as derivatives of arithmetic formulae: then every state corresponds to a formula. Optimizations based on techniques and ideas transferred from the world of algebraic methods are used on thousands of automata states, which dramatically amplifies their effect. The merit of this combination of automata with algebraic methods is demonstrated by our prototype implementation being competitive to and even superior to state-of-the-art SMT solvers.

7 August 2022
Verified
Book Chapter
Open access
PDF file
ABAhmed Bouajjani
Ahmed Bouajjani
WBWael-Amine Boutglay
Wael-Amine Boutglay
PHPeter Habermehl
Peter Habermehl
We propose a data-driven algorithm for numerical invariant synthesis and verification. The algorithm is based on the ICE-DT schema for learning decision trees from samples of positive and negative states and implications corresponding to program transitions. The main issue we address is the discovery of relevant attributes to be used in the learning process of numerical invariants. We define a method for solving this problem guided by the data sample. It is based on the construction of a separator that covers positive states and excludes negative ones, consistent with the implications. The separator is constructed using an abstract domain representation of convex sets. The generalization mechanism of the decision tree learning from the constraints of the separator allows the inference of general invariants, accurate enough for proving the targeted property. We implemented our algorithm and showed its efficiency.

6 May 2025
Verified
Conference Paper
Open access
NKNiklas Kochdumper
Niklas Kochdumper
MFMohammed Aristide Foughali
Mohammed Aristide Foughali
PHPeter Habermehl
Peter Habermehl
EAEugene Asarin
Eugene Asarin

23 July 2025
Verified
Book Chapter
Open access
PDF file
ABAhmed Bouajjani
Ahmed Bouajjani
WBWael-Amine Boutglay
Wael-Amine Boutglay
PHPeter Habermehl
Peter Habermehl
We address the problem of verifying automatically procedural programs manipulating parametric-size arrays of integers, encoded as a constrained Horn clauses solving problem. We propose a new algorithmic method for synthesizing loop invariants and procedure pre/post-conditions represented as universally quantified first-order formulas constraining the array elements and program variables. We adopt a data-driven approach that extends the decision tree Horn-ICE framework to handle arrays. We provide a powerful learning technique based on reducing a complex classification problem of vectors of integer arrays to a simpler classification problem of vectors of integers. The obtained classifier is generalized to get universally quantified invariants and procedure pre/post-conditions. We have implemented our method and shown its efficiency and competitiveness w.r.t. state-of-the-art tools on a significant benchmark.


28 October 2014
Verified
Dataset
Closed access
KGKirsten (Frankfurt/Main) Groß-Albenhausen
Kirsten (Frankfurt/Main) Groß-Albenhausen
WEWerner (Cologne) Eck
Werner (Cologne) Eck
PHPeter (Berlin) Habermehl
Peter (Berlin) Habermehl
MMMischa (Bielefeld) Meier
Mischa (Bielefeld) Meier
TFThomas (Bochum) Franke
Thomas (Bochum) Franke