Alexander Schlecht

dblp:251/2065 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · none

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

Software engineering, systems software and programming languages · 2 · 1 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Theory of computation · 1 · 1 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.

Software engineering, system software, and programming languages
1 paper
Program analysis · 91% Programming languages and type systems · 9%

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

TopicWeightPapersLastEvidence papers
Program analysis › static analysis
bug detection
0.412019
Generating precise error specifications for C: a zero shot learning approach · Proc. ACM Program. Lang. 2019
Program analysis › static analysis › bug detection
error handling bug detection
0.412019
Generating precise error specifications for C: a zero shot learning approach · Proc. ACM Program. Lang. 2019
Program analysis › specification mining
error specification inference
0.412019
Generating precise error specifications for C: a zero shot learning approach · Proc. ACM Program. Lang. 2019
Programming languages and type systems › programming paradigms › imperative languages
c
0.112019
Generating precise error specifications for C: a zero shot learning approach · Proc. ACM Program. Lang. 2019

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

transfer learning · 0.4machine learning · 0.4
YearPublicationVenuePosition
2026 Disproving (Positive) Almost-Sure Termination of Probabilistic Term Rewriting via Random Walks
abstract
Abstract While numerous techniques have been developed to automatically prove termination of probabilistic programs, there are only few automated methods to disprove their termination. In this paper, we present the first techniques to automatically disprove (positive) almost-sure termination of probabilistic term rewriting. Disproving termination of non-probabilistic systems requires finding a finite representation of an infinite computation, e.g., a loop of the rewrite system. We extend such qualitative techniques to probabilistic term rewriting, where a quantitative analysis is required. In addition to the existence of a loop, we have to count the number of such loops in order to embed suitable random walks into a computation, thereby disproving termination. To evaluate their power, we implemented all our techniques in the tool .
Jan-Christoph Kassing, Henri Nagel, Alexander Schlecht, Jürgen Giesl
IJCAR (2)3
2019 Generating precise error specifications for C: a zero shot learning approach
abstract
In C programs, error specifications, which specify the value range that each function returns to indicate failures, are widely used to check and propagate errors for the sake of reliability and security. Various kinds of C analyzers employ error specifications for different purposes, e.g., to detect error handling bugs, yet a general approach for generating precise specifications is still missing. This limits the applicability of those tools. In this paper, we solve this problem by developing a machine learning-based approach named MLPEx. It generates error specifications by analyzing only the source code, and is thus general. We propose a novel machine learning paradigm based on transfer learning, enabling MLPEx to require only one-time minimal data labeling from us (as the tool developers) and zero manual labeling efforts from users. To improve the accuracy of generated error specifications, MLPEx extracts and exploits project-specific information. We evaluate MLPEx on 10 projects, including 6 libraries and 4 applications. An investigation of 3,443 functions and 17,750 paths reveals that MLPEx generates error specifications with a precision of 91% and a recall of 94%, significantly higher than those of state-of-the-art approaches. To further demonstrate the usefulness of the generated error specifications, we use them to detect 57 bugs in 5 tested projects.
Baijun Wu, John Peter Campora III, Yi He 0007, Alexander Schlecht, Sheng Chen 0008
Proc. ACM Program. Lang.4