Jan Haltermann

Jan Haltermann

Auto-generated profile, based on publicly available information

Jan Haltermann

University of Oldenburg

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
20 March 2021
Verified
Book Chapter
Open access
PDF file
JHJan Haltermann
Jan Haltermann
HWHeike Wehrheim
Heike Wehrheim
Software verification has recently made enormous progress due to the development of novel verification methods and the speed-up of supporting technologies like SMT solving. To keep software verification tools up to date with these advances, tool developers keep on integrating newly designed methods into their tools, almost exclusively by re-implementing the method within their own framework. While this allows for a conceptual re-use of methods, it nevertheless requires novel implementations for every new technique.In this paper, we employ cooperative verification in order to avoid re-implementation and enable usage of novel tools as black-box components in verification. Specifically, cooperation is employed for the core ingredient of software verification which is invariant generation. Finding an adequate loop invariant is key to the success of a verification run. Our framework named CoVEGI allows a master verification tool to delegate the task of invariant generation to one or several specialized helper invariant generators. Their results are then utilized within the verification run of the master verifier, allowing in particular for crosschecking the validity of the invariant. We experimentally evaluate our framework on an instance with two masters and three different invariant generators using a number of benchmarks from SV-COMP 2020. The experiments show that the use of CoVEGI can increase the number of correctly verified tasks without increasing the used resources.

20 April 2023
Verified
Book Chapter
Open access
PDF file
JHJan Haltermann
Jan Haltermann
MJMarie-Christine Jakobs
Marie-Christine Jakobs
CRCedric Richter
Cedric Richter
HWHeike Wehrheim
Heike Wehrheim
Ranged symbolic execution has been proposed as a way of scaling symbolic execution by splitting the task of path exploration onto several workers running in parallel. The split is conducted along path ranges which – simply speaking – describe sets of paths. Workers can then explore path ranges in parallel.In this paper, we propose ranged analysis as the generalization of ranged symbolic execution to arbitrary program analyses. This allows us to not only parallelize a single analysis, but also run different analyses on different ranges of a program in parallel. Besides this generalization, we also provide a novel range splitting strategy operating along loop bounds, complementing the existing random strategy of the original proposal. We implemented ranged analysis within the tool CPAchecker and evaluated it on programs from the SV-COMP benchmark. The evaluation in particular shows the superiority of loop bounds splitting over random splitting. We furthermore find that compositions of ranged analyses can solve analysis tasks that none of the constituent analysis alone can solve.


31 October 2023
Verified
Book Chapter
Closed access
PDF file
JHJan Haltermann
Jan Haltermann
MJMarie-Christine Jakobs
Marie-Christine Jakobs
CRCedric Richter
Cedric Richter
HWHeike Wehrheim
Heike Wehrheim

31 May 2024 in Science of Computer Programming
Verified
Journal Article
Open access
JHJan Haltermann
Jan Haltermann
MJMarie-Christine Jakobs
Marie-Christine Jakobs
CRCedric Richter
Cedric Richter
HWHeike Wehrheim
Heike Wehrheim

10 October 2022
Verified
Conference Paper
Open access
CRCedric Richter
Cedric Richter
JHJan Haltermann
Jan Haltermann
MJMarie-Christine Jakobs
Marie-Christine Jakobs
FPFelix Pauck
Felix Pauck
SSStefan Schott
Stefan Schott
HWHeike Wehrheim
Heike Wehrheim
Debugging, that is, identifying and fixing bugs in software, is a central part of software development. Developers are therefore often confronted with the task of deciding whether a given code snippet contains a bug, and if yes, where. Recently, data-driven methods have been employed to learn this task of bug detection, resulting (amongst others) in so called neural bug detectors. Neural bug detectors are trained on millions of buggy and correct code snippets. Given the “neural learning” procedure, it seems likely that neural bug detectors – on the specific task of finding bugs – have a performance similar to human software developers. For this work, we set out to substantiate or refute such a hypothesis. We report on the results of an empirical study with over 100 software developers, targeting the comparison of humans and neural bug detectors. As detection task, we chose a specific form of bugs (variable misuse bugs) for which neural bug detectors have recently made significant progress. Our study shows that despite the fact that neural bug detectors see millions of such misuse bugs during training, software developers – when conducting bug detection as a majority decision – are slightly better than neural bug detectors on this class of bugs. Altogether, we find a large overlap in the performance, both for classifying code as buggy and for localizing the buggy line in the code. In comparison to developers, one of the two evaluated neural bug detectors, however, raises a higher number of false alarms in our study.