TY - CONF AB - For optimal placement and orchestration of network services, it is crucial that their structure and semantics are specified clearly and comprehensively and are available to an orchestrator. Existing specification approaches are either ambiguous or miss important aspects regarding the behavior of virtual network functions (VNFs) forming a service. We propose to formally and unambiguously specify the behavior of these functions and services using Queuing Petri Nets (QPNs). QPNs are an established method that allows to express queuing, synchronization, stochastically distributed processing delays, and changing traffic volume and characteristics at each VNF. With QPNs, multiple VNFs can be connected to complete network services in any structure, even specifying bidirectional network services containing loops. We discuss how management and orchestration systems can benefit from our clear and comprehensive specification approach, leading to better placement of VNFs and improved Quality of Service. Another benefit of formally specifying network services with QPNs are diverse analysis options, which allow valuable insights such as the distribution of end-to-end delay. We propose a tool-based workflow that supports the specification of network services and the automatic generation of corresponding simulation code to enable an in-depth analysis of their behavior and performance. AU - Schneider, Stefan Balthasar AU - Sharma, Arnab AU - Karl, Holger AU - Wehrheim, Heike ID - 3287 T2 - 2019 IFIP/IEEE International Symposium on Integrated Network Management (IM) TI - Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets ER - TY - GEN AU - Sharma, Arnab AU - Wehrheim, Heike ID - 7752 SN - 978-3-88579-686-2 T2 - Proceedings of the Software Engineering Conference (SE) TI - Testing Balancedness of ML Algorithms VL - P-292 ER - TY - GEN AU - Zhang, Shikun ID - 7623 TI - Combining Android Apps for Analysis Purposes ER - TY - CONF AU - Sharma, Arnab AU - Wehrheim, Heike ID - 7635 T2 - IEEE International Conference on Software Testing, Verification and Validation (ICST) TI - Testing Machine Learning Algorithms for Balanced Data Usage ER - TY - GEN AU - Haltermann, Jan Frederik ID - 12885 TI - Analyzing Data Usage in Array Programs ER - TY - CONF AB - In the field of software analysis a trade-off between scalability and accuracy always exists. In this respect, Android app analysis is no exception, in particular, analyzing large or many apps can be challenging. Dealing with many small apps is a typical challenge when facing micro-benchmarks such as DROIDBENCH or ICC-BENCH. These particular benchmarks are not only used for the evaluation of novel tools but also in continuous integration pipelines of existing mature tools to maintain and guarantee a certain quality-level. Considering this latter usage it becomes very important to be able to achieve benchmark results as fast as possible. Hence, benchmarks have to be optimized for this purpose. One approach to do so is app merging. We implemented the Android Merge Tool (AMT) following this approach and show that its novel aspects can be used to produce scaled up and accurate benchmarks. For such benchmarks Android app analysis tools do not suffer from the scalability-accuracy trade-off anymore. We show this throughout detailed experiments on DROIDBENCH employing three different analysis tools (AMANDROID, ICCTA, FLOWDROID). Benchmark execution times are largely reduced without losing benchmark accuracy. Moreover, we argue why AMT is an advantageous successor of the state-of-the-art app merging tool (APKCOMBINER) in analysis lift-up scenarios. AU - Pauck, Felix AU - Zhang, Shikun ID - 15838 KW - Program Analysis KW - Android App Analysis KW - Taint Analysis KW - App Merging KW - Benchmark SN - 9781728141367 T2 - 2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW) TI - Android App Merging for Benchmark Speed-Up and Analysis Lift-Up ER - TY - CONF AU - Derrick, John AU - Doherty, Simon AU - Dongol, Brijesh AU - Schellhorn, Gerhard AU - Wehrheim, Heike ED - H. ter Beek, Maurice ED - McIver, Annabelle ED - N. Oliveira, Jos{\'{e}} ID - 16215 T2 - Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings TI - Verifying Correctness of Persistent Concurrent Data Structures VL - 11800 ER - TY - JOUR AU - Russo, Alessandra AU - Schürr, Andy AU - Wehrheim, Heike ID - 16216 IS - 5 JF - Formal Asp. Comput. TI - Editorial VL - 31 ER - TY - JOUR AU - Fränzle, Martin AU - Kapur, Deepak AU - Wehrheim, Heike AU - Zhan, Naijun ID - 16217 IS - 1 JF - Formal Asp. Comput. TI - Editorial VL - 31 ER - TY - CHAP AU - Beyer, Dirk AU - Jakobs, Marie-Christine ID - 13872 SN - 0302-9743 T2 - Fundamental Approaches to Software Engineering TI - CoVeriTest: Cooperative Verifier-Based Testing ER - TY - CONF AU - Derrick, John AU - Doherty, Simon AU - Dongol, Brijesh AU - Schellhorn, Gerhard AU - Wehrheim, Heike ID - 13993 T2 - Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings TI - Verifying Correctness of Persistent Concurrent Data Structures ER - TY - JOUR AU - Fränzle, Martin AU - Kapur, Deepak AU - Wehrheim, Heike AU - Zhan, Naijun ID - 10011 IS - 1 JF - Formal Asp. Comput. TI - Editorial VL - 31 ER - TY - CONF AU - König, Jürgen AU - Wehrheim, Heike ED - M. Badger, Julia ED - Yvonne Rozier, Kristin ID - 10091 T2 - {NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings TI - Data Independence for Software Transactional Memory VL - 11460 ER - TY - CONF AU - Doherty, Simon AU - Dongol, Brijesh AU - Wehrheim, Heike AU - Derrick, John ED - K. Hollingsworth, Jeffrey ED - Keidar, Idit ID - 10092 T2 - Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019 TI - Verifying C11 programs operationally ER - TY - CONF AU - Beyer, Dirk AU - Jakobs, Marie-Christine AU - Lemberger, Thomas AU - Wehrheim, Heike ED - Becker, Steffen ED - Bogicevic, Ivan ED - Herzwurm, Georg ED - Wagner, Stefan ID - 10093 T2 - Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019 TI - Combining Verifiers in Conditional Model Checking via Reducers VL - P-292 ER - TY - CONF AU - Sharma, Arnab AU - Wehrheim, Heike ED - Becker, Steffen ED - Bogicevic, Ivan ED - Herzwurm, Georg ED - Wagner, Stefan ID - 10094 T2 - Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019 TI - Testing Balancedness of ML Algorithms VL - {P-292} ER - TY - CONF AU - Richter, Cedric AU - Wehrheim, Heike ED - Beyer, Dirk ED - Huisman, Marieke ED - Kordon, Fabrice ED - Steffen, Bernhard ID - 10095 T2 - Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III} TI - PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution) VL - 11429 ER - TY - GEN AU - Haltermann, Jan ID - 10105 TI - Analyzing Data Usage in Array Programs ER - TY - CONF AB - Recent years have seen the development of numerous tools for the analysis of taint flows in Android apps. Taint analyses aim at detecting data leaks, accidentally or by purpose programmed into apps. Often, such tools specialize in the treatment of specific features impeding precise taint analysis (like reflection or inter-app communication). This multitude of tools, their specific applicability and their various combination options complicate the selection of a tool (or multiple tools) when faced with an analysis instance, even for knowledgeable users, and hence hinders the successful adoption of taint analyses. In this work, we thus present CoDiDroid, a framework for cooperative Android app analysis. CoDiDroid (1) allows users to ask questions about flows in apps in varying degrees of detail, (2) automatically generates subtasks for answering such questions, (3) distributes tasks onto analysis tools (currently DroidRA, FlowDroid, HornDroid, IC3 and two novel tools) and (4) at the end merges tool answers on subtasks into an overall answer. Thereby, users are freed from having to learn about the use and functionality of all these tools while still being able to leverage their capabilities. Moreover, we experimentally show that cooperation among tools pays off with respect to effectiveness, precision and scalability. AU - Pauck, Felix AU - Wehrheim, Heike ID - 10108 KW - Android Taint Analysis KW - Cooperation KW - Precision KW - Tools SN - 978-1-4503-5572-8 T2 - Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering TI - Together Strong: Cooperative Android App Analysis ER - TY - CONF AU - Isenberg, Tobias AU - Jakobs, Marie-Christine AU - Pauck, Felix AU - Wehrheim, Heike ID - 13874 T2 - Tests and Proofs - 13th International Conference, {TAP} 2019, Held as Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings TI - When Are Software Verification Results Valid for Approximate Hardware? ER -