Dennis Reuling
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Dennis Reuling has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
Johannes Bürdek
Real-Time Systems Lab, TU Darmstadt, Darmstadt, Germany
2 shared publications- Malte Lochau
University of Siegen
2 shared publications - Udo Kelter
University of Siegen
2 shared publications - Andy Schürr
Real-Time Systems Lab, Technical University of Darmstadt, Darmstadt, Germany
1 shared publication - Andy Schürr
TU Darmstadt
1 shared publication - Johannes Bürdek
TU Darmstadt
1 shared publication
Latest Publications
- Open Access
- 18 July 2019
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Software Engineering and Methodology
- Vol. 28 (3) , 1-59
Automated N-way Program Merging for Facilitating Family-based Analyses of Variant-rich Software
Nowadays software tends to come in many different, yet similar variants, often derived from a common code base via clone-and-own. Family-based-analysis strategies have recently shown very promising potential for improving efficiency in applying quality-assurance techniques to such variant-rich programs, as compared to variant-by-variant approaches. Unfortunately, these strategies require a single program representation superimposing all program variants in a syntactically well-formed, semantically sound, and variant-preserving manner, which is usually not available and manually hard to obtain in practice. In this article, we present a novel methodology, called S i MPOSE, for automatically generating superimpositions of existing program variants to facilitate family-based analyses of variant-rich software. To this end, we propose a novel N-way model-merging methodology to integrate the control-flow automaton (CFA) representations of N given variants of a C program into one unified CFA representation. CFA constitute a unified program abstraction used by many recent software-analysis tools for automated quality assurance. To cope with the inherent complexity of N-way model-merging, our approach (1) utilizes principles of similarity-propagation to reduce the number of potential N-way matches, and (2) enables us to decompose a set of N variants into arbitrary subsets and to incrementally derive an N-way superimposition from partial superimpositions. We apply our tool implementation of S i MPOSE to a selection of realistic C programs, frequently considered for experimental evaluation of program-analysis techniques. In particular, we investigate applicability and efficiency/effectiveness trade-offs of our approach by applying S i MPOSE in the context of family-based unit-test generation as well as model-checking as sample program-analysis techniques. Our experimental results reveal very impressive efficiency improvements by an average factor of up to 2.6 for test-generation and up to 2.4 for model-checking under stable effectiveness, as compared to variant-by-variant approaches, thus amortizing the additional effort required for merging. In addition, our results show that merging all N variants at once produces, in almost all cases, clearly more precise results than incremental step-wise 2-way merging. Finally, our comparison with major existing N-way merging techniques shows that S i MPOSE constitutes, in most cases, the best efficiency/effectiveness trade-off.
- 18 July 2019
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Software Engineering and Methodology
- Vol. 28 (3) , 1-59
Open AccessAutomated N-way Program Merging for Facilitating Family-based Analyses of Variant-rich Software
Nowadays software tends to come in many different, yet similar variants, often derived from a common code base via clone-and-own. Family-based-analysis strategies have recently shown very promising potential for improving efficiency in applying quality-assurance techniques to such variant-rich programs, as compared to variant-by-variant approaches. Unfortunately, these strategies require a single program representation superimposing all program variants in a syntactically well-formed, semantically sound, and variant-preserving manner, which is usually not available and manually hard to obtain in practice. In this article, we present a novel methodology, called S i MPOSE, for automatically generating superimpositions of existing program variants to facilitate family-based analyses of variant-rich software. To this end, we propose a novel N-way model-merging methodology to integrate the control-flow automaton (CFA) representations of N given variants of a C program into one unified CFA representation. CFA constitute a unified program abstraction used by many recent software-analysis tools for automated quality assurance. To cope with the inherent complexity of N-way model-merging, our approach (1) utilizes principles of similarity-propagation to reduce the number of potential N-way matches, and (2) enables us to decompose a set of N variants into arbitrary subsets and to incrementally derive an N-way superimposition from partial superimpositions. We apply our tool implementation of S i MPOSE to a selection of realistic C programs, frequently considered for experimental evaluation of program-analysis techniques. In particular, we investigate applicability and efficiency/effectiveness trade-offs of our approach by applying S i MPOSE in the context of family-based unit-test generation as well as model-checking as sample program-analysis techniques. Our experimental results reveal very impressive efficiency improvements by an average factor of up to 2.6 for test-generation and up to 2.4 for model-checking under stable effectiveness, as compared to variant-by-variant approaches, thus amortizing the additional effort required for merging. In addition, our results show that merging all N variants at once produces, in almost all cases, clearly more precise results than incremental step-wise 2-way merging. Finally, our comparison with major existing N-way merging techniques shows that S i MPOSE constitutes, in most cases, the best efficiency/effectiveness trade-off.
- 1 July 2019
- Published by AITO - Association Internationale pour les Technologies Objets in The Journal of Object Technology
- Vol. 18 (2) , 8:1
From Imprecise N-Way Model Matching to Precise N-Way Model Merging
- 1 July 2019
- Published by AITO - Association Internationale pour les Technologies Objets in The Journal of Object Technology
- Vol. 18 (2) , 8:1
From Imprecise N-Way Model Matching to Precise N-Way Model Merging
- Open Access
- 27 June 2019
- Published by Springer Nature
- p. 141-173
Model-Based Round-Trip Engineering and Testing of Evolving Software Product Lines
- 27 June 2019
- Published by Springer Nature
- p. 141-173
Open AccessModel-Based Round-Trip Engineering and Testing of Evolving Software Product Lines
- 12 October 2015
- Published by Springer Nature in Automated Software Engineering
- Vol. 23 (4) , 687-733
Reasoning about product-line evolution using complex feature model differences
- 12 October 2015
- Published by Springer Nature in Automated Software Engineering
- Vol. 23 (4) , 687-733
Reasoning about product-line evolution using complex feature model differences