Demo Data from SIGIR 2026 / reviewers in the wild / expert
Florian Lanzinger
dblp:305/1010
· DBLP profile ↗
4ranked-venue papers
3as first author
4since 2021 · last 2024
0000-0001-8560-6324ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 4 · 3 first-author · 4 since 2021Theory of computation · 2 · 1 first-author · 2 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
2 papers |
Program verification · 76% Programming languages and type systems · 24% | |
| Theoretical computer science
1 paper |
Logic in computer science · 100% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Program verification
deductive verification |
1.3 | 2 | 2024 | The Java Verification Tool KeY:A Tutorial · FM (2) 2024 Scalability and precision by combining expressive type systems and deductive verification · Proc. ACM Program. Lang. 2021 |
Program verification › code-level verification
java verification |
0.8 | 1 | 2024 | The Java Verification Tool KeY:A Tutorial · FM (2) 2024 |
Logic in computer science › modal logic
dynamic logic |
0.2 | 1 | 2024 | The Java Verification Tool KeY:A Tutorial · FM (2) 2024 |
Programming languages and type systems
specification language |
0.1 | 1 | 2021 | Scalability and precision by combining expressive type systems and deductive verification · Proc. ACM Program. Lang. 2021 |
Methods — techniques the papers use, named apart from their topics
symbolic execution · 1.5sequent calculus · 1.5type checking · 0.5deductive verification · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | The Java Verification Tool KeY:A TutorialabstractAbstract The KeY tool is a state-of-the-art deductive program verifier for the Java language. Its verification engine is based on a sequent calculus for dynamic logic, realizing forward symbolic execution of the target program, whereby all symbolic paths through a program are explored. Method contracts make verification scalable. KeY combines auto-active and fine-grained proof interaction, which is possible both at the level of the verification target and its specification, as well as at the level of proof rules and program logic. This makes KeY well-suited for teaching program verification, but also permits proof debugging at the source code level. The latter made it possible to verify some of the most complex Java code to date. The article provides a self-contained introduction to the working principles and the practical usage of KeY for anyone with basic knowledge in logic and formal methods. Bernhard Beckert, Richard Bubel, Daniel Drodt, Reiner Hähnle, Florian Lanzinger, Wolfram Pfeifer, Mattias Ulbrich, Alexander Weigl |
FM (2) | 5 |
| 2023 | Scalable and Precise Refinement Types for Imperative Languages
Florian Lanzinger, Joshua Bachmeier, Mattias Ulbrich, Werner Dietl |
iFM | 1 |
| 2022 | A Refactoring for Data Minimisation Using Formal Verification
Florian Lanzinger, Mattias Ulbrich, Alexander Weigl |
ISoLA (2) | 1 |
| 2021 | Scalability and precision by combining expressive type systems and deductive verificationabstractType systems and modern type checkers can be used very successfully to obtain formal correctness guarantees with little specification overhead. However, type systems in practical scenarios have to trade precision for decidability and scalability. Tools for deductive verification, on the other hand, can prove general properties in more cases than a typical type checker can, but they do not scale well. We present a method to complement the scalability of expressive type systems with the precision of deductive program verification approaches. This is achieved by translating the type uses whose correctness the type checker cannot prove into assertions in a specification language, which can be dealt with by a deductive verification tool. Type uses whose correctness the type checker can prove are instead turned into assumptions to aid the verification tool in finding a proof.Our novel approach is introduced both conceptually for a simple imperative language, and practically by a concrete implementation for the Java programming language. The usefulness and power of our approach has been evaluated by discharging known false positives from a real-world program and by a small case study. Florian Lanzinger, Alexander Weigl, Mattias Ulbrich, Werner Dietl |
Proc. ACM Program. Lang. | 1 |