Peter Habermehl
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Peter Habermehl has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Ahmed Bouajjani
Université Paris Cité, IRIF
3 shared publications - Wael-Amine Boutglay
Université Paris Cité, IRIF
3 shared publications - Erwann Loulergue1 shared publication
- Eugene Asarin
Université Paris Cité, CNRS, IRIF
1 shared publication Kirsten (Frankfurt/Main) Groß-Albenhausen
1 shared publication- Lukáš Holík
Brno University of Technology
1 shared publication
Latest Publications
- 6 June 2026
- Published by Springer Nature
- p. 238-251
Passive Learning of Symbolic Automata over Monotonic Algebras
- 6 June 2026
- Published by Springer Nature
- p. 238-251
Passive Learning of Symbolic Automata over Monotonic Algebras
- 1 October 2025
- Published by Springer Nature
- p. 19-36
Enhancing Numerical Invariants Learning with Bounded Reachability Analysis
- 1 October 2025
- Published by Springer Nature
- p. 19-36
Enhancing Numerical Invariants Learning with Bounded Reachability Analysis
- Open Access
- 23 July 2025
- Published by Springer Nature
- p. 338-363
Data-Driven Verification of Procedural Programs with Integer Arrays
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.
- 23 July 2025
- Published by Springer Nature
- p. 338-363
Open AccessData-Driven Verification of Procedural Programs with Integer Arrays
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.
- Open Access
- 6 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Robust Identification of Hybrid Automata from Noisy Data
- 6 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Open AccessRobust Identification of Hybrid Automata from Noisy Data
- Open Access
- 26 July 2024
- Published by Springer Nature
- p. 42-67
Algebraic Reasoning Meets Automata in Solving Linear Integer Arithmetic
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.
- 26 July 2024
- Published by Springer Nature
- p. 42-67
Open AccessAlgebraic Reasoning Meets Automata in Solving Linear Integer Arithmetic
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.
- Open Access
- 7 August 2022
- Published by Springer Nature
- p. 282-303
Data-driven Numerical Invariant Synthesis with Automatic Generation of Attributes
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.
- 7 August 2022
- Published by Springer Nature
- p. 282-303
Open AccessData-driven Numerical Invariant Synthesis with Automatic Generation of Attributes
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.