Vincent Langenfeld

dblp:165/2691 · DBLP profile ↗
← Back
11ranked-venue papers
5as first author
6since 2021 · last 2026
0000-0001-9835-6790ORCID · verified

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

Software engineering, systems software and programming languages · 8 · 2 first-author · 5 since 2021Artificial intelligence and machine learning · 3 · 3 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 3 · 3 first-author · 1 since 2021Theory of computation · 1
YearPublicationVenuePosition
2026 A Practical and Complete Method for Detecting rt-Inconsistencies in Real-Time Requirements
Nico Hauff, Elisabeth Henkel, Elisabeth Fünfgeld, Vincent Langenfeld, Andreas Podelski
REFSQ4
2026 Automata-Represented Requirements in HanforPL - A Visual Approach for Requirements Engineering Practice and Formal Reasoning
Tobias Kolzer, Vincent Langenfeld, Nico Hauff, Elisabeth Henkel, Andreas Podelski
REFSQ2
2024 Scalable Redundancy Detection for Real-Time Requirements
abstract
Describing a system in a requirements specification demands correctness and conciseness. Requirements are redundant if they are stated multiple times throughout a specification (explicitly or implicitly). In contrast to vacuity, redundancies do not inherently indicate specification defects, and are sometimes even inevitable to adequately follow safety practices. However, intended redundancies have to be managed to avoid subsequent errors. Unintended redundancies often hint to defects in the requirements specification. We present an analysis for redundancies in formal real-time requirements specifications based on automata theoretical model checking. To enable this analysis, we introduce a determinism preserving totalization and complement procedure for the timed automaton model of Phase Event Automata. We state the redundancy check for a set of real-time requirements as a program analysis task. Benchmarks show the viability of our approach to analyse requirements sets of industrial size and complexity: the analysis scales well on industrial sets, interesting redundancies both from requirements and as a formalisation artefact were found.
Elisabeth Henkel, Nico Hauff, Lena Funk, Vincent Langenfeld, Andreas Podelski
RE4
2024 Systematic adaptation and investigation of the understandability of a formal pattern language
abstract
Abstract Formal pattern languages are used in industry to communicate and analyse requirements, as they are said to be both machine-readable and intuitively understandable for humans. The questions arise to what extent this intuitive understanding of a pattern language is in agreement with its formal semantics and whether this understanding can be increased systematically. We present two consecutive empirical experiments to address these questions. The formal semantics serves as an objective judge on the intuitive understanding. Our experiments confirm the practical usefulness of HanforPL insofar the intuition matches the formal semantics in most practically relevant cases. They also reveal a number of edge cases where even a prior exposure to formal logic is not a guarantee for correct understanding. We present and validate systematic adjustments to the patterns, leading to several large increases in understandability but come at the cost of new, but less impactful ambiguities. We demonstrate how an inquiry on the alignment of the intuitive and formal semantics of a pattern language can help to understand and improve the language. While results regarding the understandability of HanforPL are favourable in commonly used cases, there is potential for improvement. The systematic adaption of patterns shows that small modifications may have large effects on the alignment of formal and intuitive semantics, and that modification must be considered with caution in the context of the respective pattern to avoid unintentionally adding new ambiguities. This article is an extension of our published REFSQ paper.
Elisabeth Henkel, Nico Hauff, Vincent Langenfeld, Lukas Eber, Andreas Podelski
Requir. Eng.3
2023 An Empirical Study of the Intuitive Understanding of a Formal Pattern Language
Elisabeth Henkel, Nico Hauff, Lukas Eber, Vincent Langenfeld, Andreas Podelski
REFSQ4
2021 A Formal Operational Model of ACT-R: Structure and Behaviour
Vincent Langenfeld, Bernd Westphal, Andreas Podelski
CogSci1
2019 On Formal Verification of ACT-R Architectures and Models
Vincent Langenfeld, Bernd Westphal, Andreas Podelski
CogSci1
2019 Scalable Analysis of Real-Time Requirements
abstract
Detecting issues in real-time requirements is usually a trade-off between flexibility and cost: the effort expended depends on how expensive it is to fix a defect introduced by faulty, ambiguous or incomplete requirements. The most rigorous techniques for real-time requirement analysis depend on the formalisation of these requirements. Completely formalised real-time requirements allow the detection of issues that are hard to find through other means, like real-time inconsistency (i.e., "do the requirements lead to deadlocks and starvation of the system?") or vacuity (i.e., "are some requirements trivially satisfied"). Current analysis techniques for real-time requirements suffer from scalability issues - larger sets of such requirements are usually intractable. We present a new technique to analyse formalised real-time requirements for various properties. Our technique leverages recent advances in software model checking and automatic theorem proving by converting the analysis problem for real-time requirements to a program analysis task. We also report preliminary results from an ongoing, large scale application of our technique in the automotive domain at Bosch.
Vincent Langenfeld, Daniel Dietsch, Bernd Westphal, Jochen Hoenicke, Amalinda Post
RE1
2018 But does it really do that? Using formal analysis to ensure desirable ACT-R model behaviour
Vincent Langenfeld, Bernd Westphal, Rebecca Albrecht, Andreas Podelski
CogSci1
2016 Requirements Defects over a Project Lifetime: An Empirical Analysis of Defect Data from a 5-Year Automotive Project at Bosch
Vincent Langenfeld, Amalinda Post, Andreas Podelski
REFSQ1
2015 Fairness Modulo Theory: A New Approach to LTL Software Model Checking
Daniel Dietsch, Matthias Heizmann, Vincent Langenfeld, Andreas Podelski
CAV (1)3