--- _id: '3287' abstract: - lang: eng text: "For optimal placement and orchestration of network services, it is crucial\r\nthat their structure and semantics are specified clearly and comprehensively\r\nand are available to an orchestrator. Existing specification approaches are\r\neither ambiguous or miss important aspects regarding the behavior of virtual\r\nnetwork functions (VNFs) forming a service. We propose to formally and\r\nunambiguously specify the behavior of these functions and services using\r\nQueuing Petri Nets (QPNs). QPNs are an established method that allows to\r\nexpress queuing, synchronization, stochastically distributed processing delays,\r\nand changing traffic volume and characteristics at each VNF. With QPNs,\r\nmultiple VNFs can be connected to complete network services in any structure,\r\neven specifying bidirectional network services containing loops.\r\n We discuss how management and orchestration systems can benefit from our\r\nclear and comprehensive specification approach, leading to better placement of\r\nVNFs and improved Quality of Service. Another benefit of formally specifying\r\nnetwork services with QPNs are diverse analysis options, which allow valuable\r\ninsights such as the distribution of end-to-end delay. We propose a tool-based\r\nworkflow that supports the specification of network services and the automatic\r\ngeneration of corresponding simulation code to enable an in-depth analysis of\r\ntheir behavior and performance." author: - first_name: Stefan Balthasar full_name: Schneider, Stefan Balthasar id: '35343' last_name: Schneider orcid: 0000-0001-8210-4011 - first_name: Arnab full_name: Sharma, Arnab id: '67200' last_name: Sharma - first_name: Holger full_name: Karl, Holger id: '126' last_name: Karl - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Schneider SB, Sharma A, Karl H, Wehrheim H. Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets. In: 2019 IFIP/IEEE International Symposium on Integrated Network Management (IM). Washington, DC, USA: IFIP; 2019:116--124.' apa: 'Schneider, S. B., Sharma, A., Karl, H., & Wehrheim, H. (2019). Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets. In 2019 IFIP/IEEE International Symposium on Integrated Network Management (IM) (pp. 116--124). Washington, DC, USA: IFIP.' bibtex: '@inproceedings{Schneider_Sharma_Karl_Wehrheim_2019, place={Washington, DC, USA}, title={Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets}, booktitle={2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)}, publisher={IFIP}, author={Schneider, Stefan Balthasar and Sharma, Arnab and Karl, Holger and Wehrheim, Heike}, year={2019}, pages={116--124} }' chicago: 'Schneider, Stefan Balthasar, Arnab Sharma, Holger Karl, and Heike Wehrheim. “Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets.” In 2019 IFIP/IEEE International Symposium on Integrated Network Management (IM), 116--124. Washington, DC, USA: IFIP, 2019.' ieee: S. B. Schneider, A. Sharma, H. Karl, and H. Wehrheim, “Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets,” in 2019 IFIP/IEEE International Symposium on Integrated Network Management (IM), Washington, DC, USA, 2019, pp. 116--124. mla: Schneider, Stefan Balthasar, et al. “Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets.” 2019 IFIP/IEEE International Symposium on Integrated Network Management (IM), IFIP, 2019, pp. 116--124. short: 'S.B. Schneider, A. Sharma, H. Karl, H. Wehrheim, in: 2019 IFIP/IEEE International Symposium on Integrated Network Management (IM), IFIP, Washington, DC, USA, 2019, pp. 116--124.' conference: end_date: 2019-04-12 location: Washington, DC, USA name: 2019 IFIP/IEEE International Symposium on Integrated Network Management (IM) start_date: 2019-04-08 date_created: 2018-06-18T15:23:18Z date_updated: 2022-01-06T06:59:09Z ddc: - '040' department: - _id: '77' - _id: '75' file: - access_level: open_access content_type: application/pdf creator: stschn date_created: 2019-01-07T12:38:35Z date_updated: 2019-01-07T12:38:35Z file_id: '6504' file_name: ris_preprint.pdf file_size: 497528 relation: main_file file_date_updated: 2019-01-07T12:38:35Z has_accepted_license: '1' language: - iso: eng main_file_link: - open_access: '1' url: http://dl.ifip.org/db/conf/im/im2019/188490.pdf oa: '1' page: 116--124 place: Washington, DC, USA project: - _id: '3' name: SFB 901 - Project Area B - _id: '11' name: SFB 901 - Subproject B3 - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C - _id: '16' name: SFB 901 - Subproject C4 - _id: '28' grant_number: '761493' name: 5G Development and validation platform for global industry-specific network services and Apps - _id: '25' call_identifier: 5G PPP Phase 1 grant_number: '671517' name: 'SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized Networks' publication: 2019 IFIP/IEEE International Symposium on Integrated Network Management (IM) publisher: IFIP status: public title: Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets type: conference user_id: '35343' year: '2019' ... --- _id: '7752' author: - first_name: Arnab full_name: Sharma, Arnab id: '67200' last_name: Sharma - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Sharma A, Wehrheim H. Testing Balancedness of ML Algorithms. In: Proceedings of the Software Engineering Conference (SE). Vol P-292. Lecture Notes in Informatics (LNI). Stuttgart: Gesellschaft für Informatik e.V. (GI); 2019:157-158.' apa: 'Sharma, A., & Wehrheim, H. (2019). Testing Balancedness of ML Algorithms. In Proceedings of the Software Engineering Conference (SE) (Vol. P-292, pp. 157–158). Stuttgart: Gesellschaft für Informatik e.V. (GI).' bibtex: '@inproceedings{Sharma_Wehrheim_2019, place={Stuttgart}, series={Lecture Notes in Informatics (LNI)}, title={Testing Balancedness of ML Algorithms}, volume={P-292}, booktitle={Proceedings of the Software Engineering Conference (SE)}, publisher={Gesellschaft für Informatik e.V. (GI)}, author={Sharma, Arnab and Wehrheim, Heike}, year={2019}, pages={157–158}, collection={Lecture Notes in Informatics (LNI)} }' chicago: 'Sharma, Arnab, and Heike Wehrheim. “Testing Balancedness of ML Algorithms.” In Proceedings of the Software Engineering Conference (SE), P-292:157–58. Lecture Notes in Informatics (LNI). Stuttgart: Gesellschaft für Informatik e.V. (GI), 2019.' ieee: A. Sharma and H. Wehrheim, “Testing Balancedness of ML Algorithms,” in Proceedings of the Software Engineering Conference (SE), Stuttgart, 2019, vol. P-292, pp. 157–158. mla: Sharma, Arnab, and Heike Wehrheim. “Testing Balancedness of ML Algorithms.” Proceedings of the Software Engineering Conference (SE), vol. P-292, Gesellschaft für Informatik e.V. (GI), 2019, pp. 157–58. short: 'A. Sharma, H. Wehrheim, in: Proceedings of the Software Engineering Conference (SE), Gesellschaft für Informatik e.V. (GI), Stuttgart, 2019, pp. 157–158.' conference: end_date: 2019-02-22 location: Stuttgart name: Software Engineering(SE) start_date: 2019-02-18 date_created: 2019-02-19T08:28:23Z date_updated: 2022-01-06T07:03:45Z department: - _id: '34' - _id: '77' language: - iso: eng page: 157 - 158 place: Stuttgart project: - _id: '3' name: SFB 901 - Project Area B - _id: '11' name: SFB 901 - Subproject B3 - _id: '1' name: SFB 901 publication: Proceedings of the Software Engineering Conference (SE) publication_identifier: isbn: - 978-3-88579-686-2 publication_status: published publisher: Gesellschaft für Informatik e.V. (GI) series_title: Lecture Notes in Informatics (LNI) status: public title: Testing Balancedness of ML Algorithms type: conference_abstract user_id: '477' volume: P-292 year: '2019' ... --- _id: '7623' author: - first_name: Shikun full_name: Zhang, Shikun last_name: Zhang citation: ama: Zhang S. Combining Android Apps for Analysis Purposes. Universität Paderborn; 2019. apa: Zhang, S. (2019). Combining Android Apps for Analysis Purposes. Universität Paderborn. bibtex: '@book{Zhang_2019, title={Combining Android Apps for Analysis Purposes}, publisher={Universität Paderborn}, author={Zhang, Shikun}, year={2019} }' chicago: Zhang, Shikun. Combining Android Apps for Analysis Purposes. Universität Paderborn, 2019. ieee: S. Zhang, Combining Android Apps for Analysis Purposes. Universität Paderborn, 2019. mla: Zhang, Shikun. Combining Android Apps for Analysis Purposes. Universität Paderborn, 2019. short: S. Zhang, Combining Android Apps for Analysis Purposes, Universität Paderborn, 2019. date_created: 2019-02-12T06:13:43Z date_updated: 2022-01-06T07:03:41Z department: - _id: '77' language: - iso: eng page: '64' project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '12' name: SFB 901 - Subproject B4 publisher: Universität Paderborn status: public supervisor: - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim title: Combining Android Apps for Analysis Purposes type: mastersthesis user_id: '477' year: '2019' ... --- _id: '7635' author: - first_name: Arnab full_name: Sharma, Arnab id: '67200' last_name: Sharma - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Sharma A, Wehrheim H. Testing Machine Learning Algorithms for Balanced Data Usage. In: IEEE International Conference on Software Testing, Verification and Validation (ICST). Xi’an, China: IEEE; 2019:125--135.' apa: 'Sharma, A., & Wehrheim, H. (2019). Testing Machine Learning Algorithms for Balanced Data Usage. In IEEE International Conference on Software Testing, Verification and Validation (ICST) (pp. 125--135). Xi’an, China: IEEE.' bibtex: '@inproceedings{Sharma_Wehrheim_2019, place={Xi’an, China}, title={Testing Machine Learning Algorithms for Balanced Data Usage}, booktitle={IEEE International Conference on Software Testing, Verification and Validation (ICST)}, publisher={IEEE}, author={Sharma, Arnab and Wehrheim, Heike}, year={2019}, pages={125--135} }' chicago: 'Sharma, Arnab, and Heike Wehrheim. “Testing Machine Learning Algorithms for Balanced Data Usage.” In IEEE International Conference on Software Testing, Verification and Validation (ICST), 125--135. Xi’an, China: IEEE, 2019.' ieee: A. Sharma and H. Wehrheim, “Testing Machine Learning Algorithms for Balanced Data Usage,” in IEEE International Conference on Software Testing, Verification and Validation (ICST), Xi’an, China, April, 2019, 2019, pp. 125--135. mla: Sharma, Arnab, and Heike Wehrheim. “Testing Machine Learning Algorithms for Balanced Data Usage.” IEEE International Conference on Software Testing, Verification and Validation (ICST), IEEE, 2019, pp. 125--135. short: 'A. Sharma, H. Wehrheim, in: IEEE International Conference on Software Testing, Verification and Validation (ICST), IEEE, Xi’an, China, 2019, pp. 125--135.' conference: end_date: 2019-04-27 location: Xi'an, China, April, 2019 name: IEEE International Conference on Software Testing, Verification and Validation (ICST) start_date: 2019-04-22 date_created: 2019-02-12T12:31:57Z date_updated: 2022-01-06T07:03:42Z ddc: - '004' department: - _id: '34' - _id: '77' file: - access_level: closed content_type: application/pdf creator: ups date_created: 2019-08-26T10:56:34Z date_updated: 2019-08-26T10:56:34Z file_id: '12960' file_name: 08730187.pdf file_size: 266375 relation: main_file success: 1 file_date_updated: 2019-08-26T10:56:34Z has_accepted_license: '1' language: - iso: eng page: 125--135 place: Xi'an, China project: - _id: '3' name: SFB 901 - Project Area B - _id: '11' name: SFB 901 - Subproject B3 - _id: '1' name: SFB 901 publication: IEEE International Conference on Software Testing, Verification and Validation (ICST) publication_status: published publisher: IEEE status: public title: Testing Machine Learning Algorithms for Balanced Data Usage type: conference user_id: '29719' year: '2019' ... --- _id: '12885' author: - first_name: Jan Frederik full_name: Haltermann, Jan Frederik id: '44413' last_name: Haltermann citation: ama: Haltermann JF. Analyzing Data Usage in Array Programs.; 2019. apa: Haltermann, J. F. (2019). Analyzing Data Usage in Array Programs. bibtex: '@book{Haltermann_2019, title={Analyzing Data Usage in Array Programs}, author={Haltermann, Jan Frederik}, year={2019} }' chicago: Haltermann, Jan Frederik. Analyzing Data Usage in Array Programs, 2019. ieee: J. F. Haltermann, Analyzing Data Usage in Array Programs. 2019. mla: Haltermann, Jan Frederik. Analyzing Data Usage in Array Programs. 2019. short: J.F. Haltermann, Analyzing Data Usage in Array Programs, 2019. date_created: 2019-07-24T08:06:11Z date_updated: 2022-01-06T06:51:23Z ddc: - '000' department: - _id: '77' file: - access_level: closed content_type: application/pdf creator: jfh date_created: 2019-07-24T07:44:29Z date_updated: 2019-07-24T07:44:29Z file_id: '12886' file_name: Thesis_Haltermann.pdf file_size: 1344093 relation: main_file success: 1 file_date_updated: 2019-07-24T07:44:29Z has_accepted_license: '1' language: - iso: eng status: public supervisor: - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim title: Analyzing Data Usage in Array Programs type: mastersthesis user_id: '44413' year: '2019' ... --- _id: '15838' abstract: - lang: eng text: 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. author: - first_name: Felix full_name: Pauck, Felix id: '22398' last_name: Pauck - first_name: Shikun full_name: Zhang, Shikun last_name: Zhang citation: ama: 'Pauck F, Zhang S. Android App Merging for Benchmark Speed-Up and Analysis Lift-Up. In: 2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW). ; 2019. doi:10.1109/asew.2019.00019' apa: Pauck, F., & Zhang, S. (2019). Android App Merging for Benchmark Speed-Up and Analysis Lift-Up. In 2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW). https://doi.org/10.1109/asew.2019.00019 bibtex: '@inproceedings{Pauck_Zhang_2019, title={Android App Merging for Benchmark Speed-Up and Analysis Lift-Up}, DOI={10.1109/asew.2019.00019}, booktitle={2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW)}, author={Pauck, Felix and Zhang, Shikun}, year={2019} }' chicago: Pauck, Felix, and Shikun Zhang. “Android App Merging for Benchmark Speed-Up and Analysis Lift-Up.” In 2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW), 2019. https://doi.org/10.1109/asew.2019.00019. ieee: F. Pauck and S. Zhang, “Android App Merging for Benchmark Speed-Up and Analysis Lift-Up,” in 2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW), 2019. mla: Pauck, Felix, and Shikun Zhang. “Android App Merging for Benchmark Speed-Up and Analysis Lift-Up.” 2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW), 2019, doi:10.1109/asew.2019.00019. short: 'F. Pauck, S. Zhang, in: 2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW), 2019.' date_created: 2020-02-06T17:06:51Z date_updated: 2022-01-06T06:52:38Z ddc: - '004' department: - _id: '77' doi: 10.1109/asew.2019.00019 file: - access_level: closed content_type: application/pdf creator: fpauck date_created: 2020-02-06T17:09:45Z date_updated: 2020-02-06T17:09:45Z file_id: '15839' file_name: AMT_final.pdf file_size: 644517 relation: main_file file_date_updated: 2020-02-06T17:09:45Z has_accepted_license: '1' keyword: - Program Analysis - Android App Analysis - Taint Analysis - App Merging - Benchmark language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '12' name: SFB 901 - Subproject B4 publication: 2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW) publication_identifier: isbn: - '9781728141367' publication_status: published status: public title: Android App Merging for Benchmark Speed-Up and Analysis Lift-Up type: conference user_id: '477' year: '2019' ... --- _id: '16215' author: - first_name: John full_name: Derrick, John last_name: Derrick - first_name: Simon full_name: Doherty, Simon last_name: Doherty - first_name: Brijesh full_name: Dongol, Brijesh last_name: Dongol - first_name: Gerhard full_name: Schellhorn, Gerhard last_name: Schellhorn - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Derrick J, Doherty S, Dongol B, Schellhorn G, Wehrheim H. Verifying Correctness of Persistent Concurrent Data Structures. In: H. ter Beek M, McIver A, N. Oliveira J, eds. Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings. Vol 11800. Lecture Notes in Computer Science. Springer; 2019:179-195. doi:10.1007/978-3-030-30942-8\_12' apa: Derrick, J., Doherty, S., Dongol, B., Schellhorn, G., & Wehrheim, H. (2019). Verifying Correctness of Persistent Concurrent Data Structures. In M. H. ter Beek, A. McIver, & J. N. Oliveira (Eds.), Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings (Vol. 11800, pp. 179–195). Springer. https://doi.org/10.1007/978-3-030-30942-8\_12 bibtex: '@inproceedings{Derrick_Doherty_Dongol_Schellhorn_Wehrheim_2019, series={Lecture Notes in Computer Science}, title={Verifying Correctness of Persistent Concurrent Data Structures}, volume={11800}, DOI={10.1007/978-3-030-30942-8\_12}, booktitle={Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings}, publisher={Springer}, author={Derrick, John and Doherty, Simon and Dongol, Brijesh and Schellhorn, Gerhard and Wehrheim, Heike}, editor={H. ter Beek, Maurice and McIver, Annabelle and N. Oliveira, Jos{\’{e}}Editors}, year={2019}, pages={179–195}, collection={Lecture Notes in Computer Science} }' chicago: Derrick, John, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, and Heike Wehrheim. “Verifying Correctness of Persistent Concurrent Data Structures.” In Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings, edited by Maurice H. ter Beek, Annabelle McIver, and Jos{\’{e}} N. Oliveira, 11800:179–95. Lecture Notes in Computer Science. Springer, 2019. https://doi.org/10.1007/978-3-030-30942-8\_12. ieee: J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, and H. Wehrheim, “Verifying Correctness of Persistent Concurrent Data Structures,” in Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings, 2019, vol. 11800, pp. 179–195. mla: Derrick, John, et al. “Verifying Correctness of Persistent Concurrent Data Structures.” Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings, edited by Maurice H. ter Beek et al., vol. 11800, Springer, 2019, pp. 179–95, doi:10.1007/978-3-030-30942-8\_12. short: 'J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, H. Wehrheim, in: M. H. ter Beek, A. McIver, J. N. Oliveira (Eds.), Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings, Springer, 2019, pp. 179–195.' date_created: 2020-03-03T08:15:53Z date_updated: 2022-01-06T06:52:45Z department: - _id: '34' - _id: '77' doi: 10.1007/978-3-030-30942-8\_12 editor: - first_name: Maurice full_name: H. ter Beek, Maurice last_name: H. ter Beek - first_name: Annabelle full_name: McIver, Annabelle last_name: McIver - first_name: Jos{\'{e}} full_name: N. Oliveira, Jos{\'{e}} last_name: N. Oliveira intvolume: ' 11800' language: - iso: eng page: 179-195 publication: Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings publisher: Springer series_title: Lecture Notes in Computer Science status: public title: Verifying Correctness of Persistent Concurrent Data Structures type: conference user_id: '29719' volume: 11800 year: '2019' ... --- _id: '16216' author: - first_name: Alessandra full_name: Russo, Alessandra last_name: Russo - first_name: Andy full_name: Schürr, Andy last_name: Schürr - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: Russo A, Schürr A, Wehrheim H. Editorial. Formal Asp Comput. 2019;31(5):457-458. doi:10.1007/s00165-019-00495-y apa: Russo, A., Schürr, A., & Wehrheim, H. (2019). Editorial. Formal Asp. Comput., 31(5), 457–458. https://doi.org/10.1007/s00165-019-00495-y bibtex: '@article{Russo_Schürr_Wehrheim_2019, title={Editorial}, volume={31}, DOI={10.1007/s00165-019-00495-y}, number={5}, journal={Formal Asp. Comput.}, author={Russo, Alessandra and Schürr, Andy and Wehrheim, Heike}, year={2019}, pages={457–458} }' chicago: 'Russo, Alessandra, Andy Schürr, and Heike Wehrheim. “Editorial.” Formal Asp. Comput. 31, no. 5 (2019): 457–58. https://doi.org/10.1007/s00165-019-00495-y.' ieee: A. Russo, A. Schürr, and H. Wehrheim, “Editorial,” Formal Asp. Comput., vol. 31, no. 5, pp. 457–458, 2019. mla: Russo, Alessandra, et al. “Editorial.” Formal Asp. Comput., vol. 31, no. 5, 2019, pp. 457–58, doi:10.1007/s00165-019-00495-y. short: A. Russo, A. Schürr, H. Wehrheim, Formal Asp. Comput. 31 (2019) 457–458. date_created: 2020-03-03T08:17:44Z date_updated: 2022-01-06T06:52:45Z department: - _id: '34' - _id: '77' doi: 10.1007/s00165-019-00495-y intvolume: ' 31' issue: '5' language: - iso: eng page: 457-458 publication: Formal Asp. Comput. status: public title: Editorial type: journal_article user_id: '29719' volume: 31 year: '2019' ... --- _id: '16217' author: - first_name: Martin full_name: Fränzle, Martin last_name: Fränzle - first_name: Deepak full_name: Kapur, Deepak last_name: Kapur - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim - first_name: Naijun full_name: Zhan, Naijun last_name: Zhan citation: ama: Fränzle M, Kapur D, Wehrheim H, Zhan N. Editorial. Formal Asp Comput. 2019;31(1):1. doi:10.1007/s00165-018-00477-6 apa: Fränzle, M., Kapur, D., Wehrheim, H., & Zhan, N. (2019). Editorial. Formal Asp. Comput., 31(1), 1. https://doi.org/10.1007/s00165-018-00477-6 bibtex: '@article{Fränzle_Kapur_Wehrheim_Zhan_2019, title={Editorial}, volume={31}, DOI={10.1007/s00165-018-00477-6}, number={1}, journal={Formal Asp. Comput.}, author={Fränzle, Martin and Kapur, Deepak and Wehrheim, Heike and Zhan, Naijun}, year={2019}, pages={1} }' chicago: 'Fränzle, Martin, Deepak Kapur, Heike Wehrheim, and Naijun Zhan. “Editorial.” Formal Asp. Comput. 31, no. 1 (2019): 1. https://doi.org/10.1007/s00165-018-00477-6.' ieee: M. Fränzle, D. Kapur, H. Wehrheim, and N. Zhan, “Editorial,” Formal Asp. Comput., vol. 31, no. 1, p. 1, 2019. mla: Fränzle, Martin, et al. “Editorial.” Formal Asp. Comput., vol. 31, no. 1, 2019, p. 1, doi:10.1007/s00165-018-00477-6. short: M. Fränzle, D. Kapur, H. Wehrheim, N. Zhan, Formal Asp. Comput. 31 (2019) 1. date_created: 2020-03-03T08:19:35Z date_updated: 2022-01-06T06:52:45Z department: - _id: '34' - _id: '77' doi: 10.1007/s00165-018-00477-6 intvolume: ' 31' issue: '1' language: - iso: eng page: '1' publication: Formal Asp. Comput. status: public title: Editorial type: journal_article user_id: '29719' volume: 31 year: '2019' ... --- _id: '13872' author: - first_name: Dirk full_name: Beyer, Dirk last_name: Beyer - first_name: Marie-Christine full_name: Jakobs, Marie-Christine last_name: Jakobs citation: ama: 'Beyer D, Jakobs M-C. CoVeriTest: Cooperative Verifier-Based Testing. In: Fundamental Approaches to Software Engineering. Cham; 2019. doi:10.1007/978-3-030-16722-6_23' apa: 'Beyer, D., & Jakobs, M.-C. (2019). CoVeriTest: Cooperative Verifier-Based Testing. In Fundamental Approaches to Software Engineering. Cham. https://doi.org/10.1007/978-3-030-16722-6_23' bibtex: '@inbook{Beyer_Jakobs_2019, place={Cham}, title={CoVeriTest: Cooperative Verifier-Based Testing}, DOI={10.1007/978-3-030-16722-6_23}, booktitle={Fundamental Approaches to Software Engineering}, author={Beyer, Dirk and Jakobs, Marie-Christine}, year={2019} }' chicago: 'Beyer, Dirk, and Marie-Christine Jakobs. “CoVeriTest: Cooperative Verifier-Based Testing.” In Fundamental Approaches to Software Engineering. Cham, 2019. https://doi.org/10.1007/978-3-030-16722-6_23.' ieee: 'D. Beyer and M.-C. Jakobs, “CoVeriTest: Cooperative Verifier-Based Testing,” in Fundamental Approaches to Software Engineering, Cham, 2019.' mla: 'Beyer, Dirk, and Marie-Christine Jakobs. “CoVeriTest: Cooperative Verifier-Based Testing.” Fundamental Approaches to Software Engineering, 2019, doi:10.1007/978-3-030-16722-6_23.' short: 'D. Beyer, M.-C. Jakobs, in: Fundamental Approaches to Software Engineering, Cham, 2019.' date_created: 2019-10-16T06:39:51Z date_updated: 2022-01-06T06:51:45Z department: - _id: '77' doi: 10.1007/978-3-030-16722-6_23 language: - iso: eng place: Cham project: - _id: '85' name: Kooperative Softwareverifikation publication: Fundamental Approaches to Software Engineering publication_identifier: isbn: - '9783030167219' - '9783030167226' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: 'CoVeriTest: Cooperative Verifier-Based Testing' type: book_chapter user_id: '44413' year: '2019' ...