TY - JOUR AU - Sharma, Arnab AU - Wehrheim, Heike ID - 20279 JF - CoRR TI - Testing Monotonicity of Machine Learning Models VL - abs/2002.12278 ER - TY - JOUR AU - Dalvandi, Sadegh AU - Doherty, Simon AU - Dongol, Brijesh AU - Wehrheim, Heike ID - 21016 IS - 2 JF - Dagstuhl Artifacts Ser. TI - Owicki-Gries Reasoning for C11 RAR (Artifact) VL - 6 ER - TY - CONF AU - Dalvandi, Sadegh AU - Doherty, Simon AU - Dongol, Brijesh AU - Wehrheim, Heike ED - Hirschfeld, Robert ED - Pape, Tobias ID - 21017 T2 - 34th European Conference on Object-Oriented Programming, {ECOOP} 2020, November 15-17, 2020, Berlin, Germany (Virtual Conference) TI - Owicki-Gries Reasoning for C11 RAR VL - 166 ER - TY - CONF AU - Richter, Cedric AU - Wehrheim, Heike ID - 21018 T2 - 35th {IEEE/ACM} International Conference on Automated Software Engineering, {ASE} 2020, Melbourne, Australia, September 21-25, 2020 TI - Attend and Represent: A Novel View on Algorithm Selection for Software Verification ER - TY - GEN ED - Ahrendt, Wolfgang ED - Wehrheim, Heike ID - 21019 SN - 978-3-030-50994-1 TI - Tests and Proofs - 14th International Conference, TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings [postponed] VL - 12165 ER - TY - GEN AB - Software verification has recently made enormous progress due to the development of novel verification methods and the speed-up of supporting technologies like SMT solving. To keep software verification tools up to date with these advances, tool developers keep on integrating newly designed methods into their tools, almost exclusively by re-implementing the method within their own framework. While this allows for a conceptual re-use of methods, it requires novel implementations for every new technique. In this paper, we employ cooperative verification in order to avoid reimplementation and enable usage of novel tools as black-box components in verification. Specifically, cooperation is employed for the core ingredient of software verification which is invariant generation. Finding an adequate loop invariant is key to the success of a verification run. Our framework named CoVerCIG allows a master verification tool to delegate the task of invariant generation to one or several specialized helper invariant generators. Their results are then utilized within the verification run of the master verifier, allowing in particular for crosschecking the validity of the invariant. We experimentally evaluate our framework on an instance with two masters and three different invariant generators using a number of benchmarks from SV-COMP 2020. The experiments show that the use of CoVerCIG can increase the number of correctly verified tasks without increasing the used resources AU - Haltermann, Jan Frederik AU - Wehrheim, Heike ID - 17825 T2 - arXiv:2008.04551 TI - Cooperative Verification via Collective Invariant Generation ER - TY - CONF AU - Sharma, Arnab AU - Wehrheim, Heike ID - 16724 T2 - Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA). TI - Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models ER - TY - JOUR AU - Richter, Cedric AU - Hüllermeier, Eyke AU - Jakobs, Marie-Christine AU - Wehrheim, Heike ID - 16725 JF - Journal of Automated Software Engineering TI - Algorithm Selection for Software Validation Based on Graph Kernels ER - TY - JOUR AU - Karl, Holger AU - Kundisch, Dennis AU - Meyer auf der Heide, Friedhelm AU - Wehrheim, Heike ID - 13770 IS - 6 JF - Business & Information Systems Engineering TI - A Case for a New IT Ecosystem: On-The-Fly Computing VL - 62 ER - TY - CONF AU - Pauck, Felix AU - Bodden, Eric AU - Wehrheim, Heike ED - Felderer, Michael ED - Hasselbring, Wilhelm ED - Rabiser, Rick ED - Jung, Reiner ID - 16214 T2 - Software Engineering 2020, Fachtagung des GI-Fachbereichs Softwaretechnik, 24.-28. Februar 2020, Innsbruck, Austria TI - Reproducing Taint-Analysis Results with ReproDroid ER - 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 -