VLDB 2026 Research / reviewers in the wild / expert
Frank Zimmer
dblp:89/6569
· DBLP profile ↗
23ranked-venue papers
0as first author
7since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 12 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 5 · 2 since 2021Human-computer interaction and ubiquitous computing · 5 · 2 since 2021Artificial intelligence and machine learning · 3 · 2 since 2021Computer networks · 2 · 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.
| Artificial intelligence
3 papers |
Reinforcement learning · 100% | |
| Software engineering, system software, and programming languages
5 papers |
Requirements engineering and software design · 60% Software testing · 32% Software maintenance and evolution · 8% | |
| Computer networks
1 paper |
Vehicular, aerial and satellite networks · 77% Physical-layer communications · 23% |
Topics — the 15 heaviest of 18, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning
partially observable reinforcement learning |
1.5 | 2 | 2025 | Memory Gym: Towards Endless Tasks to Benchmark Memory Capabilities of Agents · J. Mach. Learn. Res. 2025 Memory Gym: Partially Observable Challenges to Memory-Based Agents · ICLR 2023 |
Machine learning › Reinforcement learning
deep reinforcement learning |
0.9 | 1 | 2025 | Memory Gym: Towards Endless Tasks to Benchmark Memory Capabilities of Agents · J. Mach. Learn. Res. 2025 |
Machine learning › Reinforcement learning › partially observable reinforcement learning
memory-based reinforcement learning |
0.9 | 1 | 2025 | Memory Gym: Towards Endless Tasks to Benchmark Memory Capabilities of Agents · J. Mach. Learn. Res. 2025 |
Machine learning › Reinforcement learning › partially observable reinforcement learning › memory-based reinforcement learning
memory-augmented agent |
0.7 | 1 | 2023 | Memory Gym: Partially Observable Challenges to Memory-Based Agents · ICLR 2023 |
Requirements engineering and software design › requirements specification
natural language requirements |
0.6 | 3 | 2015 | Automated Checking of Conformance to Requirements Templates Using Natural Language Processing · IEEE Trans. Software Eng. 2015 NARCIA: an automated tool for change impact analysis in natural language requirements · ESEC/SIGSOFT FSE 2015 RUBRIC: a flexible tool for automated checking of conformance to requirement boilerplates · ESEC/SIGSOFT FSE 2013 |
Vehicular, aerial and satellite networks
satellite communication |
0.3 | 1 | 2018 | Centralized Rainfall Estimation Using Carrier to Noise of Satellite Communication Links · IEEE J. Sel. Areas Commun. 2018 |
Software testing › software validation
acceptance testing |
0.3 | 1 | 2018 | Test case prioritization for acceptance testing of cyber physical systems: a multi-objective search-based approach · ISSTA 2018 |
Software testing › regression testing
test case prioritization |
0.3 | 1 | 2018 | Test case prioritization for acceptance testing of cyber physical systems: a multi-objective search-based approach · ISSTA 2018 |
Machine learning › Reinforcement learning › reinforcement learning environment
benchmark environments |
0.3 | 1 | 2025 | Memory Gym: Towards Endless Tasks to Benchmark Memory Capabilities of Agents · J. Mach. Learn. Res. 2025 |
Software maintenance and evolution
change impact analysis |
0.2 | 1 | 2015 | NARCIA: an automated tool for change impact analysis in natural language requirements · ESEC/SIGSOFT FSE 2015 |
Software testing › protocol testing
conformance checking |
0.2 | 1 | 2015 | Automated Checking of Conformance to Requirements Templates Using Natural Language Processing · IEEE Trans. Software Eng. 2015 |
Requirements engineering and software design
requirements analysis |
0.2 | 1 | 2015 | NARCIA: an automated tool for change impact analysis in natural language requirements · ESEC/SIGSOFT FSE 2015 |
Requirements engineering and software design
requirements specification |
0.2 | 1 | 2015 | Automated Checking of Conformance to Requirements Templates Using Natural Language Processing · IEEE Trans. Software Eng. 2015 |
Requirements engineering and software design › requirements quality
ambiguity detection |
0.2 | 1 | 2013 | RUBRIC: a flexible tool for automated checking of conformance to requirement boilerplates · ESEC/SIGSOFT FSE 2013 |
Embedded and real-time systems
cyber-physical systems |
0.1 | 1 | 2018 | Test case prioritization for acceptance testing of cyber physical systems: a multi-objective search-based approach · ISSTA 2018 |
Methods — techniques the papers use, named apart from their topics
natural language processing · 1.1proximal policy optimization · 0.9gated recurrent unit · 0.9Transformer-XL · 0.9test case minimization · 0.7reinforcement learning · 0.7multi-objective search · 0.7pattern matching · 0.4feature extraction · 0.3artificial neural network · 0.3clustering · 0.3text chunking · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Pokémon Red via Reinforcement LearningabstractWe present a Deep Reinforcement Learning (DRL) agent that successfully completes the first several hours of Pokémon Red, a classic Game Boy JRPG that exposes significant challenges as a testbed for agents, including multitasking, long horizons of tens of thousands of steps, hard exploration, and a vast array of potential policies. Our agent completes an initial segment of the game, up to Cerulean City, a location requiring progression through two cities, battle-filled passages, a maze-like cave, and defeating the first gym leader. Our experiments include various ablations that reveal vulnerabilities in reward shaping. We argue that long-form games like Pokémon hold strong potential for future research, presenting long-term coherent reasoning challenges absent from simpler arcade games. Our environment wrapper, training algorithm, human replay data, and pretrained agent are available at (REDACTED FOR REVIEW). Marco Pleines, Daniel Addis, David Rubinstein, Frank Zimmer, Mike Preuss, Peter Whidden |
CoG | 4 |
| 2025 | Memory Gym: Towards Endless Tasks to Benchmark Memory Capabilities of AgentsabstractMemory Gym presents a suite of 2D partially observable environments, namely Mortar Mayhem, Mystery Path, and Searing Spotlights, designed to benchmark memory capabilities in decision-making agents. These environments, originally with finite tasks, are expanded into innovative, endless formats, mirroring the escalating challenges of cumulative memory games such as “I packed my bag”. This progression in task design shifts the focus from merely assessing sample efficiency to also probing the levels of memory effectiveness in dynamic, prolonged scenarios. To address the gap in available memory-based Deep Reinforcement Learning baselines, we introduce an implementation within the open-source CleanRL library that integrates Transformer-XL (TrXL) with Proximal Policy Optimization. This approach utilizes TrXL as a form of episodic memory, employing a sliding window technique. Our comparative study between the Gated Recurrent Unit (GRU) and TrXL reveals varied performances across our finite and endless tasks. TrXL, on the finite environments, demonstrates superior effectiveness over GRU, but only when utilizing an auxiliary loss to reconstruct observations. Notably, GRU makes a remarkable resurgence in all endless tasks, consistently outperforming TrXL by significant margins. Website and Source Code: https://marcometer.github.io/jmlr_2024.github.io/ Marco Pleines, Matthias Pallasch, Frank Zimmer, Mike Preuss |
J. Mach. Learn. Res. | 3 |
| 2023 | Memory Gym: Partially Observable Challenges to Memory-Based Agents
Marco Pleines, Matthias Pallasch, Frank Zimmer, Mike Preuss |
ICLR | 3 |
| 2022 | On the Verge of Solving Rocket League using Deep Reinforcement Learning and Sim-to-sim TransferabstractAutonomously trained agents that are supposed to play video games reasonably well rely either on fast simulation speeds or heavy parallelization across thousands of machines running concurrently. This work explores a third way that is established in robotics, namely sim-to-real transfer, or if the game is considered a simulation itself, sim-to-sim transfer. In the case of Rocket League, we demonstrate that single behaviors of goalies and strikers can be successfully learned using Deep Reinforcement Learning in the simulation environment and transferred back to the original game. Although the implemented training simulation is to some extent inaccurate, the goalkeeping agent saves nearly 100% of its faced shots once transferred, while the striking agent scores in about 75% of cases. Therefore, the trained agent is robust enough and able to generalize to the target domain of Rocket League. Marco Pleines, Konstantin Ramthun, Yannik Wegener, Hendrik Meyer, Matthias Pallasch, Sebastian Prior, Jannik Drögemüller, Leon Büttinghaus, Thilo Röthemeyer, Alexander Kaschwig, Oliver Chmurzynski, Frederik Rohkrähmer, Roman Kalkreuth, Frank Zimmer, Mike Preuss |
CoG | 14 |
| 2022 | NB-IoT via LEO Satellites: An Efficient Resource Allocation Strategy for Uplink Data TransmissionabstractIn this article, we focus on the use of low-Earth orbit (LEO) satellites providing the narrowband Internet of Things (NB-IoT) connectivity to the on-ground user equipments (UEs). Conventional resource allocation algorithms for the NB-IoT systems are particularly designed for terrestrial infrastructures, where devices are under the coverage of a specific base station (BS) and the whole system varies very slowly in time. The existing methods in the literature cannot be applied over LEO satellite-based NB-IoT systems for several reasons. First, with the movement of the LEO satellite, the corresponding channel parameters for each user will quickly change over time. Delaying the scheduling of a certain user would result in a resource allocation based on outdated parameters. Second, the differential Doppler shift, which is a typical impairment in communications over LEO, directly depends on the relative distance among users. Scheduling at the same radio frame users that overcome a certain distance would violate the differential Doppler limit supported by the NB-IoT standard. Third, the propagation delay over an LEO satellite channel is around 4–16 times higher compared to a terrestrial system, imposing the need for message exchange minimization between the users and the BS. In this work, we propose a novel uplink resource allocation strategy that jointly incorporates the new design considerations previously mentioned together with the distinct channel conditions, satellite coverage times, and data demands of various users on Earth. The novel methodology proposed in this article can act as a framework for future works in the field. Oltjon Kodheli, Nicola Maturo, Symeon Chatzinotas, Stefano Andrenacci, Frank Zimmer |
IEEE Internet Things J. | 5 |
| 2021 | SDN for Gateway Diversity Implementation in Satellite NetworksabstractThis paper studies the Gateway Diversity concept in a satellite scenario, using ONOS, Mininet and OpenSAND. ONOS is used as SDN controller, while Mininet and OpenSAND are used for network emulation and satellite network emulation, respectively. The ability and efficiency of ONOS SDN controller to switch the traffic, for example due to weather conditions, in real-time between two Gateways is presented. Furthermore, a method for allowing automatic instantiation of Gateway and restart of the OpenSAND simulation process promptly is analyzed. Finally, simulation results are shown for the evaluation of these technologies. Mario Minardi, Christos Politis, Frank Zimmer, Symeon Chatzinotas |
ISNCC | 3 |
| 2021 | Uncertainty-aware specification and analysis for hardware-in-the-loop testing of cyber-physical systemsabstractHardware-in-the-loop (HiL) testing is important for developing cyber-physical systems (CPS). HiL test cases manipulate hardware, are time-consuming and their behaviors are impacted by the uncertainties in the CPS environment. To mitigate the risks associated with HiL testing, engineers have to ensure that (1) test cases are well-behaved, e.g., they do not damage hardware, and (2) test cases can execute within a time budget. Leveraging the UML profile mechanism, we develop a domain-specific language, HITECS, for HiL test case specification. Using HITECS, we provide uncertainty-aware analysis methods to check the well-behavedness of HiL test cases. In addition, we provide a method to estimate the execution times of HiL test cases before the actual HiL testing. We apply HITECS to an industrial case study from the satellite domain. Our results show that: (1) HITECS helps engineers define more effective assertions to check HiL test cases, compared to the assertions defined without any systematic guidance; (2) HITECS verifies in practical time that HiL test cases are well-behaved; (3) HITECS is able to resolve uncertain parameters of HiL test cases by synthesizing conditions under which test cases are guaranteed to be well-behaved; and (4) HITECS accurately estimates HiL test case execution times. Seung Yeob Shin, Karim Chaouch, Shiva Nejati 0001, Mehrdad Sabetzadeh, Lionel C. Briand, Frank Zimmer |
J. Syst. Softw. | 6 |
| 2020 | Obstacle Tower Without Human Demonstrations: How Far a Deep Feed-Forward Network Goes with Reinforcement LearningabstractThe Obstacle Tower Challenge is the task to master a procedurally generated chain of levels that subsequently get harder to complete. Whereas the most top performing entries of last year's competition used human demonstrations or reward shaping to learn how to cope with the challenge, we present an approach that performed competitively (placed 7th) but starts completely from scratch by means of Deep Reinforcement Learning with a relatively simple feed-forward deep network structure. We especially look at the generalization performance of the taken approach concerning different seeds and various visual themes that have become available after the competition, and investigate where the agent fails and why. Note that our approach does not possess a short-term memory like employing recurrent hidden states. With this work, we hope to contribute to a better understanding of what is possible with a relatively simple, flexible solution that can be applied to learning in environments featuring complex 3D visual input where the abstract task structure itself is still fairly simple. Marco Pleines, Jenia Jitsev, Mike Preuss, Frank Zimmer |
CoG | 4 |
| 2020 | Immersive Language Exploration with Object Recognition and Augmented RealityabstractThe use of Augmented Reality (AR) in teaching and learning contexts for language is still young. The ideas are endless, the concrete educational offers available emerge only gradually. Educational opportunities that were unthinkable a few years ago are now feasible. We present a concrete realization: an executable application for mobile devices with which users can explore their environment interactively in different languages. The software recognizes up to 1000 objects in the user’s environment using a deep learning method based on Convolutional Neural Networks and names this objects accordingly. Using Augmented Reality the objects are superimposed with 3D information in different languages. By switching the languages, the user is able to interactively discover his surrounding everyday items in all languages. The application is available as Open Source. Benny Platte, Anett Platte, Christian Roschke, Rico Thomanek, Tony Rolletschke, Frank Zimmer, Marc Ritter |
LREC | 6 |
| 2019 | Action Spaces in Deep Reinforcement Learning to Mimic Human Input DevicesabstractEnabling agents to generally play video games requires to implement a common action space that mimics human input devices like a gamepad. Such action spaces have to support concurrent discrete and continuous actions. To solve this problem, this work investigates three approaches to examine the application of concurrent discrete and continuous actions in Deep Reinforcement Learning (DRL). One approach implements a threshold to discretize a continuous action, while another one divides a continuous action into multiple discrete actions. The third approach creates a multiagent to combine both action kinds. These approaches are benchmarked by two novel environments. In the first environment (Shooting Birds) the goal of the agent is to accurately shoot birds by controlling a cross-hair. The second environment is a simplification of the game Beastly Rivals On-slaught, where the agent is in charge of its controlled character's survival. Throughout multiple experiments, the bucket approach is recommended, because it is trained faster than the multiagent and is more stable than the threshold approach. Due to the contributions of this paper, consecutive work can start training agents using visual observations. Marco Pleines, Frank Zimmer, Vincent-Pierre Berges |
CoG | 2 |
| 2018 | Test case prioritization for acceptance testing of cyber physical systems: a multi-objective search-based approachabstractAcceptance testing validates that a system meets its requirements and determines whether it can be sufficiently trusted and put into operation. For cyber physical systems (CPS), acceptance testing is a hardware-in-the-loop process conducted in a (near-)operational environment. Acceptance testing of a CPS often necessitates that the test cases be prioritized, as there are usually too many scenarios to consider given time constraints. CPS acceptance testing is further complicated by the uncertainty in the environment and the impact of testing on hardware. We propose an automated test case prioritization approach for CPS acceptance testing, accounting for time budget constraints, uncertainty, and hardware damage risks. Our approach is based on multi-objective search, combined with a test case minimization algorithm that eliminates redundant operations from an ordered sequence of test cases. We evaluate our approach on a representative case study from the satellite domain. The results indicate that, compared to test cases that are prioritized manually by satellite engineers, our automated approach more than doubles the number of test cases that fit into a given time frame, while reducing to less than one third the number of operations that entail the risk of damage to key hardware components. Seung Yeob Shin, Shiva Nejati 0001, Mehrdad Sabetzadeh, Lionel C. Briand, Frank Zimmer |
ISSTA | 5 |
| 2018 | HITECS: A UML Profile and Analysis Framework for Hardware-in-the-Loop Testing of Cyber Physical SystemsabstractHardware-in-the-loop (HiL) testing is an important step in the development of cyber physical systems (CPS). CPS HiL test cases manipulate hardware components, are time-consuming and their behaviors are impacted by the uncertainties in the CPS environment. To mitigate the risks associated with HiL testing, engineers have to ensure that (1) HiL test cases are well-behaved, i.e., they implement valid test scenarios and do not accidentally damage hardware, and (2) HiL test cases can execute within the time budget allotted to HiL testing. This paper proposes an approach to help engineers systematically specify and analyze CPS HiL test cases. Leveraging the UML profile mechanism, we develop an executable domain-specific language, HITECS, for HiL test case specification. HITECS builds on the UML Testing Profile (UTP) and the UML action language (Alf). Using HITECS, we provide analysis methods to check whether HiL test cases are well-behaved, and to estimate the execution times of these test cases before the actual HiL testing stage. We apply HITECS to an industrial case study from the satellite domain. Our results show that: (1) HITECS is feasible to use in practice; (2) HITECS helps engineers define more complete and effective well-behavedness assertions for HiL test cases, compared to when these assertions are defined without systematic guidance; (3) HITECS verifies in practical time that HiL test cases are well-behaved; and (4) HITECS accurately estimates HiL test case execution times. Seung Yeob Shin, Karim Chaouch, Shiva Nejati 0001, Mehrdad Sabetzadeh, Lionel C. Briand, Frank Zimmer |
MoDELS | 6 |
| 2018 | Centralized Rainfall Estimation Using Carrier to Noise of Satellite Communication LinksabstractIn this paper, we present a centralized method for real-time rainfall estimation using carrier-to-noise power ratio ($C/N$) measurements from broadband satellite communication networks. The$C/N$data of both forward link and return link are collected by the gateway station from the user terminals in the broadband satellite communication network and stored in a database. The$C/N$for such Ka-band scenarios is impaired mainly by the rainfall. Using signal processing and machine learning techniques, we develop an algorithm for real-time rainfall estimation. Extracting relevant features from$C/N$, we use artificial neural network in order to distinguish the rain events from dry events. We then determine the signal attenuation corresponding to the rain events and examine an empirical relationship between rainfall rate and signal attenuation. Experimental results are promising and prove the high potential of satellite communication links for real environment monitoring, particularly rainfall estimation. Ahmad Gharanjik, Bhavani Shankar, Frank Zimmer, Björn Ottersten 0001 |
IEEE J. Sel. Areas Commun. | 3 |
| 2017 | RheijnLand.Xperiences - A Storytelling Framework for Cross-Museum Experiences
Timo Kahl, Ido Iurgel, Frank Zimmer, René Bakker, Koen van Turnhout |
ICIDS | 3 |
| 2017 | Automated Extraction and Clustering of Requirements Glossary TermsabstractA glossary is an important part of any software requirements document. By making explicit the technical terms in a domain and providing definitions for them, a glossary helps mitigate imprecision and ambiguity. A key step in building a glossary is to decide upon the terms to include in the glossary and to find any related terms. Doing so manually is laborious, particularly for large requirements documents. In this article, we develop an automated approach for extracting candidate glossary terms and their related terms from natural language requirements documents. Our approach differs from existing work on term extraction mainly in that itclustersthe extracted terms by relevance, instead of providing a flat list of terms. We provide an automated, mathematically-based procedure for selecting the number of clusters. This procedure makes the underlying clustering algorithm transparent to users, thus alleviating the need for any user-specified parameters. To evaluate our approach, we report on three industrial case studies, as part of which we also examine the perceptions of the involved subject matter experts about the usefulness of our approach. Our evaluation notably suggests that: (1) Over requirements documents, our approach is more accurate than major generic term extraction tools. Specifically, in our case studies, our approach leads to gains of 20 percent or more in terms of recall when compared to existing tools, while at the same time either improving precision or leaving it virtually unchanged. And, (2) the experts involved in our case studies find the clusters generated by our approach useful as an aid for glossary construction. Chetan Arora 0002, Mehrdad Sabetzadeh, Lionel C. Briand, Frank Zimmer |
IEEE Trans. Software Eng. | 4 |
| 2016 | Extracting domain models from natural-language requirements: approach and industrial evaluation
Chetan Arora 0002, Mehrdad Sabetzadeh, Lionel C. Briand, Frank Zimmer |
MoDELS | 4 |
| 2015 | Change impact analysis for Natural Language requirements: An NLP approachabstractRequirements are subject to frequent changes as a way to ensure that they reflect the current best understanding of a system, and to respond to factors such as new and evolving needs. Changing one requirement in a requirements specification may warrant further changes to the specification, so that the overall correctness and consistency of the specification can be maintained. A manual analysis of how a change to one requirement impacts other requirements is time-consuming and presents a challenge for large requirements specifications. We propose an approach based on Natural Language Processing (NLP) for analyzing the impact of change in Natural Language (NL) requirements. Our focus on NL requirements is motivated by the prevalent use of these requirements, particularly in industry. Our approach automatically detects and takes into account the phrasal structure of requirements statements. We argue about the importance of capturing the conditions under which change should propagate to enable more accurate change impact analysis. We propose a quantitative measure for calculating how likely a requirements statement is to be impacted by a change under given conditions. We conduct an evaluation of our approach by applying it to 14 change scenarios from two industrial case studies. Chetan Arora 0002, Mehrdad Sabetzadeh, Arda Goknil, Lionel C. Briand, Frank Zimmer |
RE | 5 |
| 2015 | NARCIA: an automated tool for change impact analysis in natural language requirementsabstractWe present NARCIA, a tool for analyzing the impact of change in natural language requirements. For a given change in a requirements document, NARCIA calculates quantitative scores suggesting how likely each requirements statement in the document is to be impacted. These scores, computed using Natural Language Processing (NLP), are used for sorting the requirements statements, enabling the user to focus on statements that are most likely to be impacted. To increase the accuracy of change impact analysis, NARCIA provides a mechanism for making explicit the rationale behind changes. NARCIA has been empirically evaluated on two industrial case studies. The results of this evaluation are briefly highlighted. Chetan Arora 0002, Mehrdad Sabetzadeh, Arda Goknil, Lionel C. Briand, Frank Zimmer |
ESEC/SIGSOFT FSE | 5 |
| 2015 | Automated Checking of Conformance to Requirements Templates Using Natural Language ProcessingabstractTemplates are effective tools for increasing the precision of natural language requirements and for avoiding ambiguities that may arise from the use of unrestricted natural language. When templates are applied, it is important to verify that the requirements are indeed written according to the templates. If done manually, checking conformance to templates is laborious, presenting a particular challenge when the task has to be repeated multiple times in response to changes in the requirements. In this article, using techniques from natural language processing (NLP), we develop an automated approach for checking conformance to templates. Specifically, we present a generalizable method for casting templates into NLP pattern matchers and reflect on our practical experience implementing automated checkers for two well-known templates in the requirements engineering community. We report on the application of our approach to four case studies. Our results indicate that: (1) our approach provides a robust and accurate basis for checking conformance to templates; and (2) the effectiveness of our approach is not compromised even when the requirements glossary terms are unknown. This makes our work particularly relevant to practice, as many industrial requirements documents have incomplete glossaries. Chetan Arora 0002, Mehrdad Sabetzadeh, Lionel C. Briand, Frank Zimmer |
IEEE Trans. Software Eng. | 4 |
| 2014 | Improving requirements glossary construction via clustering: approach and industrial case studiesabstractContext. A glossary is an important part of any software requirements document. By making explicit the technical terms in a domain and providing definitions for them, a glossary serves as a helpful tool for mitigating ambiguities. Chetan Arora 0002, Mehrdad Sabetzadeh, Lionel C. Briand, Frank Zimmer |
ESEM | 4 |
| 2013 | Automatic Checking of Conformance to Requirement Boilerplates via Text Chunking: An Industrial Case StudyabstractContext, Boilerplates have long been used in Requirements Engineering (RE) to increase the precision of natural language requirements and to avoid ambiguity problems caused by unrestricted natural language. When boilerplates are used, an important quality assurance task is to verify that the requirements indeed conform to the boilerplates. Objective. If done manually, checking conformance to boilerplates is laborious, presenting a particular challenge when the task has to be repeated multiple times in response to requirements changes. Our objective is to provide automation for checking conformance to boilerplates using a Natural Language Processing (NLP) technique, called Text Chunking, and to empirically validate the effectiveness of the automation. Method. We use an exploratory case study, conducted in an industrial setting, as the basis for our empirical investigation. Results. We present a generalizable and tool-supported approach for boilerplate conformance checking. We report on the application of our approach to the requirements document for a major software component in the satellite domain. We compare alternative text chunking solutions and argue about their effectiveness for boilerplate conformance checking. Conclusion. Our results indicate that: (1) text chunking provides a robust and accurate basis for checking conformance to boilerplates, and (2) the effectiveness of boilerplate conformance checking based on text chunking is not compromised even when the requirements glossary terms are unknown. This makes our work particularly relevant to practice, as many industrial requirements documents have incomplete glossaries. Chetan Arora 0002, Mehrdad Sabetzadeh, Lionel C. Briand, Frank Zimmer, Raul Gnaga |
ESEM | 4 |
| 2013 | RUBRIC: a flexible tool for automated checking of conformance to requirement boilerplatesabstractUsing requirement boilerplates is an effective way to mit- igate many types of ambiguity in Natural Language (NL) requirements and to enable more automated transformation and analysis of these requirements. When requirements are expressed using boilerplates, one must check, as a first qual- ity assurance measure, whether the requirements actually conform to the boilerplates. If done manually, boilerplate conformance checking can be laborious, particularly when requirements change frequently. We present RUBRIC (Re- qUirements BoileRplate sanIty Checker), a flexible tool for automatically checking NL requirements against boilerplates for conformance. RUBRIC further provides a range of di- agnostics to highlight potentially problematic syntactic con- structs in NL requirement statements. RUBRIC is based on a Natural Language Processing (NLP) technique, known as text chunking. A key advantage of RUBRIC is that it yields highly accurate results even in early stages of requirements writing, where a requirements glossary may be unavailable or only partially specified. RUBRIC is scalable and can be applied repeatedly to large sets of requirements as they evolve. The tool has been validated through an industrial case study which we outline briefly in the paper. Chetan Arora 0002, Mehrdad Sabetzadeh, Lionel C. Briand, Frank Zimmer, Raul Gnaga |
ESEC/SIGSOFT FSE | 4 |
| 2002 | The Reference Point Method: Requirements-Based ICT Convergence Solution DevelopmentabstractThe Reference Point Method has been developed by T-Systems as an overall approach for making the complexity in developing ICT convergence solutions manageable. It is based heavily on requirements engineering at the level of business process architecture, technology neutral architecture, technology specific architecture, and telecom architecture. The integration of all these architecture levels is realized by special interfaces at each level called reference points. This method touches the areas of software architecture design and requirements engineering and emphasizes the integration of both. First, it is used to investigate the needed business processes and to get a first insight into the needed system landscape. Then, the corresponding results provide the basis for the operative planning of the ICT systems. Wolfgang Groß, Torsten Meyer, Frank Zimmer, Claus Herrmann |
RE | 3 |