--- _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' ... --- _id: '13993' 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: Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings. ; 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 Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings (pp. 179–195). https://doi.org/10.1007/978-3-030-30942-8\_12 bibtex: '@inproceedings{Derrick_Doherty_Dongol_Schellhorn_Wehrheim_2019, title={Verifying Correctness of Persistent Concurrent Data Structures}, 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}, author={Derrick, John and Doherty, Simon and Dongol, Brijesh and Schellhorn, Gerhard and Wehrheim, Heike}, year={2019}, pages={179–195} }' 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, 179–95, 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, 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, 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: Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings, 2019, pp. 179–195.' date_created: 2019-10-24T08:20:28Z date_updated: 2022-01-06T06:51:48Z department: - _id: '77' doi: 10.1007/978-3-030-30942-8\_12 language: - iso: eng page: 179-195 project: - _id: '78' name: Validation of Software Transactional Memory publication: Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings status: public title: Verifying Correctness of Persistent Concurrent Data Structures type: conference user_id: '29719' year: '2019' ... --- _id: '10011' 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: 2019-05-28T06:32:57Z date_updated: 2022-01-06T06:50:22Z department: - _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: '10091' author: - first_name: Jürgen full_name: König, Jürgen id: '22358' last_name: König - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'König J, Wehrheim H. Data Independence for Software Transactional Memory. In: M. Badger J, Yvonne Rozier K, eds. {NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings. Vol 11460. Lecture Notes in Computer Science. Springer; 2019:263-279. doi:10.1007/978-3-030-20652-9\_18' apa: König, J., & Wehrheim, H. (2019). Data Independence for Software Transactional Memory. In J. M. Badger & K. Yvonne Rozier (Eds.), {NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings (Vol. 11460, pp. 263–279). Springer. https://doi.org/10.1007/978-3-030-20652-9\_18 bibtex: '@inproceedings{König_Wehrheim_2019, series={Lecture Notes in Computer Science}, title={Data Independence for Software Transactional Memory}, volume={11460}, DOI={10.1007/978-3-030-20652-9\_18}, booktitle={{NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings}, publisher={Springer}, author={König, Jürgen and Wehrheim, Heike}, editor={M. Badger, Julia and Yvonne Rozier, KristinEditors}, year={2019}, pages={263–279}, collection={Lecture Notes in Computer Science} }' chicago: König, Jürgen, and Heike Wehrheim. “Data Independence for Software Transactional Memory.” In {NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings, edited by Julia M. Badger and Kristin Yvonne Rozier, 11460:263–79. Lecture Notes in Computer Science. Springer, 2019. https://doi.org/10.1007/978-3-030-20652-9\_18. ieee: J. König and H. Wehrheim, “Data Independence for Software Transactional Memory,” in {NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings, 2019, vol. 11460, pp. 263–279. mla: König, Jürgen, and Heike Wehrheim. “Data Independence for Software Transactional Memory.” {NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings, edited by Julia M. Badger and Kristin Yvonne Rozier, vol. 11460, Springer, 2019, pp. 263–79, doi:10.1007/978-3-030-20652-9\_18. short: 'J. König, H. Wehrheim, in: J. M. Badger, K. Yvonne Rozier (Eds.), {NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings, Springer, 2019, pp. 263–279.' date_created: 2019-06-03T07:51:26Z date_updated: 2022-01-06T06:50:28Z department: - _id: '77' doi: 10.1007/978-3-030-20652-9\_18 editor: - first_name: Julia full_name: M. Badger, Julia last_name: M. Badger - first_name: Kristin full_name: Yvonne Rozier, Kristin last_name: Yvonne Rozier intvolume: ' 11460' language: - iso: eng page: 263-279 project: - _id: '78' name: Validation of Software Transactional Memory publication: '{NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings' publisher: Springer series_title: Lecture Notes in Computer Science status: public title: Data Independence for Software Transactional Memory type: conference user_id: '22358' volume: 11460 year: '2019' ... --- _id: '10092' author: - first_name: Simon full_name: Doherty, Simon last_name: Doherty - first_name: Brijesh full_name: Dongol, Brijesh last_name: Dongol - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim - first_name: John full_name: Derrick, John last_name: Derrick citation: ama: 'Doherty S, Dongol B, Wehrheim H, Derrick J. Verifying C11 programs operationally. In: K. Hollingsworth J, Keidar I, eds. Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019. {ACM}; 2019:355-365. doi:10.1145/3293883.3295702' apa: Doherty, S., Dongol, B., Wehrheim, H., & Derrick, J. (2019). Verifying C11 programs operationally. In J. K. Hollingsworth & I. Keidar (Eds.), Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019 (pp. 355–365). {ACM}. https://doi.org/10.1145/3293883.3295702 bibtex: '@inproceedings{Doherty_Dongol_Wehrheim_Derrick_2019, title={Verifying C11 programs operationally}, DOI={10.1145/3293883.3295702}, booktitle={Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019}, publisher={{ACM}}, author={Doherty, Simon and Dongol, Brijesh and Wehrheim, Heike and Derrick, John}, editor={K. Hollingsworth, Jeffrey and Keidar, IditEditors}, year={2019}, pages={355–365} }' chicago: Doherty, Simon, Brijesh Dongol, Heike Wehrheim, and John Derrick. “Verifying C11 Programs Operationally.” In Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019, edited by Jeffrey K. Hollingsworth and Idit Keidar, 355–65. {ACM}, 2019. https://doi.org/10.1145/3293883.3295702. ieee: S. Doherty, B. Dongol, H. Wehrheim, and J. Derrick, “Verifying C11 programs operationally,” in Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019, 2019, pp. 355–365. mla: Doherty, Simon, et al. “Verifying C11 Programs Operationally.” Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019, edited by Jeffrey K. Hollingsworth and Idit Keidar, {ACM}, 2019, pp. 355–65, doi:10.1145/3293883.3295702. short: 'S. Doherty, B. Dongol, H. Wehrheim, J. Derrick, in: J. K. Hollingsworth, I. Keidar (Eds.), Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019, {ACM}, 2019, pp. 355–365.' date_created: 2019-06-03T07:59:36Z date_updated: 2022-01-06T06:50:28Z department: - _id: '77' doi: 10.1145/3293883.3295702 editor: - first_name: Jeffrey full_name: K. Hollingsworth, Jeffrey last_name: K. Hollingsworth - first_name: Idit full_name: Keidar, Idit last_name: Keidar language: - iso: eng page: 355-365 project: - _id: '78' name: Validation of Software Transactional Memory publication: Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019 publisher: '{ACM}' status: public title: Verifying C11 programs operationally type: conference user_id: '29719' year: '2019' ... --- _id: '10093' author: - first_name: Dirk full_name: Beyer, Dirk last_name: Beyer - first_name: Marie-Christine full_name: Jakobs, Marie-Christine last_name: Jakobs - first_name: Thomas full_name: Lemberger, Thomas last_name: Lemberger - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Beyer D, Jakobs M-C, Lemberger T, Wehrheim H. Combining Verifiers in Conditional Model Checking via Reducers. In: Becker S, Bogicevic I, Herzwurm G, Wagner S, eds. Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019. Vol P-292. LNI. GI; 2019:151--152. doi:10.18420/se2019-46' apa: Beyer, D., Jakobs, M.-C., Lemberger, T., & Wehrheim, H. (2019). Combining Verifiers in Conditional Model Checking via Reducers. In S. Becker, I. Bogicevic, G. Herzwurm, & S. Wagner (Eds.), Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019 (Vol. P-292, pp. 151--152). GI. https://doi.org/10.18420/se2019-46 bibtex: '@inproceedings{Beyer_Jakobs_Lemberger_Wehrheim_2019, series={LNI}, title={Combining Verifiers in Conditional Model Checking via Reducers}, volume={P-292}, DOI={10.18420/se2019-46}, booktitle={Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019}, publisher={GI}, author={Beyer, Dirk and Jakobs, Marie-Christine and Lemberger, Thomas and Wehrheim, Heike}, editor={Becker, Steffen and Bogicevic, Ivan and Herzwurm, Georg and Wagner, StefanEditors}, year={2019}, pages={151--152}, collection={LNI} }' chicago: Beyer, Dirk, Marie-Christine Jakobs, Thomas Lemberger, and Heike Wehrheim. “Combining Verifiers in Conditional Model Checking via Reducers.” In Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019, edited by Steffen Becker, Ivan Bogicevic, Georg Herzwurm, and Stefan Wagner, P-292:151--152. LNI. GI, 2019. https://doi.org/10.18420/se2019-46. ieee: D. Beyer, M.-C. Jakobs, T. Lemberger, and H. Wehrheim, “Combining Verifiers in Conditional Model Checking via Reducers,” in Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019, 2019, vol. P-292, pp. 151--152. mla: Beyer, Dirk, et al. “Combining Verifiers in Conditional Model Checking via Reducers.” Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019, edited by Steffen Becker et al., vol. P-292, GI, 2019, pp. 151--152, doi:10.18420/se2019-46. short: 'D. Beyer, M.-C. Jakobs, T. Lemberger, H. Wehrheim, in: S. Becker, I. Bogicevic, G. Herzwurm, S. Wagner (Eds.), Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019, GI, 2019, pp. 151--152.' date_created: 2019-06-03T08:08:39Z date_updated: 2022-01-06T06:50:28Z ddc: - '004' department: - _id: '77' doi: 10.18420/se2019-46 editor: - first_name: Steffen full_name: Becker, Steffen last_name: Becker - first_name: Ivan full_name: Bogicevic, Ivan last_name: Bogicevic - first_name: Georg full_name: Herzwurm, Georg last_name: Herzwurm - first_name: Stefan full_name: Wagner, Stefan last_name: Wagner file: - access_level: closed content_type: application/pdf creator: ups date_created: 2019-08-26T09:31:55Z date_updated: 2019-08-26T09:31:55Z file_id: '12956' file_name: 46.pdf file_size: 472426 relation: main_file success: 1 file_date_updated: 2019-08-26T09:31:55Z has_accepted_license: '1' language: - iso: eng page: 151--152 project: - _id: '12' name: SFB 901 - Subproject B4 - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B publication: Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019 publisher: GI series_title: LNI status: public title: Combining Verifiers in Conditional Model Checking via Reducers type: conference user_id: '477' volume: P-292 year: '2019' ... --- _id: '10094' 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: Becker S, Bogicevic I, Herzwurm G, Wagner S, eds. Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019. Vol {P-292}. {LNI}. {GI}; 2019:157-158. doi:10.18420/se2019-48' apa: Sharma, A., & Wehrheim, H. (2019). Testing Balancedness of ML Algorithms. In S. Becker, I. Bogicevic, G. Herzwurm, & S. Wagner (Eds.), Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019 (Vol. {P-292}, pp. 157–158). {GI}. https://doi.org/10.18420/se2019-48 bibtex: '@inproceedings{Sharma_Wehrheim_2019, series={{LNI}}, title={Testing Balancedness of ML Algorithms}, volume={{P-292}}, DOI={10.18420/se2019-48}, booktitle={Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019}, publisher={{GI}}, author={Sharma, Arnab and Wehrheim, Heike}, editor={Becker, Steffen and Bogicevic, Ivan and Herzwurm, Georg and Wagner, StefanEditors}, year={2019}, pages={157–158}, collection={{LNI}} }' chicago: Sharma, Arnab, and Heike Wehrheim. “Testing Balancedness of ML Algorithms.” In Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019, edited by Steffen Becker, Ivan Bogicevic, Georg Herzwurm, and Stefan Wagner, {P-292}:157–58. {LNI}. {GI}, 2019. https://doi.org/10.18420/se2019-48. ieee: A. Sharma and H. Wehrheim, “Testing Balancedness of ML Algorithms,” in Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019, 2019, vol. {P-292}, pp. 157–158. mla: Sharma, Arnab, and Heike Wehrheim. “Testing Balancedness of ML Algorithms.” Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019, edited by Steffen Becker et al., vol. {P-292}, {GI}, 2019, pp. 157–58, doi:10.18420/se2019-48. short: 'A. Sharma, H. Wehrheim, in: S. Becker, I. Bogicevic, G. Herzwurm, S. Wagner (Eds.), Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019, {GI}, 2019, pp. 157–158.' date_created: 2019-06-03T08:10:55Z date_updated: 2022-01-06T06:50:28Z department: - _id: '77' doi: 10.18420/se2019-48 editor: - first_name: Steffen full_name: Becker, Steffen last_name: Becker - first_name: Ivan full_name: Bogicevic, Ivan last_name: Bogicevic - first_name: Georg full_name: Herzwurm, Georg last_name: Herzwurm - first_name: Stefan full_name: Wagner, Stefan last_name: Wagner language: - iso: eng page: 157-158 publication: Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019 publisher: '{GI}' series_title: '{LNI}' status: public title: Testing Balancedness of ML Algorithms type: conference user_id: '29719' volume: '{P-292}' year: '2019' ... --- _id: '10095' author: - first_name: Cedric full_name: Richter, Cedric id: '50003' last_name: Richter - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Richter C, Wehrheim H. PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution). In: Beyer D, Huisman M, Kordon F, Steffen B, eds. 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}. Vol 11429. Lecture Notes in Computer Science. Springer; 2019:229-233. doi:10.1007/978-3-030-17502-3_19' apa: 'Richter, C., & Wehrheim, H. (2019). PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution). In D. Beyer, M. Huisman, F. Kordon, & B. Steffen (Eds.), 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} (Vol. 11429, pp. 229–233). Springer. https://doi.org/10.1007/978-3-030-17502-3_19' bibtex: '@inproceedings{Richter_Wehrheim_2019, series={Lecture Notes in Computer Science}, title={PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution)}, volume={11429}, DOI={10.1007/978-3-030-17502-3_19}, booktitle={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}}, publisher={Springer}, author={Richter, Cedric and Wehrheim, Heike}, editor={Beyer, Dirk and Huisman, Marieke and Kordon, Fabrice and Steffen, BernhardEditors}, year={2019}, pages={229–233}, collection={Lecture Notes in Computer Science} }' chicago: 'Richter, Cedric, and Heike Wehrheim. “PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution).” In 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}, edited by Dirk Beyer, Marieke Huisman, Fabrice Kordon, and Bernhard Steffen, 11429:229–33. Lecture Notes in Computer Science. Springer, 2019. https://doi.org/10.1007/978-3-030-17502-3_19.' ieee: 'C. Richter and H. Wehrheim, “PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution),” in 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}, 2019, vol. 11429, pp. 229–233.' mla: 'Richter, Cedric, and Heike Wehrheim. “PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution).” 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}, edited by Dirk Beyer et al., vol. 11429, Springer, 2019, pp. 229–33, doi:10.1007/978-3-030-17502-3_19.' short: 'C. Richter, H. Wehrheim, in: D. Beyer, M. Huisman, F. Kordon, B. Steffen (Eds.), 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}, Springer, 2019, pp. 229–233.' date_created: 2019-06-03T08:12:55Z date_updated: 2022-01-06T06:50:29Z ddc: - '004' department: - _id: '77' doi: 10.1007/978-3-030-17502-3_19 editor: - first_name: Dirk full_name: Beyer, Dirk last_name: Beyer - first_name: Marieke full_name: Huisman, Marieke last_name: Huisman - first_name: Fabrice full_name: Kordon, Fabrice last_name: Kordon - first_name: Bernhard full_name: Steffen, Bernhard last_name: Steffen file: - access_level: closed content_type: application/pdf creator: ups date_created: 2019-08-26T11:01:00Z date_updated: 2019-08-26T11:01:00Z file_id: '12961' file_name: PeSCo.pdf file_size: 254772 relation: main_file success: 1 file_date_updated: 2019-08-26T11:01:00Z has_accepted_license: '1' intvolume: ' 11429' language: - iso: eng page: 229-233 project: - _id: '12' name: SFB 901 - Subproject B4 - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B publication: 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} publisher: Springer series_title: Lecture Notes in Computer Science status: public title: 'PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution)' type: conference user_id: '29719' volume: 11429 year: '2019' ... --- _id: '10105' author: - first_name: Jan full_name: Haltermann, Jan last_name: Haltermann citation: ama: Haltermann J. Analyzing Data Usage in Array Programs. Universität Paderborn; 2019. apa: Haltermann, J. (2019). Analyzing Data Usage in Array Programs. Universität Paderborn. bibtex: '@book{Haltermann_2019, title={Analyzing Data Usage in Array Programs}, publisher={Universität Paderborn}, author={Haltermann, Jan}, year={2019} }' chicago: Haltermann, Jan. Analyzing Data Usage in Array Programs. Universität Paderborn, 2019. ieee: J. Haltermann, Analyzing Data Usage in Array Programs. Universität Paderborn, 2019. mla: Haltermann, Jan. Analyzing Data Usage in Array Programs. Universität Paderborn, 2019. short: J. Haltermann, Analyzing Data Usage in Array Programs, Universität Paderborn, 2019. date_created: 2019-06-04T10:54:08Z date_updated: 2022-01-06T06:50:29Z department: - _id: '7' - _id: '77' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '11' name: SFB 901 - Subproject B3 publisher: Universität Paderborn 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: '477' year: '2019' ... --- _id: '10108' abstract: - lang: eng text: "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.\r\n\r\nIn 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." author: - first_name: Felix full_name: Pauck, Felix id: '22398' last_name: Pauck - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Pauck F, Wehrheim H. Together Strong: Cooperative Android App Analysis. In: Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering. ; 2019:374-384. doi:10.1145/3338906.3338915' apa: 'Pauck, F., & Wehrheim, H. (2019). Together Strong: Cooperative Android App Analysis. Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 374–384. https://doi.org/10.1145/3338906.3338915' bibtex: '@inproceedings{Pauck_Wehrheim_2019, title={Together Strong: Cooperative Android App Analysis}, DOI={10.1145/3338906.3338915}, booktitle={Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering}, author={Pauck, Felix and Wehrheim, Heike}, year={2019}, pages={374–384} }' chicago: 'Pauck, Felix, and Heike Wehrheim. “Together Strong: Cooperative Android App Analysis.” In Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 374–84, 2019. https://doi.org/10.1145/3338906.3338915.' ieee: 'F. Pauck and H. Wehrheim, “Together Strong: Cooperative Android App Analysis,” in Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2019, pp. 374–384, doi: 10.1145/3338906.3338915.' mla: 'Pauck, Felix, and Heike Wehrheim. “Together Strong: Cooperative Android App Analysis.” Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2019, pp. 374–84, doi:10.1145/3338906.3338915.' short: 'F. Pauck, H. Wehrheim, in: Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2019, pp. 374–384.' date_created: 2019-06-04T11:15:25Z date_updated: 2023-01-18T08:32:47Z ddc: - '004' department: - _id: '77' doi: 10.1145/3338906.3338915 file: - access_level: closed content_type: application/pdf creator: fpauck date_created: 2019-08-20T08:47:20Z date_updated: 2019-08-20T08:47:20Z file_id: '12947' file_name: fse19main-id44-p-ef9ce42-41855-final.pdf file_size: 442603 relation: main_file file_date_updated: 2019-08-20T08:47:20Z has_accepted_license: '1' keyword: - Android Taint Analysis - Cooperation - Precision - Tools language: - iso: eng page: 374-384 project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '12' name: SFB 901 - Subproject B4 publication: Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering publication_identifier: isbn: - 978-1-4503-5572-8 publication_status: published status: public title: 'Together Strong: Cooperative Android App Analysis' type: conference user_id: '22398' year: '2019' ... --- _id: '13874' author: - first_name: Tobias full_name: Isenberg, Tobias last_name: Isenberg - first_name: Marie-Christine full_name: Jakobs, Marie-Christine last_name: Jakobs - first_name: Felix full_name: Pauck, Felix id: '22398' last_name: Pauck - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Isenberg T, Jakobs M-C, Pauck F, Wehrheim H. When Are Software Verification Results Valid for Approximate Hardware? In: 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. ; 2019:3-20. doi:10.1007/978-3-030-31157-5_1' apa: Isenberg, T., Jakobs, M.-C., Pauck, F., & Wehrheim, H. (2019). When Are Software Verification Results Valid for Approximate Hardware? 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, 3–20. https://doi.org/10.1007/978-3-030-31157-5_1 bibtex: '@inproceedings{Isenberg_Jakobs_Pauck_Wehrheim_2019, title={When Are Software Verification Results Valid for Approximate Hardware?}, DOI={10.1007/978-3-030-31157-5_1}, booktitle={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}, author={Isenberg, Tobias and Jakobs, Marie-Christine and Pauck, Felix and Wehrheim, Heike}, year={2019}, pages={3–20} }' chicago: Isenberg, Tobias, Marie-Christine Jakobs, Felix Pauck, and Heike Wehrheim. “When Are Software Verification Results Valid for Approximate Hardware?” In 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, 3–20, 2019. https://doi.org/10.1007/978-3-030-31157-5_1. ieee: 'T. Isenberg, M.-C. Jakobs, F. Pauck, and H. Wehrheim, “When Are Software Verification Results Valid for Approximate Hardware?,” in 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, 2019, pp. 3–20, doi: 10.1007/978-3-030-31157-5_1.' mla: Isenberg, Tobias, et al. “When Are Software Verification Results Valid for Approximate Hardware?” 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, 2019, pp. 3–20, doi:10.1007/978-3-030-31157-5_1. short: 'T. Isenberg, M.-C. Jakobs, F. Pauck, H. Wehrheim, in: 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, 2019, pp. 3–20.' date_created: 2019-10-16T09:40:20Z date_updated: 2023-01-18T08:41:17Z department: - _id: '77' doi: 10.1007/978-3-030-31157-5_1 language: - iso: eng page: 3-20 project: - _id: '12' name: SFB 901 - Subproject B4 - _id: '3' name: SFB 901 - Project Area B - _id: '1' name: SFB 901 publication: 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 publication_status: published status: public title: When Are Software Verification Results Valid for Approximate Hardware? type: conference user_id: '22398' year: '2019' ... --- _id: '3320' author: - first_name: Kai full_name: Rautenberg, Kai last_name: Rautenberg citation: ama: Rautenberg K. Korrektheitsbeweise für Muster von Servicekompositionen. Universität Paderborn; 2018. apa: Rautenberg, K. (2018). Korrektheitsbeweise für Muster von Servicekompositionen. Universität Paderborn. bibtex: '@book{Rautenberg_2018, title={Korrektheitsbeweise für Muster von Servicekompositionen}, publisher={Universität Paderborn}, author={Rautenberg, Kai}, year={2018} }' chicago: Rautenberg, Kai. Korrektheitsbeweise für Muster von Servicekompositionen. Universität Paderborn, 2018. ieee: K. Rautenberg, Korrektheitsbeweise für Muster von Servicekompositionen. Universität Paderborn, 2018. mla: Rautenberg, Kai. Korrektheitsbeweise für Muster von Servicekompositionen. Universität Paderborn, 2018. short: K. Rautenberg, Korrektheitsbeweise für Muster von Servicekompositionen, Universität Paderborn, 2018. date_created: 2018-06-25T07:53:32Z date_updated: 2022-01-06T06:59:10Z department: - _id: '7' - _id: '77' language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '11' name: SFB 901 - Subproject B3 publisher: Universität Paderborn status: public supervisor: - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim title: Korrektheitsbeweise für Muster von Servicekompositionen type: bachelorsthesis user_id: '477' year: '2018' ... --- _id: '3414' abstract: - lang: eng text: "Over the years, Design by Contract (DbC) has evolved as a\r\npowerful concept for program documentation, testing, and verification.\r\nContracts formally specify assertions on (mostly) object-oriented programs:\r\npre- and postconditions of methods, class invariants, allowed call\r\norders, etc. Missing in the long list of properties specifiable by contracts\r\nare, however, method correlations: DbC languages fall short on stating\r\nassertions relating methods.\r\nIn this paper, we propose the novel concept of inter-method contract,\r\nallowing precisely for expressing method correlations.We present JMC as\r\na language for specifying and JMCTest as a tool for dynamically checking\r\ninter-method contracts on Java programs. JMCTest fully automatically\r\ngenerates objects on which the contracted methods are called and\r\nthe validity of the contract is checked. Using JMCTest, we detected\r\nthat large Java code bases (e.g. JBoss, Java RT) frequently violate standard\r\ninter-method contracts. In comparison to other verification tools\r\ninspecting (some) inter-method contracts, JMCTest can find bugs that\r\nremain undetected by those tools." author: - first_name: Paul full_name: Börding, Paul last_name: Börding - first_name: Jan Frederik full_name: Haltermann, Jan Frederik id: '44413' last_name: Haltermann - first_name: Marie-Christine full_name: Jakobs, Marie-Christine last_name: Jakobs - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Börding P, Haltermann JF, Jakobs M-C, Wehrheim H. JMCTest: Automatically Testing Inter-Method Contracts in Java. In: Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018). Vol 11146. Lecture Notes in Computer Science. Springer; 2018:39--55.' apa: 'Börding, P., Haltermann, J. F., Jakobs, M.-C., & Wehrheim, H. (2018). JMCTest: Automatically Testing Inter-Method Contracts in Java. In Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018) (Vol. 11146, pp. 39--55). Cádiz, Spain: Springer.' bibtex: '@inproceedings{Börding_Haltermann_Jakobs_Wehrheim_2018, series={Lecture Notes in Computer Science}, title={JMCTest: Automatically Testing Inter-Method Contracts in Java}, volume={11146}, booktitle={Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018)}, publisher={Springer}, author={Börding, Paul and Haltermann, Jan Frederik and Jakobs, Marie-Christine and Wehrheim, Heike}, year={2018}, pages={39--55}, collection={Lecture Notes in Computer Science} }' chicago: 'Börding, Paul, Jan Frederik Haltermann, Marie-Christine Jakobs, and Heike Wehrheim. “JMCTest: Automatically Testing Inter-Method Contracts in Java.” In Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018), 11146:39--55. Lecture Notes in Computer Science. Springer, 2018.' ieee: 'P. Börding, J. F. Haltermann, M.-C. Jakobs, and H. Wehrheim, “JMCTest: Automatically Testing Inter-Method Contracts in Java,” in Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018), Cádiz, Spain, 2018, vol. 11146, pp. 39--55.' mla: 'Börding, Paul, et al. “JMCTest: Automatically Testing Inter-Method Contracts in Java.” Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018), vol. 11146, Springer, 2018, pp. 39--55.' short: 'P. Börding, J.F. Haltermann, M.-C. Jakobs, H. Wehrheim, in: Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018), Springer, 2018, pp. 39--55.' conference: end_date: 2018-10-03 location: Cádiz, Spain name: IFIP International Conference on Testing Software and Systems start_date: 2018-10-01 date_created: 2018-07-02T09:06:56Z date_updated: 2022-01-06T06:59:15Z ddc: - '006' department: - _id: '7' - _id: '77' file: - access_level: closed content_type: application/pdf creator: schlatt date_created: 2018-11-21T09:35:35Z date_updated: 2018-11-21T09:35:35Z file_id: '5770' file_name: Börding2018_Chapter_JMCTestAutomaticallyTestingInt.pdf file_size: 574386 relation: main_file success: 1 file_date_updated: 2018-11-21T09:35:35Z has_accepted_license: '1' intvolume: ' 11146' language: - iso: eng page: 39--55 project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '11' name: SFB 901 - Subproject B3 publication: Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018) publication_status: published publisher: Springer series_title: Lecture Notes in Computer Science status: public title: 'JMCTest: Automatically Testing Inter-Method Contracts in Java' type: conference user_id: '29719' volume: 11146 year: '2018' ... --- _id: '3536' author: - first_name: Gerhard full_name: Schellhorn, Gerhard last_name: Schellhorn - first_name: Monika full_name: Wedel, Monika last_name: Wedel - first_name: Oleg full_name: Travkin, Oleg last_name: Travkin - first_name: Jürgen full_name: König, Jürgen id: '22358' last_name: König - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Schellhorn G, Wedel M, Travkin O, König J, Wehrheim H. FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity. In: Software Engineering and Formal Methods. Cham: Springer International Publishing; 2018:105-120. doi:10.1007/978-3-319-92970-5_7' apa: 'Schellhorn, G., Wedel, M., Travkin, O., König, J., & Wehrheim, H. (2018). FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity. In Software Engineering and Formal Methods (pp. 105–120). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-92970-5_7' bibtex: '@inbook{Schellhorn_Wedel_Travkin_König_Wehrheim_2018, place={Cham}, title={FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity}, DOI={10.1007/978-3-319-92970-5_7}, booktitle={Software Engineering and Formal Methods}, publisher={Springer International Publishing}, author={Schellhorn, Gerhard and Wedel, Monika and Travkin, Oleg and König, Jürgen and Wehrheim, Heike}, year={2018}, pages={105–120} }' chicago: 'Schellhorn, Gerhard, Monika Wedel, Oleg Travkin, Jürgen König, and Heike Wehrheim. “FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity.” In Software Engineering and Formal Methods, 105–20. Cham: Springer International Publishing, 2018. https://doi.org/10.1007/978-3-319-92970-5_7.' ieee: 'G. Schellhorn, M. Wedel, O. Travkin, J. König, and H. Wehrheim, “FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity,” in Software Engineering and Formal Methods, Cham: Springer International Publishing, 2018, pp. 105–120.' mla: Schellhorn, Gerhard, et al. “FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity.” Software Engineering and Formal Methods, Springer International Publishing, 2018, pp. 105–20, doi:10.1007/978-3-319-92970-5_7. short: 'G. Schellhorn, M. Wedel, O. Travkin, J. König, H. Wehrheim, in: Software Engineering and Formal Methods, Springer International Publishing, Cham, 2018, pp. 105–120.' date_created: 2018-07-11T06:19:58Z date_updated: 2022-01-06T06:59:22Z department: - _id: '77' doi: 10.1007/978-3-319-92970-5_7 page: 105-120 place: Cham project: - _id: '78' name: Validation of Software Transactional Memory publication: Software Engineering and Formal Methods publication_identifier: isbn: - '9783319929699' - '9783319929705' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer International Publishing status: public title: FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity type: book_chapter user_id: '29719' year: '2018' ... --- _id: '3153' author: - first_name: Simon full_name: Doherty, Simon last_name: Doherty - first_name: John full_name: Derrick, John last_name: Derrick - first_name: Brijesh full_name: Dongol, Brijesh last_name: Dongol - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Doherty S, Derrick J, Dongol B, Wehrheim H. Causal Linearizability: Compositionality for Partially Ordered Executions. CoRR. 2018.' apa: 'Doherty, S., Derrick, J., Dongol, B., & Wehrheim, H. (2018). Causal Linearizability: Compositionality for Partially Ordered Executions. CoRR.' bibtex: '@article{Doherty_Derrick_Dongol_Wehrheim_2018, title={Causal Linearizability: Compositionality for Partially Ordered Executions}, journal={CoRR}, author={Doherty, Simon and Derrick, John and Dongol, Brijesh and Wehrheim, Heike}, year={2018} }' chicago: 'Doherty, Simon, John Derrick, Brijesh Dongol, and Heike Wehrheim. “Causal Linearizability: Compositionality for Partially Ordered Executions.” CoRR, 2018.' ieee: 'S. Doherty, J. Derrick, B. Dongol, and H. Wehrheim, “Causal Linearizability: Compositionality for Partially Ordered Executions,” CoRR, 2018.' mla: 'Doherty, Simon, et al. “Causal Linearizability: Compositionality for Partially Ordered Executions.” CoRR, 2018.' short: S. Doherty, J. Derrick, B. Dongol, H. Wehrheim, CoRR (2018). date_created: 2018-06-13T07:26:35Z date_updated: 2022-01-06T06:59:00Z department: - _id: '77' publication: CoRR status: public title: 'Causal Linearizability: Compositionality for Partially Ordered Executions' type: journal_article user_id: '29719' year: '2018' ... --- _id: '2711' abstract: - lang: eng text: "In recent years, researchers have developed a number of tools to conduct\r\ntaint analysis of Android applications. While all the respective papers aim at\r\nproviding a thorough empirical evaluation, comparability is hindered by varying\r\nor unclear evaluation targets. Sometimes, the apps used for evaluation are not\r\nprecisely described. In other cases, authors use an established benchmark but\r\ncover it only partially. In yet other cases, the evaluations differ in terms of\r\nthe data leaks searched for, or lack a ground truth to compare against. All\r\nthose limitations make it impossible to truly compare the tools based on those\r\npublished evaluations.\r\n We thus present ReproDroid, a framework allowing the accurate comparison of\r\nAndroid taint analysis tools. ReproDroid supports researchers in inferring the\r\nground truth for data leaks in apps, in automatically applying tools to\r\nbenchmarks, and in evaluating the obtained results. We use ReproDroid to\r\ncomparatively evaluate on equal grounds the six prominent taint analysis tools\r\nAmandroid, DIALDroid, DidFail, DroidSafe, FlowDroid and IccTA. The results are\r\nlargely positive although four tools violate some promises concerning features\r\nand accuracy. Finally, we contribute to the area of unbiased benchmarking with\r\na new and improved version of the open test suite DroidBench." author: - first_name: Felix full_name: Pauck, Felix id: '22398' last_name: Pauck - first_name: Eric full_name: Bodden, Eric id: '59256' last_name: Bodden orcid: 0000-0003-3470-3647 - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: Pauck F, Bodden E, Wehrheim H. Do Android Taint Analysis Tools Keep their Promises? arXiv:180402903. 2018. apa: Pauck, F., Bodden, E., & Wehrheim, H. (2018). Do Android Taint Analysis Tools Keep their Promises? ArXiv:1804.02903. bibtex: '@article{Pauck_Bodden_Wehrheim_2018, title={Do Android Taint Analysis Tools Keep their Promises?}, journal={arXiv:1804.02903}, author={Pauck, Felix and Bodden, Eric and Wehrheim, Heike}, year={2018} }' chicago: Pauck, Felix, Eric Bodden, and Heike Wehrheim. “Do Android Taint Analysis Tools Keep Their Promises?” ArXiv:1804.02903, 2018. ieee: F. Pauck, E. Bodden, and H. Wehrheim, “Do Android Taint Analysis Tools Keep their Promises?,” arXiv:1804.02903. 2018. mla: Pauck, Felix, et al. “Do Android Taint Analysis Tools Keep Their Promises?” ArXiv:1804.02903, 2018. short: F. Pauck, E. Bodden, H. Wehrheim, ArXiv:1804.02903 (2018). date_created: 2018-05-09T08:27:11Z date_updated: 2022-01-06T06:57:35Z ddc: - '000' department: - _id: '77' - _id: '76' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-11-21T10:49:23Z date_updated: 2018-11-21T10:49:23Z file_id: '5781' file_name: Do Android Taint Analysis Tools Keep their Promises.pdf file_size: 1045861 relation: main_file success: 1 file_date_updated: 2018-11-21T10:49:23Z has_accepted_license: '1' 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: arXiv:1804.02903 status: public title: Do Android Taint Analysis Tools Keep their Promises? type: preprint user_id: '477' year: '2018' ... --- _id: '5774' abstract: - lang: eng text: Information flow analysis investigates the flow of data in applications, checking in particular for flows from private sources to public sinks. Flow- and path-sensitive analyses are, however, often too costly to be performed every time a security-critical application is run. In this paper, we propose a variant of proof carrying code for information flow security. To this end, we develop information flow (IF) certificates which get attached to programs as well as a method for IF certificate validation. We prove soundness of our technique, i.e., show it to be tamper-free. The technique is implemented within the program analysis tool CPAchecker. Our experiments confirm that the use of certificates pays off for costly analysis runs. author: - first_name: Manuel full_name: Töws, Manuel id: '11315' last_name: Töws - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Töws M, Wehrheim H. Information Flow Certificates. In: Theoretical Aspects of Computing – ICTAC 2018. Cham: Springer International Publishing; 2018:435-454. doi:10.1007/978-3-030-02508-3_23' apa: 'Töws, M., & Wehrheim, H. (2018). Information Flow Certificates. In Theoretical Aspects of Computing – ICTAC 2018 (pp. 435–454). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-030-02508-3_23' bibtex: '@inproceedings{Töws_Wehrheim_2018, place={Cham}, title={Information Flow Certificates}, DOI={10.1007/978-3-030-02508-3_23}, booktitle={Theoretical Aspects of Computing – ICTAC 2018}, publisher={Springer International Publishing}, author={Töws, Manuel and Wehrheim, Heike}, year={2018}, pages={435–454} }' chicago: 'Töws, Manuel, and Heike Wehrheim. “Information Flow Certificates.” In Theoretical Aspects of Computing – ICTAC 2018, 435–54. Cham: Springer International Publishing, 2018. https://doi.org/10.1007/978-3-030-02508-3_23.' ieee: M. Töws and H. Wehrheim, “Information Flow Certificates,” in Theoretical Aspects of Computing – ICTAC 2018, 2018, pp. 435–454. mla: Töws, Manuel, and Heike Wehrheim. “Information Flow Certificates.” Theoretical Aspects of Computing – ICTAC 2018, Springer International Publishing, 2018, pp. 435–54, doi:10.1007/978-3-030-02508-3_23. short: 'M. Töws, H. Wehrheim, in: Theoretical Aspects of Computing – ICTAC 2018, Springer International Publishing, Cham, 2018, pp. 435–454.' date_created: 2018-11-21T09:51:37Z date_updated: 2022-01-06T07:02:40Z ddc: - '000' department: - _id: '77' doi: 10.1007/978-3-030-02508-3_23 file: - access_level: closed content_type: application/pdf creator: mtoews date_created: 2018-11-26T15:11:32Z date_updated: 2018-11-26T15:11:32Z file_id: '5837' file_name: Töws-Wehrheim2018_Chapter_InformationFlowCertificates.pdf file_size: 518016 relation: main_file success: 1 file_date_updated: 2018-11-26T15:11:32Z has_accepted_license: '1' language: - iso: eng page: 435-454 place: Cham project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '12' name: SFB 901 - Subproject B4 publication: Theoretical Aspects of Computing – ICTAC 2018 publication_identifier: isbn: - '9783030025076' - '9783030025083' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer International Publishing status: public title: Information Flow Certificates type: conference user_id: '477' year: '2018' ... --- _id: '4999' author: - first_name: Felix full_name: Pauck, Felix id: '22398' last_name: Pauck - first_name: Eric full_name: Bodden, Eric id: '59256' last_name: Bodden orcid: 0000-0003-3470-3647 - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Pauck F, Bodden E, Wehrheim H. Do Android taint analysis tools keep their promises? In: Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018. ACM Press; 2018. doi:10.1145/3236024.3236029' apa: Pauck, F., Bodden, E., & Wehrheim, H. (2018). Do Android taint analysis tools keep their promises? In Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018. ACM Press. https://doi.org/10.1145/3236024.3236029 bibtex: '@inproceedings{Pauck_Bodden_Wehrheim_2018, title={Do Android taint analysis tools keep their promises?}, DOI={10.1145/3236024.3236029}, booktitle={Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018}, publisher={ACM Press}, author={Pauck, Felix and Bodden, Eric and Wehrheim, Heike}, year={2018} }' chicago: Pauck, Felix, Eric Bodden, and Heike Wehrheim. “Do Android Taint Analysis Tools Keep Their Promises?” In Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018. ACM Press, 2018. https://doi.org/10.1145/3236024.3236029. ieee: F. Pauck, E. Bodden, and H. Wehrheim, “Do Android taint analysis tools keep their promises?,” in Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018, 2018. mla: Pauck, Felix, et al. “Do Android Taint Analysis Tools Keep Their Promises?” Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018, ACM Press, 2018, doi:10.1145/3236024.3236029. short: 'F. Pauck, E. Bodden, H. Wehrheim, in: Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018, ACM Press, 2018.' date_created: 2018-10-30T08:03:17Z date_updated: 2022-01-06T07:01:34Z ddc: - '004' department: - _id: '77' - _id: '76' doi: 10.1145/3236024.3236029 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T13:37:38Z date_updated: 2018-11-02T13:37:38Z file_id: '5251' file_name: fse18main-id76-p.pdf file_size: 524169 relation: main_file success: 1 file_date_updated: 2018-11-02T13:37:38Z has_accepted_license: '1' language: - iso: eng project: - _id: '3' name: SFB 901 - Project Area B - _id: '12' name: SFB 901 - Subproject B4 - _id: '1' name: SFB 901 publication: Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering - ESEC/FSE 2018 publication_identifier: isbn: - '9781450355735' publication_status: published publisher: ACM Press status: public title: Do Android taint analysis tools keep their promises? type: conference user_id: '477' year: '2018' ... --- _id: '6828' 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: Oleg full_name: Travkin, Oleg last_name: Travkin - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Derrick J, Doherty S, Dongol B, Schellhorn G, Travkin O, Wehrheim H. Mechanized proofs of opacity: a comparison of two techniques. Formal Asp Comput. 2018;30(5):597-625. doi:10.1007/s00165-017-0433-3' apa: 'Derrick, J., Doherty, S., Dongol, B., Schellhorn, G., Travkin, O., & Wehrheim, H. (2018). Mechanized proofs of opacity: a comparison of two techniques. Formal Asp. Comput., 30(5), 597–625. https://doi.org/10.1007/s00165-017-0433-3' bibtex: '@article{Derrick_Doherty_Dongol_Schellhorn_Travkin_Wehrheim_2018, title={Mechanized proofs of opacity: a comparison of two techniques}, volume={30}, DOI={10.1007/s00165-017-0433-3}, number={5}, journal={Formal Asp. Comput.}, author={Derrick, John and Doherty, Simon and Dongol, Brijesh and Schellhorn, Gerhard and Travkin, Oleg and Wehrheim, Heike}, year={2018}, pages={597–625} }' chicago: 'Derrick, John, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, Oleg Travkin, and Heike Wehrheim. “Mechanized Proofs of Opacity: A Comparison of Two Techniques.” Formal Asp. Comput. 30, no. 5 (2018): 597–625. https://doi.org/10.1007/s00165-017-0433-3.' ieee: 'J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, O. Travkin, and H. Wehrheim, “Mechanized proofs of opacity: a comparison of two techniques,” Formal Asp. Comput., vol. 30, no. 5, pp. 597–625, 2018.' mla: 'Derrick, John, et al. “Mechanized Proofs of Opacity: A Comparison of Two Techniques.” Formal Asp. Comput., vol. 30, no. 5, 2018, pp. 597–625, doi:10.1007/s00165-017-0433-3.' short: J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, O. Travkin, H. Wehrheim, Formal Asp. Comput. 30 (2018) 597–625. date_created: 2019-01-17T08:28:33Z date_updated: 2022-01-06T07:03:21Z department: - _id: '77' doi: 10.1007/s00165-017-0433-3 intvolume: ' 30' issue: '5' language: - iso: eng page: 597-625 publication: Formal Asp. Comput. status: public title: 'Mechanized proofs of opacity: a comparison of two techniques' type: journal_article user_id: '29719' volume: 30 year: '2018' ... --- _id: '6836' author: - first_name: Simon full_name: Doherty, Simon last_name: Doherty - first_name: Brijesh full_name: Dongol, Brijesh last_name: Dongol - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim - first_name: John full_name: Derrick, John last_name: Derrick citation: ama: 'Doherty S, Dongol B, Wehrheim H, Derrick J. Making Linearizability Compositional for Partially Ordered Executions. In: Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings. ; 2018:110-129. doi:10.1007/978-3-319-98938-9\_7' apa: Doherty, S., Dongol, B., Wehrheim, H., & Derrick, J. (2018). Making Linearizability Compositional for Partially Ordered Executions. In Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings (pp. 110–129). https://doi.org/10.1007/978-3-319-98938-9\_7 bibtex: '@inproceedings{Doherty_Dongol_Wehrheim_Derrick_2018, title={Making Linearizability Compositional for Partially Ordered Executions}, DOI={10.1007/978-3-319-98938-9\_7}, booktitle={Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings}, author={Doherty, Simon and Dongol, Brijesh and Wehrheim, Heike and Derrick, John}, year={2018}, pages={110–129} }' chicago: Doherty, Simon, Brijesh Dongol, Heike Wehrheim, and John Derrick. “Making Linearizability Compositional for Partially Ordered Executions.” In Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings, 110–29, 2018. https://doi.org/10.1007/978-3-319-98938-9\_7. ieee: S. Doherty, B. Dongol, H. Wehrheim, and J. Derrick, “Making Linearizability Compositional for Partially Ordered Executions,” in Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings, 2018, pp. 110–129. mla: Doherty, Simon, et al. “Making Linearizability Compositional for Partially Ordered Executions.” Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings, 2018, pp. 110–29, doi:10.1007/978-3-319-98938-9\_7. short: 'S. Doherty, B. Dongol, H. Wehrheim, J. Derrick, in: Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings, 2018, pp. 110–129.' date_created: 2019-01-17T08:44:13Z date_updated: 2022-01-06T07:03:21Z department: - _id: '77' doi: 10.1007/978-3-319-98938-9\_7 language: - iso: eng page: 110-129 publication: Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings status: public title: Making Linearizability Compositional for Partially Ordered Executions type: conference user_id: '29719' year: '2018' ... --- _id: '6838' author: - first_name: Simon full_name: Doherty, Simon last_name: Doherty - first_name: Brijesh full_name: Dongol, Brijesh last_name: Dongol - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim - first_name: John full_name: Derrick, John last_name: Derrick citation: ama: 'Doherty S, Dongol B, Wehrheim H, Derrick J. Making Linearizability Compositional for Partially Ordered Executions. In: Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings. ; 2018:110-129. doi:10.1007/978-3-319-98938-9\_7' apa: Doherty, S., Dongol, B., Wehrheim, H., & Derrick, J. (2018). Making Linearizability Compositional for Partially Ordered Executions. In Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings (pp. 110–129). https://doi.org/10.1007/978-3-319-98938-9\_7 bibtex: '@inproceedings{Doherty_Dongol_Wehrheim_Derrick_2018, title={Making Linearizability Compositional for Partially Ordered Executions}, DOI={10.1007/978-3-319-98938-9\_7}, booktitle={Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings}, author={Doherty, Simon and Dongol, Brijesh and Wehrheim, Heike and Derrick, John}, year={2018}, pages={110–129} }' chicago: Doherty, Simon, Brijesh Dongol, Heike Wehrheim, and John Derrick. “Making Linearizability Compositional for Partially Ordered Executions.” In Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings, 110–29, 2018. https://doi.org/10.1007/978-3-319-98938-9\_7. ieee: S. Doherty, B. Dongol, H. Wehrheim, and J. Derrick, “Making Linearizability Compositional for Partially Ordered Executions,” in Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings, 2018, pp. 110–129. mla: Doherty, Simon, et al. “Making Linearizability Compositional for Partially Ordered Executions.” Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings, 2018, pp. 110–29, doi:10.1007/978-3-319-98938-9\_7. short: 'S. Doherty, B. Dongol, H. Wehrheim, J. Derrick, in: Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings, 2018, pp. 110–129.' date_created: 2019-01-17T08:46:30Z date_updated: 2022-01-06T07:03:21Z department: - _id: '77' doi: 10.1007/978-3-319-98938-9\_7 language: - iso: eng page: 110-129 publication: Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings status: public title: Making Linearizability Compositional for Partially Ordered Executions type: conference user_id: '29719' year: '2018' ... --- _id: '6839' author: - first_name: Simon full_name: Doherty, Simon last_name: Doherty - first_name: Brijesh full_name: Dongol, Brijesh last_name: Dongol - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim - first_name: John full_name: Derrick, John last_name: Derrick citation: ama: 'Doherty S, Dongol B, Wehrheim H, Derrick J. Brief Announcement: Generalising Concurrent Correctness to Weak Memory. In: 32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018. ; 2018:45:1-45:3. doi:10.4230/LIPIcs.DISC.2018.45' apa: 'Doherty, S., Dongol, B., Wehrheim, H., & Derrick, J. (2018). Brief Announcement: Generalising Concurrent Correctness to Weak Memory. In 32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018 (pp. 45:1-45:3). https://doi.org/10.4230/LIPIcs.DISC.2018.45' bibtex: '@inproceedings{Doherty_Dongol_Wehrheim_Derrick_2018, title={Brief Announcement: Generalising Concurrent Correctness to Weak Memory}, DOI={10.4230/LIPIcs.DISC.2018.45}, booktitle={32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018}, author={Doherty, Simon and Dongol, Brijesh and Wehrheim, Heike and Derrick, John}, year={2018}, pages={45:1-45:3} }' chicago: 'Doherty, Simon, Brijesh Dongol, Heike Wehrheim, and John Derrick. “Brief Announcement: Generalising Concurrent Correctness to Weak Memory.” In 32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018, 45:1-45:3, 2018. https://doi.org/10.4230/LIPIcs.DISC.2018.45.' ieee: 'S. Doherty, B. Dongol, H. Wehrheim, and J. Derrick, “Brief Announcement: Generalising Concurrent Correctness to Weak Memory,” in 32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018, 2018, pp. 45:1-45:3.' mla: 'Doherty, Simon, et al. “Brief Announcement: Generalising Concurrent Correctness to Weak Memory.” 32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018, 2018, pp. 45:1-45:3, doi:10.4230/LIPIcs.DISC.2018.45.' short: 'S. Doherty, B. Dongol, H. Wehrheim, J. Derrick, in: 32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018, 2018, pp. 45:1-45:3.' date_created: 2019-01-17T08:54:03Z date_updated: 2022-01-06T07:03:21Z department: - _id: '77' doi: 10.4230/LIPIcs.DISC.2018.45 language: - iso: eng page: 45:1-45:3 publication: 32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018 status: public title: 'Brief Announcement: Generalising Concurrent Correctness to Weak Memory' type: conference user_id: '29719' year: '2018' ... --- _id: '1043' abstract: - lang: eng text: 'Approximate computing (AC) is an emerging paradigm for energy-efficient computation. The basic idea of AC is to sacrifice high precision for low energy by allowing hardware to carry out “approximately correct” calculations. This provides a major challenge for software quality assurance: programs successfully verified to be correct might be erroneous on approximate hardware. In this letter, we present a novel approach for determining under what conditions a software verification result is valid for approximate hardware. To this end, we compute the allowed tolerances for AC hardware from successful verification runs. More precisely, we derive a set of constraints which—when met by the AC hardware—guarantees the verification result to carry over to AC. On the practical side, we furthermore: 1) show how to extract tolerances from verification runs employing predicate abstraction as verification technology and 2) show how to check such constraints on hardware designs. We have implemented all techniques, and exemplify them on example C programs and a number of recently proposed approximate adders.' author: - first_name: Tobias full_name: Isenberg, Tobias last_name: Isenberg - first_name: Marie-Christine full_name: Jakobs, Marie-Christine last_name: Jakobs - first_name: Felix full_name: Pauck, Felix id: '22398' last_name: Pauck - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: Isenberg T, Jakobs M-C, Pauck F, Wehrheim H. Validity of Software Verification Results on Approximate Hardware. IEEE Embedded Systems Letters. 2018:22-25. doi:10.1109/LES.2017.2758200 apa: Isenberg, T., Jakobs, M.-C., Pauck, F., & Wehrheim, H. (2018). Validity of Software Verification Results on Approximate Hardware. IEEE Embedded Systems Letters, 22–25. https://doi.org/10.1109/LES.2017.2758200 bibtex: '@article{Isenberg_Jakobs_Pauck_Wehrheim_2018, title={Validity of Software Verification Results on Approximate Hardware}, DOI={10.1109/LES.2017.2758200}, journal={IEEE Embedded Systems Letters}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Isenberg, Tobias and Jakobs, Marie-Christine and Pauck, Felix and Wehrheim, Heike}, year={2018}, pages={22–25} }' chicago: Isenberg, Tobias, Marie-Christine Jakobs, Felix Pauck, and Heike Wehrheim. “Validity of Software Verification Results on Approximate Hardware.” IEEE Embedded Systems Letters, 2018, 22–25. https://doi.org/10.1109/LES.2017.2758200. ieee: T. Isenberg, M.-C. Jakobs, F. Pauck, and H. Wehrheim, “Validity of Software Verification Results on Approximate Hardware,” IEEE Embedded Systems Letters, pp. 22–25, 2018. mla: Isenberg, Tobias, et al. “Validity of Software Verification Results on Approximate Hardware.” IEEE Embedded Systems Letters, Institute of Electrical and Electronics Engineers (IEEE), 2018, pp. 22–25, doi:10.1109/LES.2017.2758200. short: T. Isenberg, M.-C. Jakobs, F. Pauck, H. Wehrheim, IEEE Embedded Systems Letters (2018) 22–25. date_created: 2017-12-11T16:11:00Z date_updated: 2022-01-06T06:50:39Z ddc: - '000' department: - _id: '77' doi: 10.1109/LES.2017.2758200 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T15:27:04Z date_updated: 2018-11-02T15:27:04Z file_id: '5303' file_name: 08053741.pdf file_size: 523362 relation: main_file success: 1 file_date_updated: 2018-11-02T15:27:04Z has_accepted_license: '1' language: - iso: eng page: 22-25 project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '12' name: SFB 901 - Subproject B4 publication: IEEE Embedded Systems Letters publication_identifier: issn: - 1943-0663 - 1943-0671 publication_status: published publisher: Institute of Electrical and Electronics Engineers (IEEE) status: public title: Validity of Software Verification Results on Approximate Hardware type: journal_article user_id: '477' year: '2018' ... --- _id: '1096' abstract: - lang: eng text: to appear author: - first_name: Dirk full_name: Beyer, Dirk last_name: Beyer - first_name: Marie-Christine full_name: Jakobs, Marie-Christine last_name: Jakobs - first_name: Thomas full_name: Lemberger, Thomas last_name: Lemberger - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Beyer D, Jakobs M-C, Lemberger T, Wehrheim H. Reducer-Based Construction of Conditional Verifiers. In: Proceedings of the 40th International Conference on Software Engineering (ICSE). ACM; 2018:1182--1193.' apa: 'Beyer, D., Jakobs, M.-C., Lemberger, T., & Wehrheim, H. (2018). Reducer-Based Construction of Conditional Verifiers. In Proceedings of the 40th International Conference on Software Engineering (ICSE) (pp. 1182--1193). Gothenburg, Sweden: ACM.' bibtex: '@inproceedings{Beyer_Jakobs_Lemberger_Wehrheim_2018, title={Reducer-Based Construction of Conditional Verifiers}, booktitle={Proceedings of the 40th International Conference on Software Engineering (ICSE)}, publisher={ACM}, author={Beyer, Dirk and Jakobs, Marie-Christine and Lemberger, Thomas and Wehrheim, Heike}, year={2018}, pages={1182--1193} }' chicago: Beyer, Dirk, Marie-Christine Jakobs, Thomas Lemberger, and Heike Wehrheim. “Reducer-Based Construction of Conditional Verifiers.” In Proceedings of the 40th International Conference on Software Engineering (ICSE), 1182--1193. ACM, 2018. ieee: D. Beyer, M.-C. Jakobs, T. Lemberger, and H. Wehrheim, “Reducer-Based Construction of Conditional Verifiers,” in Proceedings of the 40th International Conference on Software Engineering (ICSE), Gothenburg, Sweden, 2018, pp. 1182--1193. mla: Beyer, Dirk, et al. “Reducer-Based Construction of Conditional Verifiers.” Proceedings of the 40th International Conference on Software Engineering (ICSE), ACM, 2018, pp. 1182--1193. short: 'D. Beyer, M.-C. Jakobs, T. Lemberger, H. Wehrheim, in: Proceedings of the 40th International Conference on Software Engineering (ICSE), ACM, 2018, pp. 1182--1193.' conference: end_date: 2018-06-03 location: Gothenburg, Sweden name: 40th International Conference on Software Engineering start_date: 2018-05-27 date_created: 2018-01-08T10:52:51Z date_updated: 2022-01-06T06:50:54Z ddc: - '000' department: - _id: '77' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-11-21T10:50:51Z date_updated: 2018-11-21T10:50:51Z file_id: '5783' file_name: Reducer-Based Construction of Conditional Verifiers.pdf file_size: 826719 relation: main_file success: 1 file_date_updated: 2018-11-21T10:50:51Z has_accepted_license: '1' language: - iso: eng page: 1182--1193 project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '12' name: SFB 901 - Subproject B4 - _id: '85' name: Kooperative Softwareverifikation publication: Proceedings of the 40th International Conference on Software Engineering (ICSE) publisher: ACM status: public title: Reducer-Based Construction of Conditional Verifiers type: conference user_id: '29719' year: '2018' ... --- _id: '3512' author: - first_name: Paul full_name: Börding, Paul last_name: Börding citation: ama: Börding P. Testing Java Method Contracts. Universität Paderborn; 2017. apa: Börding, P. (2017). Testing Java Method Contracts. Universität Paderborn. bibtex: '@book{Börding_2017, title={Testing Java Method Contracts}, publisher={Universität Paderborn}, author={Börding, Paul}, year={2017} }' chicago: Börding, Paul. Testing Java Method Contracts. Universität Paderborn, 2017. ieee: P. Börding, Testing Java Method Contracts. Universität Paderborn, 2017. mla: Börding, Paul. Testing Java Method Contracts. Universität Paderborn, 2017. short: P. Börding, Testing Java Method Contracts, Universität Paderborn, 2017. date_created: 2018-07-09T09:32:41Z date_updated: 2022-01-06T06:59:21Z department: - _id: '7' - _id: '77' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '11' name: SFB 901 - Subproject B3 publisher: Universität Paderborn status: public supervisor: - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim title: Testing Java Method Contracts type: mastersthesis user_id: '477' year: '2017' ... --- _id: '3155' author: - first_name: Manuel full_name: Töws, Manuel last_name: Töws - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Töws M, Wehrheim H. Policy Dependent and Independent Information Flow Analyses. In: Duan Z, Ong L, eds. Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November 13-17, 2017, Proceedings. Lecture Notes in Computer Science. ; 2017:362--378. doi:10.1007/978-3-319-68690-5_22' apa: Töws, M., & Wehrheim, H. (2017). Policy Dependent and Independent Information Flow Analyses. In Z. Duan & L. Ong (Eds.), Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November 13-17, 2017, Proceedings (pp. 362--378). https://doi.org/10.1007/978-3-319-68690-5_22 bibtex: '@inproceedings{Töws_Wehrheim_2017, series={Lecture Notes in Computer Science}, title={Policy Dependent and Independent Information Flow Analyses}, DOI={10.1007/978-3-319-68690-5_22}, booktitle={Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November 13-17, 2017, Proceedings}, author={Töws, Manuel and Wehrheim, Heike}, editor={Duan, Zhenhua and Ong, LukeEditors}, year={2017}, pages={362--378}, collection={Lecture Notes in Computer Science} }' chicago: Töws, Manuel, and Heike Wehrheim. “Policy Dependent and Independent Information Flow Analyses.” In Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November 13-17, 2017, Proceedings, edited by Zhenhua Duan and Luke Ong, 362--378. Lecture Notes in Computer Science, 2017. https://doi.org/10.1007/978-3-319-68690-5_22. ieee: M. Töws and H. Wehrheim, “Policy Dependent and Independent Information Flow Analyses,” in Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November 13-17, 2017, Proceedings, 2017, pp. 362--378. mla: Töws, Manuel, and Heike Wehrheim. “Policy Dependent and Independent Information Flow Analyses.” Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November 13-17, 2017, Proceedings, edited by Zhenhua Duan and Luke Ong, 2017, pp. 362--378, doi:10.1007/978-3-319-68690-5_22. short: 'M. Töws, H. Wehrheim, in: Z. Duan, L. Ong (Eds.), Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November 13-17, 2017, Proceedings, 2017, pp. 362--378.' date_created: 2018-06-13T07:35:49Z date_updated: 2022-01-06T06:59:00Z department: - _id: '77' doi: 10.1007/978-3-319-68690-5_22 editor: - first_name: Zhenhua full_name: Duan, Zhenhua last_name: Duan - first_name: Luke full_name: Ong, Luke last_name: Ong page: 362--378 publication: Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM} 2017, Xi'an, China, November 13-17, 2017, Proceedings series_title: Lecture Notes in Computer Science status: public title: Policy Dependent and Independent Information Flow Analyses type: conference user_id: '29719' year: '2017' ... --- _id: '3156' author: - first_name: Jürgen full_name: König, Jürgen last_name: König - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'König J, Wehrheim H. Value-Based or Conflict-Based? Opacity Definitions for STMs. In: Van Hung D, Kapur D, eds. Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings. Lecture Notes in Computer Science. ; 2017:118--135. doi:10.1007/978-3-319-67729-3_8' apa: König, J., & Wehrheim, H. (2017). Value-Based or Conflict-Based? Opacity Definitions for STMs. In D. Van Hung & D. Kapur (Eds.), Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings (pp. 118--135). https://doi.org/10.1007/978-3-319-67729-3_8 bibtex: '@inproceedings{König_Wehrheim_2017, series={Lecture Notes in Computer Science}, title={Value-Based or Conflict-Based? Opacity Definitions for STMs}, DOI={10.1007/978-3-319-67729-3_8}, booktitle={Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings}, author={König, Jürgen and Wehrheim, Heike}, editor={Van Hung, Dang and Kapur, DeepakEditors}, year={2017}, pages={118--135}, collection={Lecture Notes in Computer Science} }' chicago: König, Jürgen, and Heike Wehrheim. “Value-Based or Conflict-Based? Opacity Definitions for STMs.” In Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings, edited by Dang Van Hung and Deepak Kapur, 118--135. Lecture Notes in Computer Science, 2017. https://doi.org/10.1007/978-3-319-67729-3_8. ieee: J. König and H. Wehrheim, “Value-Based or Conflict-Based? Opacity Definitions for STMs,” in Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings, 2017, pp. 118--135. mla: König, Jürgen, and Heike Wehrheim. “Value-Based or Conflict-Based? Opacity Definitions for STMs.” Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings, edited by Dang Van Hung and Deepak Kapur, 2017, pp. 118--135, doi:10.1007/978-3-319-67729-3_8. short: 'J. König, H. Wehrheim, in: D. Van Hung, D. Kapur (Eds.), Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings, 2017, pp. 118--135.' date_created: 2018-06-13T07:37:18Z date_updated: 2022-01-06T06:59:00Z department: - _id: '77' doi: 10.1007/978-3-319-67729-3_8 editor: - first_name: Dang full_name: Van Hung, Dang last_name: Van Hung - first_name: Deepak full_name: Kapur, Deepak last_name: Kapur page: 118--135 project: - _id: '78' name: Validation of Software Transactional Memory publication: Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings series_title: Lecture Notes in Computer Science status: public title: Value-Based or Conflict-Based? Opacity Definitions for STMs type: conference user_id: '29719' year: '2017' ... --- _id: '114' abstract: - lang: eng text: Proof witnesses are proof artifacts showing correctness of programs wrt. safety properties. The recent past has seen a rising interest in witnesses as (a) proofs in a proof-carrying-code context, (b) certificates for the correct functioning of verification tools, or simply (c) exchange formats for (partial) verification results. As witnesses in all theses scenarios need to be stored and processed, witnesses are required to be as small as possible. However, software verification tools – the prime suppliers of witnesses – do not necessarily construct small witnesses. In this paper, we present a formal account of proof witnesses. We introduce the concept of weakenings, reducing the complexity of proof witnesses while preserving the ability of witnessing safety. We develop aweakening technique for a specific class of program analyses, and prove it to be sound. Finally, we experimentally demonstrate our weakening technique to indeed achieve a size reduction of proof witnesses. author: - first_name: Marie-Christine full_name: Jakobs, Marie-Christine last_name: Jakobs - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Jakobs M-C, Wehrheim H. Compact Proof Witnesses. In: Barrett C, Davies M, Kahsai T, eds. NASA Formal Methods: 9th International Symposium. Lecture Notes in Computer Science. ; 2017:389-403. doi:10.1007/978-3-319-57288-8_28' apa: 'Jakobs, M.-C., & Wehrheim, H. (2017). Compact Proof Witnesses. In C. Barrett, M. Davies, & T. Kahsai (Eds.), NASA Formal Methods: 9th International Symposium (pp. 389–403). https://doi.org/10.1007/978-3-319-57288-8_28' bibtex: '@inproceedings{Jakobs_Wehrheim_2017, series={Lecture Notes in Computer Science}, title={Compact Proof Witnesses}, DOI={10.1007/978-3-319-57288-8_28}, booktitle={NASA Formal Methods: 9th International Symposium}, author={Jakobs, Marie-Christine and Wehrheim, Heike}, editor={Barrett, Clark and Davies, Misty and Kahsai, TemesghenEditors}, year={2017}, pages={389–403}, collection={Lecture Notes in Computer Science} }' chicago: 'Jakobs, Marie-Christine, and Heike Wehrheim. “Compact Proof Witnesses.” In NASA Formal Methods: 9th International Symposium, edited by Clark Barrett, Misty Davies, and Temesghen Kahsai, 389–403. Lecture Notes in Computer Science, 2017. https://doi.org/10.1007/978-3-319-57288-8_28.' ieee: 'M.-C. Jakobs and H. Wehrheim, “Compact Proof Witnesses,” in NASA Formal Methods: 9th International Symposium, 2017, pp. 389–403.' mla: 'Jakobs, Marie-Christine, and Heike Wehrheim. “Compact Proof Witnesses.” NASA Formal Methods: 9th International Symposium, edited by Clark Barrett et al., 2017, pp. 389–403, doi:10.1007/978-3-319-57288-8_28.' short: 'M.-C. Jakobs, H. Wehrheim, in: C. Barrett, M. Davies, T. Kahsai (Eds.), NASA Formal Methods: 9th International Symposium, 2017, pp. 389–403.' date_created: 2017-10-17T12:41:13Z date_updated: 2022-01-06T06:51:00Z ddc: - '040' department: - _id: '77' doi: 10.1007/978-3-319-57288-8_28 editor: - first_name: Clark full_name: Barrett, Clark last_name: Barrett - first_name: Misty full_name: Davies, Misty last_name: Davies - first_name: Temesghen full_name: Kahsai, Temesghen last_name: Kahsai file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T13:05:02Z date_updated: 2018-03-21T13:05:02Z file_id: '1565' file_name: 114-chp_3A10.1007_2F978-3-319-57288-8_28.pdf file_size: 492800 relation: main_file success: 1 file_date_updated: 2018-03-21T13:05:02Z has_accepted_license: '1' language: - iso: eng page: 389-403 project: - _id: '1' name: SFB 901 - _id: '12' name: SFB 901 - Subprojekt B4 - _id: '3' name: SFB 901 - Project Area B publication: 'NASA Formal Methods: 9th International Symposium' series_title: Lecture Notes in Computer Science status: public title: Compact Proof Witnesses type: conference user_id: '477' year: '2017' ... --- _id: '115' abstract: - lang: eng text: 'Whenever customers have to decide between different instances of the same product, they are interested in buying the best product. In contrast, companies are interested in reducing the construction effort (and usually as a consequence thereof, the quality) to gain profit. The described setting is widely known as opposed preferences in quality of the product and also applies to the context of service-oriented computing. In general, service-oriented computing emphasizes the construction of large software systems out of existing services, where services are small and self-contained pieces of software that adhere to a specified interface. Several implementations of the same interface are considered as several instances of the same service. Thereby, customers are interested in buying the best service implementation for their service composition wrt. to metrics, such as costs, energy, memory consumption, or execution time. One way to ensure the service quality is to employ certificates, which can come in different kinds: Technical certificates proving correctness can be automatically constructed by the service provider and again be automatically checked by the user. Digital certificates allow proof of the integrity of a product. Other certificates might be rolled out if service providers follow a good software construction principle, which is checked in annual audits. Whereas all of these certificates are handled differently in service markets, what they have in common is that they influence the buying decisions of customers. In this paper, we review state-of-the-art developments in certification with respect to service-oriented computing. We not only discuss how certificates are constructed and handled in service-oriented computing but also review the effects of certificates on the market from an economic perspective.' author: - first_name: Marie-Christine full_name: Jakobs, Marie-Christine last_name: Jakobs - first_name: Julia full_name: Krämer, Julia last_name: Krämer - first_name: Dirk full_name: van Straaten, Dirk id: '10311' last_name: van Straaten - first_name: Theodor full_name: Lettmann, Theodor id: '315' last_name: Lettmann orcid: 0000-0001-5859-2457 citation: ama: 'Jakobs M-C, Krämer J, van Straaten D, Lettmann T. Certification Matters for Service Markets. In: Marcelo De Barros, Janusz Klink,Tadeus Uhl TP, ed. The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION). ; 2017:7-12.' apa: Jakobs, M.-C., Krämer, J., van Straaten, D., & Lettmann, T. (2017). Certification Matters for Service Markets. In T. P. Marcelo De Barros, Janusz Klink,Tadeus Uhl (Ed.), The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION) (pp. 7–12). bibtex: '@inproceedings{Jakobs_Krämer_van Straaten_Lettmann_2017, title={Certification Matters for Service Markets}, booktitle={The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)}, author={Jakobs, Marie-Christine and Krämer, Julia and van Straaten, Dirk and Lettmann, Theodor}, editor={Marcelo De Barros, Janusz Klink,Tadeus Uhl, Thomas PrinzEditor}, year={2017}, pages={7–12} }' chicago: Jakobs, Marie-Christine, Julia Krämer, Dirk van Straaten, and Theodor Lettmann. “Certification Matters for Service Markets.” In The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION), edited by Thomas Prinz Marcelo De Barros, Janusz Klink,Tadeus Uhl, 7–12, 2017. ieee: M.-C. Jakobs, J. Krämer, D. van Straaten, and T. Lettmann, “Certification Matters for Service Markets,” in The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION), 2017, pp. 7–12. mla: Jakobs, Marie-Christine, et al. “Certification Matters for Service Markets.” The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION), edited by Thomas Prinz Marcelo De Barros, Janusz Klink,Tadeus Uhl, 2017, pp. 7–12. short: 'M.-C. Jakobs, J. Krämer, D. van Straaten, T. Lettmann, in: T.P. Marcelo De Barros, Janusz Klink,Tadeus Uhl (Ed.), The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION), 2017, pp. 7–12.' date_created: 2017-10-17T12:41:14Z date_updated: 2022-01-06T06:51:02Z ddc: - '040' department: - _id: '77' - _id: '355' - _id: '179' editor: - first_name: Thomas Prinz full_name: Marcelo De Barros, Janusz Klink,Tadeus Uhl, Thomas Prinz last_name: Marcelo De Barros, Janusz Klink,Tadeus Uhl file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T13:04:12Z date_updated: 2018-03-21T13:04:12Z file_id: '1564' file_name: 115-JakobsKraemerVanStraatenLettmann2017.pdf file_size: 133531 relation: main_file success: 1 file_date_updated: 2018-03-21T13:04:12Z has_accepted_license: '1' language: - iso: eng page: 7-12 project: - _id: '1' name: SFB 901 - _id: '10' name: SFB 901 - Subprojekt B2 - _id: '11' name: SFB 901 - Subproject B3 - _id: '12' name: SFB 901 - Subproject B4 - _id: '8' name: SFB 901 - Subproject A4 - _id: '2' name: SFB 901 - Project Area A - _id: '3' name: SFB 901 - Project Area B publication: The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION) status: public title: Certification Matters for Service Markets type: conference user_id: '477' year: '2017' ... --- _id: '90' abstract: - lang: eng text: We propose and extend an approach for the verification of safety properties for parameterized timed systems modeled as networks of timed automata. For this task, we introduce an incremental workflow that is based on our algorithm IC3 with Zones. It proceeds in a cycle in which single models of the system are verified, and the verification results are employed for the reasoning about the entire system. Starting with the smallest instances, the verification of the safety property is carried out fast and efficient. On successful verification, the algorithm produces an inductive strengthening of the safety property. We reuse this result and try to reason about the entire parameterized timed system. To this end, we extrapolate the inductive strengthening into a candidate for the next-larger model. In case this candidate is a valid inductive strengthening for the next larger model, our main theorem reasons about all models of the parameterized timed system, stating that the safety property holds true for all models. Otherwise, the main cycle starts over with the verification of the next larger model. This workflow is iterated indefinitely, until able to reason about the entire parameterized timed system, until a counterexample trace is found, or until the single models become too large to be handled in the verification. We reuse the intermediate results in a Feedback-loop in order to accelerate the verification runs for the single models. Furthermore, we consider an extended formalism in comparison to our previous publications. author: - first_name: Tobias full_name: Isenberg, Tobias last_name: Isenberg citation: ama: Isenberg T. Incremental Inductive Verification of Parameterized Timed Systems. ACM Transactions on Embedded Computing Systems. 2017;(2):47:1-47:24. doi:10.1145/2984640 apa: Isenberg, T. (2017). Incremental Inductive Verification of Parameterized Timed Systems. ACM Transactions on Embedded Computing Systems, (2), 47:1-47:24. https://doi.org/10.1145/2984640 bibtex: '@article{Isenberg_2017, title={Incremental Inductive Verification of Parameterized Timed Systems}, DOI={10.1145/2984640}, number={2}, journal={ACM Transactions on Embedded Computing Systems}, publisher={ACM}, author={Isenberg, Tobias}, year={2017}, pages={47:1-47:24} }' chicago: 'Isenberg, Tobias. “Incremental Inductive Verification of Parameterized Timed Systems.” ACM Transactions on Embedded Computing Systems, no. 2 (2017): 47:1-47:24. https://doi.org/10.1145/2984640.' ieee: T. Isenberg, “Incremental Inductive Verification of Parameterized Timed Systems,” ACM Transactions on Embedded Computing Systems, no. 2, pp. 47:1-47:24, 2017. mla: Isenberg, Tobias. “Incremental Inductive Verification of Parameterized Timed Systems.” ACM Transactions on Embedded Computing Systems, no. 2, ACM, 2017, pp. 47:1-47:24, doi:10.1145/2984640. short: T. Isenberg, ACM Transactions on Embedded Computing Systems (2017) 47:1-47:24. date_created: 2017-10-17T12:41:09Z date_updated: 2022-01-06T07:04:06Z ddc: - '040' department: - _id: '77' doi: 10.1145/2984640 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T13:13:04Z date_updated: 2018-03-21T13:13:04Z file_id: '1572' file_name: 90-a47-isenberg.pdf file_size: 584870 relation: main_file success: 1 file_date_updated: 2018-03-21T13:13:04Z has_accepted_license: '1' issue: '2' language: - iso: eng page: 47:1-47:24 project: - _id: '1' name: SFB 901 - _id: '12' name: SFB 901 - Subprojekt B4 - _id: '3' name: SFB 901 - Project Area B publication: ACM Transactions on Embedded Computing Systems publisher: ACM status: public title: Incremental Inductive Verification of Parameterized Timed Systems type: journal_article user_id: '477' year: '2017' ... --- _id: '5769' abstract: - lang: eng text: "Information Flow Analysis (IFA) aims at detecting illegal flows of information between program entities. “Legality” is therein specified in terms of various security policies. For the analysis, this opens up two possibilities: building generic, policy independent and building specific, policy dependent IFAs. While the former needs to track all dependencies between program entities, the latter allows for a reduced and thus more efficient analysis.\r\n\r\nIn this paper, we start out by formally defining a policy independent information flow analysis. Next, we show how to specialize this IFA via policy specific variable tracking, and prove soundness of the specialization. We furthermore investigate refinement relationships between policies, allowing an IFA for one policy to be employed for its refinements. As policy refinement depends on concrete program entities, we additionally propose a precomputation of policy refinement conditions, enabling an efficient refinement check for concrete programs." author: - first_name: Manuel full_name: Töws, Manuel id: '11315' last_name: Töws - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Töws M, Wehrheim H. Policy Dependent and Independent Information Flow Analyses. In: Formal Methods and Software Engineering - 19th International Conference  on Formal Engineering Methods (ICFEM 2017). Springer International Publishing; 2017:362-378. doi:10.1007/978-3-319-68690-5_22' apa: Töws, M., & Wehrheim, H. (2017). Policy Dependent and Independent Information Flow Analyses. In Formal Methods and Software Engineering - 19th International Conference  on Formal Engineering Methods (ICFEM 2017) (pp. 362–378). Springer International Publishing. https://doi.org/10.1007/978-3-319-68690-5_22 bibtex: '@inproceedings{Töws_Wehrheim_2017, title={Policy Dependent and Independent Information Flow Analyses}, DOI={10.1007/978-3-319-68690-5_22}, booktitle={Formal Methods and Software Engineering - 19th International Conference  on Formal Engineering Methods (ICFEM 2017)}, publisher={Springer International Publishing}, author={Töws, Manuel and Wehrheim, Heike}, year={2017}, pages={362–378} }' chicago: Töws, Manuel, and Heike Wehrheim. “Policy Dependent and Independent Information Flow Analyses.” In Formal Methods and Software Engineering - 19th International Conference  on Formal Engineering Methods (ICFEM 2017), 362–78. Springer International Publishing, 2017. https://doi.org/10.1007/978-3-319-68690-5_22. ieee: M. Töws and H. Wehrheim, “Policy Dependent and Independent Information Flow Analyses,” in Formal Methods and Software Engineering - 19th International Conference  on Formal Engineering Methods (ICFEM 2017), 2017, pp. 362–378. mla: Töws, Manuel, and Heike Wehrheim. “Policy Dependent and Independent Information Flow Analyses.” Formal Methods and Software Engineering - 19th International Conference  on Formal Engineering Methods (ICFEM 2017), Springer International Publishing, 2017, pp. 362–78, doi:10.1007/978-3-319-68690-5_22. short: 'M. Töws, H. Wehrheim, in: Formal Methods and Software Engineering - 19th International Conference  on Formal Engineering Methods (ICFEM 2017), Springer International Publishing, 2017, pp. 362–378.' date_created: 2018-11-21T09:38:43Z date_updated: 2022-01-06T07:02:39Z ddc: - '000' department: - _id: '77' doi: 10.1007/978-3-319-68690-5_22 file: - access_level: closed content_type: application/pdf creator: mtoews date_created: 2018-11-26T15:07:42Z date_updated: 2018-11-26T15:07:42Z file_id: '5836' file_name: Töws-Wehrheim2017_Chapter_PolicyDependentAndIndependentI.pdf file_size: 424031 relation: main_file success: 1 file_date_updated: 2018-11-26T15:07:42Z has_accepted_license: '1' language: - iso: eng page: 362-378 project: - _id: '12' name: SFB 901 - Subproject B4 - _id: '3' name: SFB 901 - Project Area B - _id: '1' name: SFB 901 publication: Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods (ICFEM 2017) publication_identifier: isbn: - '9783319686899' - '9783319686905' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer International Publishing status: public title: Policy Dependent and Independent Information Flow Analyses type: conference user_id: '477' year: '2017' ... --- _id: '707' author: - first_name: Sven full_name: Walther, Sven last_name: Walther citation: ama: Walther S. Knowledge-Based Verification of Service Compositions. Universität Paderborn; 2017. doi:10.17619/UNIPB/1-307 apa: Walther, S. (2017). Knowledge-based Verification of Service Compositions. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-307 bibtex: '@book{Walther_2017, title={Knowledge-based Verification of Service Compositions}, DOI={10.17619/UNIPB/1-307}, publisher={Universität Paderborn}, author={Walther, Sven}, year={2017} }' chicago: Walther, Sven. Knowledge-Based Verification of Service Compositions. Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-307. ieee: S. Walther, Knowledge-based Verification of Service Compositions. Universität Paderborn, 2017. mla: Walther, Sven. Knowledge-Based Verification of Service Compositions. Universität Paderborn, 2017, doi:10.17619/UNIPB/1-307. short: S. Walther, Knowledge-Based Verification of Service Compositions, Universität Paderborn, 2017. date_created: 2017-11-20T07:59:31Z date_updated: 2022-01-06T07:03:27Z department: - _id: '77' doi: 10.17619/UNIPB/1-307 language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '11' name: SFB 901 - Subproject B3 - _id: '3' name: SFB 901 - Project Area B publisher: Universität Paderborn status: public supervisor: - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim title: Knowledge-based Verification of Service Compositions type: dissertation user_id: '477' year: '2017' ... --- _id: '71' abstract: - lang: eng text: Today, software verification tools have reached the maturity to be used for large scale programs. Different tools perform differently well on varying code. A software developer is hence faced with the problem of choosing a tool appropriate for her program at hand. A ranking of tools on programs could facilitate the choice. Such rankings can, however, so far only be obtained by running all considered tools on the program.In this paper, we present a machine learning approach to predicting rankings of tools on programs. The method builds upon so-called label ranking algorithms, which we complement with appropriate kernels providing a similarity measure for programs. Our kernels employ a graph representation for software source code that mixes elements of control flow and program dependence graphs with abstract syntax trees. Using data sets from the software verification competition SV-COMP, we demonstrate our rank prediction technique to generalize well and achieve a rather high predictive accuracy (rank correlation > 0.6). author: - first_name: Mike full_name: Czech, Mike last_name: Czech - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier - first_name: Marie-Christine full_name: Jakobs, Marie-Christine last_name: Jakobs - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Czech M, Hüllermeier E, Jakobs M-C, Wehrheim H. Predicting Rankings of Software Verification Tools. In: Proceedings of the 3rd International Workshop on Software Analytics. SWAN’17. ; 2017:23-26. doi:10.1145/3121257.3121262' apa: Czech, M., Hüllermeier, E., Jakobs, M.-C., & Wehrheim, H. (2017). Predicting Rankings of Software Verification Tools. In Proceedings of the 3rd International Workshop on Software Analytics (pp. 23–26). https://doi.org/10.1145/3121257.3121262 bibtex: '@inproceedings{Czech_Hüllermeier_Jakobs_Wehrheim_2017, series={SWAN’17}, title={Predicting Rankings of Software Verification Tools}, DOI={10.1145/3121257.3121262}, booktitle={Proceedings of the 3rd International Workshop on Software Analytics}, author={Czech, Mike and Hüllermeier, Eyke and Jakobs, Marie-Christine and Wehrheim, Heike}, year={2017}, pages={23–26}, collection={SWAN’17} }' chicago: Czech, Mike, Eyke Hüllermeier, Marie-Christine Jakobs, and Heike Wehrheim. “Predicting Rankings of Software Verification Tools.” In Proceedings of the 3rd International Workshop on Software Analytics, 23–26. SWAN’17, 2017. https://doi.org/10.1145/3121257.3121262. ieee: M. Czech, E. Hüllermeier, M.-C. Jakobs, and H. Wehrheim, “Predicting Rankings of Software Verification Tools,” in Proceedings of the 3rd International Workshop on Software Analytics, 2017, pp. 23–26. mla: Czech, Mike, et al. “Predicting Rankings of Software Verification Tools.” Proceedings of the 3rd International Workshop on Software Analytics, 2017, pp. 23–26, doi:10.1145/3121257.3121262. short: 'M. Czech, E. Hüllermeier, M.-C. Jakobs, H. Wehrheim, in: Proceedings of the 3rd International Workshop on Software Analytics, 2017, pp. 23–26.' date_created: 2017-10-17T12:41:05Z date_updated: 2022-01-06T07:03:28Z ddc: - '000' department: - _id: '355' - _id: '77' doi: 10.1145/3121257.3121262 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T14:24:29Z date_updated: 2018-11-02T14:24:29Z file_id: '5271' file_name: fsews17swan-swanmain1.pdf file_size: 822383 relation: main_file success: 1 file_date_updated: 2018-11-02T14:24:29Z has_accepted_license: '1' language: - iso: eng page: 23-26 project: - _id: '1' name: SFB 901 - _id: '12' name: SFB 901 - Subprojekt B4 - _id: '10' name: SFB 901 - Subproject B2 - _id: '3' name: SFB 901 - Project Area B - _id: '11' name: SFB 901 - Subproject B3 publication: Proceedings of the 3rd International Workshop on Software Analytics series_title: SWAN'17 status: public title: Predicting Rankings of Software Verification Tools type: conference user_id: '15504' year: '2017' ... --- _id: '72' abstract: - lang: eng text: 'Software verification competitions, such as the annual SV-COMP, evaluate software verification tools with respect to their effectivity and efficiency. Typically, the outcome of a competition is a (possibly category-specific) ranking of the tools. For many applications, such as building portfolio solvers, it would be desirable to have an idea of the (relative) performance of verification tools on a given verification task beforehand, i.e., prior to actually running all tools on the task.In this paper, we present a machine learning approach to predicting rankings of tools on verification tasks. The method builds upon so-called label ranking algorithms, which we complement with appropriate kernels providing a similarity measure for verification tasks. Our kernels employ a graph representation for software source code that mixes elements of control flow and program dependence graphs with abstract syntax trees. Using data sets from SV-COMP, we demonstrate our rank prediction technique to generalize well and achieve a rather high predictive accuracy. In particular, our method outperforms a recently proposed feature-based approach of Demyanova et al. (when applied to rank predictions). ' author: - first_name: Mike full_name: Czech, Mike last_name: Czech - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier - first_name: Marie-Christine full_name: Jakobs, Marie-Christine last_name: Jakobs - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: Czech M, Hüllermeier E, Jakobs M-C, Wehrheim H. Predicting Rankings of Software Verification Competitions.; 2017. apa: Czech, M., Hüllermeier, E., Jakobs, M.-C., & Wehrheim, H. (2017). Predicting Rankings of Software Verification Competitions. bibtex: '@book{Czech_Hüllermeier_Jakobs_Wehrheim_2017, title={Predicting Rankings of Software Verification Competitions}, author={Czech, Mike and Hüllermeier, Eyke and Jakobs, Marie-Christine and Wehrheim, Heike}, year={2017} }' chicago: Czech, Mike, Eyke Hüllermeier, Marie-Christine Jakobs, and Heike Wehrheim. Predicting Rankings of Software Verification Competitions, 2017. ieee: M. Czech, E. Hüllermeier, M.-C. Jakobs, and H. Wehrheim, Predicting Rankings of Software Verification Competitions. 2017. mla: Czech, Mike, et al. Predicting Rankings of Software Verification Competitions. 2017. short: M. Czech, E. Hüllermeier, M.-C. Jakobs, H. Wehrheim, Predicting Rankings of Software Verification Competitions, 2017. date_created: 2017-10-17T12:41:05Z date_updated: 2022-01-06T07:03:29Z ddc: - '000' department: - _id: '77' - _id: '355' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-11-21T10:50:11Z date_updated: 2018-11-21T10:50:11Z file_id: '5782' file_name: "Predicting Rankings of So\x81ware Verification Competitions.pdf" file_size: 869984 relation: main_file success: 1 file_date_updated: 2018-11-21T10:50:11Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '11' name: SFB 901 - Subprojekt B3 - _id: '12' name: SFB 901 - Subprojekt B4 - _id: '3' name: SFB 901 - Project Area B status: public title: Predicting Rankings of Software Verification Competitions type: report user_id: '15504' year: '2017' ... --- _id: '68' abstract: - lang: eng text: Proof-carrying hardware (PCH) is a principle for achieving safety for dynamically reconfigurable hardware systems. The producer of a hardware module spends huge effort when creating a proof for a safety policy. The proof is then transferred as a certificate together with the configuration bitstream to the consumer of the hardware module, who can quickly verify the given proof. Previous work utilized SAT solvers and resolution traces to set up a PCH technology and corresponding tool flows. In this article, we present a novel technology for PCH based on inductive invariants. For sequential circuits, our approach is fundamentally stronger than the previous SAT-based one since we avoid the limitations of bounded unrolling. We contrast our technology to existing ones and show that it fits into previously proposed tool flows. We conduct experiments with four categories of benchmark circuits and report consumer and producer runtime and peak memory consumption, as well as the size of the certificates and the distribution of the workload between producer and consumer. Experiments clearly show that our new induction-based technology is superior for sequential circuits, whereas the previous SAT-based technology is the better choice for combinational circuits. author: - first_name: Tobias full_name: Isenberg, Tobias last_name: Isenberg - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim - first_name: Tobias full_name: Wiersema, Tobias id: '3118' last_name: Wiersema citation: ama: Isenberg T, Platzner M, Wehrheim H, Wiersema T. Proof-Carrying Hardware via Inductive Invariants. ACM Transactions on Design Automation of Electronic Systems. 2017;(4):61:1--61:23. doi:10.1145/3054743 apa: Isenberg, T., Platzner, M., Wehrheim, H., & Wiersema, T. (2017). Proof-Carrying Hardware via Inductive Invariants. ACM Transactions on Design Automation of Electronic Systems, (4), 61:1--61:23. https://doi.org/10.1145/3054743 bibtex: '@article{Isenberg_Platzner_Wehrheim_Wiersema_2017, title={Proof-Carrying Hardware via Inductive Invariants}, DOI={10.1145/3054743}, number={4}, journal={ACM Transactions on Design Automation of Electronic Systems}, publisher={ACM}, author={Isenberg, Tobias and Platzner, Marco and Wehrheim, Heike and Wiersema, Tobias}, year={2017}, pages={61:1--61:23} }' chicago: 'Isenberg, Tobias, Marco Platzner, Heike Wehrheim, and Tobias Wiersema. “Proof-Carrying Hardware via Inductive Invariants.” ACM Transactions on Design Automation of Electronic Systems, no. 4 (2017): 61:1--61:23. https://doi.org/10.1145/3054743.' ieee: T. Isenberg, M. Platzner, H. Wehrheim, and T. Wiersema, “Proof-Carrying Hardware via Inductive Invariants,” ACM Transactions on Design Automation of Electronic Systems, no. 4, pp. 61:1--61:23, 2017. mla: Isenberg, Tobias, et al. “Proof-Carrying Hardware via Inductive Invariants.” ACM Transactions on Design Automation of Electronic Systems, no. 4, ACM, 2017, pp. 61:1--61:23, doi:10.1145/3054743. short: T. Isenberg, M. Platzner, H. Wehrheim, T. Wiersema, ACM Transactions on Design Automation of Electronic Systems (2017) 61:1--61:23. date_created: 2017-10-17T12:41:04Z date_updated: 2022-01-06T07:03:20Z ddc: - '000' department: - _id: '77' - _id: '78' doi: 10.1145/3054743 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T16:08:17Z date_updated: 2018-11-02T16:08:17Z file_id: '5324' file_name: a61-isenberg.pdf file_size: 806356 relation: main_file success: 1 file_date_updated: 2018-11-02T16:08:17Z has_accepted_license: '1' issue: '4' language: - iso: eng page: 61:1--61:23 project: - _id: '1' name: SFB 901 - _id: '12' name: SFB 901 - Subprojekt B4 - _id: '3' name: SFB 901 - Project Area B - _id: '52' name: Computing Resources Provided by the Paderborn Center for Parallel Computing publication: ACM Transactions on Design Automation of Electronic Systems publisher: ACM status: public title: Proof-Carrying Hardware via Inductive Invariants type: journal_article user_id: '3118' year: '2017' ... --- _id: '685' author: - first_name: Marie-Christine full_name: Jakobs, Marie-Christine last_name: Jakobs citation: ama: Jakobs M-C. On-The-Fly Safety Checking - Customizing Program Certification and Program Restructuring. Universität Paderborn; 2017. doi:10.17619/UNIPB/1-104 apa: Jakobs, M.-C. (2017). On-The-Fly Safety Checking - Customizing Program Certification and Program Restructuring. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-104 bibtex: '@book{Jakobs_2017, title={On-The-Fly Safety Checking - Customizing Program Certification and Program Restructuring}, DOI={10.17619/UNIPB/1-104}, publisher={Universität Paderborn}, author={Jakobs, Marie-Christine}, year={2017} }' chicago: Jakobs, Marie-Christine. On-The-Fly Safety Checking - Customizing Program Certification and Program Restructuring. Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-104. ieee: M.-C. Jakobs, On-The-Fly Safety Checking - Customizing Program Certification and Program Restructuring. Universität Paderborn, 2017. mla: Jakobs, Marie-Christine. On-The-Fly Safety Checking - Customizing Program Certification and Program Restructuring. Universität Paderborn, 2017, doi:10.17619/UNIPB/1-104. short: M.-C. Jakobs, On-The-Fly Safety Checking - Customizing Program Certification and Program Restructuring, Universität Paderborn, 2017. date_created: 2017-11-13T08:13:29Z date_updated: 2022-01-06T07:03:22Z ddc: - '040' department: - _id: '77' doi: 10.17619/UNIPB/1-104 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-14T12:26:52Z date_updated: 2018-03-14T12:26:52Z file_id: '1211' file_name: 685-Dissertation-Jakobs.pdf file_size: 11828624 relation: main_file success: 1 file_date_updated: 2018-03-14T12:26:52Z has_accepted_license: '1' project: - _id: '1' name: SFB 901 - _id: '12' name: SFB 901 - Subprojekt B4 - _id: '3' name: SFB 901 - Project Area B publisher: Universität Paderborn status: public supervisor: - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim title: On-The-Fly Safety Checking - Customizing Program Certification and Program Restructuring type: dissertation user_id: '477' year: '2017' ... --- _id: '69' abstract: - lang: eng text: 'Today, software is traded worldwide on global markets, with apps being downloaded to smartphones within minutes or seconds. This poses, more than ever, the challenge of ensuring safety of software in the face of (1) unknown or untrusted software providers together with (2) resource-limited software consumers. The concept of Proof-Carrying Code (PCC), years ago suggested by Necula, provides one framework for securing the execution of untrusted code. PCC techniques attach safety proofs, constructed by software producers, to code. Based on the assumption that checking proofs is usually much simpler than constructing proofs, software consumers should thus be able to quickly check the safety of software. However, PCC techniques often suffer from the size of certificates (i.e., the attached proofs), making PCC techniques inefficient in practice.In this article, we introduce a new framework for the safe execution of untrusted code called Programs from Proofs (PfP). The basic assumption underlying the PfP technique is the fact that the structure of programs significantly influences the complexity of checking a specific safety property. Instead of attaching proofs to program code, the PfP technique transforms the program into an efficiently checkable form, thus guaranteeing quick safety checks for software consumers. For this transformation, the technique also uses a producer-side automatic proof of safety. More specifically, safety proving for the software producer proceeds via the construction of an abstract reachability graph (ARG) unfolding the control-flow automaton (CFA) up to the degree necessary for simple checking. To this end, we combine different sorts of software analysis: expensive analyses incrementally determining the degree of unfolding, and cheap analyses responsible for safety checking. Out of the abstract reachability graph we generate the new program. In its CFA structure, it is isomorphic to the graph and hence another, this time consumer-side, cheap analysis can quickly determine its safety.Like PCC, Programs from Proofs is a general framework instantiable with different sorts of (expensive and cheap) analysis. Here, we present the general framework and exemplify it by some concrete examples. We have implemented different instantiations on top of the configurable program analysis tool CPAchecker and report on experiments, in particular on comparisons with PCC techniques.' author: - first_name: Marie-Christine full_name: Jakobs, Marie-Christine last_name: Jakobs - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Jakobs M-C, Wehrheim H. Programs from Proofs: A Framework for the Safe Execution of Untrusted Software. ACM Transactions on Programming Languages and Systems. 2017;(2):7:1-7:56. doi:10.1145/3014427' apa: 'Jakobs, M.-C., & Wehrheim, H. (2017). Programs from Proofs: A Framework for the Safe Execution of Untrusted Software. ACM Transactions on Programming Languages and Systems, (2), 7:1-7:56. https://doi.org/10.1145/3014427' bibtex: '@article{Jakobs_Wehrheim_2017, title={Programs from Proofs: A Framework for the Safe Execution of Untrusted Software}, DOI={10.1145/3014427}, number={2}, journal={ACM Transactions on Programming Languages and Systems}, publisher={ACM}, author={Jakobs, Marie-Christine and Wehrheim, Heike}, year={2017}, pages={7:1-7:56} }' chicago: 'Jakobs, Marie-Christine, and Heike Wehrheim. “Programs from Proofs: A Framework for the Safe Execution of Untrusted Software.” ACM Transactions on Programming Languages and Systems, no. 2 (2017): 7:1-7:56. https://doi.org/10.1145/3014427.' ieee: 'M.-C. Jakobs and H. Wehrheim, “Programs from Proofs: A Framework for the Safe Execution of Untrusted Software,” ACM Transactions on Programming Languages and Systems, no. 2, pp. 7:1-7:56, 2017.' mla: 'Jakobs, Marie-Christine, and Heike Wehrheim. “Programs from Proofs: A Framework for the Safe Execution of Untrusted Software.” ACM Transactions on Programming Languages and Systems, no. 2, ACM, 2017, pp. 7:1-7:56, doi:10.1145/3014427.' short: M.-C. Jakobs, H. Wehrheim, ACM Transactions on Programming Languages and Systems (2017) 7:1-7:56. date_created: 2017-10-17T12:41:04Z date_updated: 2022-01-06T07:03:23Z ddc: - '040' department: - _id: '77' doi: 10.1145/3014427 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T13:15:09Z date_updated: 2018-03-21T13:15:09Z file_id: '1575' file_name: 69-a7-jakobs.pdf file_size: 1215139 relation: main_file success: 1 file_date_updated: 2018-03-21T13:15:09Z has_accepted_license: '1' issue: '2' language: - iso: eng page: 7:1-7:56 project: - _id: '1' name: SFB 901 - _id: '12' name: SFB 901 - Subprojekt B4 - _id: '3' name: SFB 901 - Project Area B publication: ACM Transactions on Programming Languages and Systems publisher: ACM status: public title: 'Programs from Proofs: A Framework for the Safe Execution of Untrusted Software' type: journal_article user_id: '477' year: '2017' ... --- _id: '109' author: - first_name: Felix full_name: Pauck, Felix id: '22398' last_name: Pauck citation: ama: Pauck F. Cooperative Static Analysis of Android Applications. Universität Paderborn; 2017. apa: Pauck, F. (2017). Cooperative static analysis of Android applications. Universität Paderborn. bibtex: '@book{Pauck_2017, title={Cooperative static analysis of Android applications}, publisher={Universität Paderborn}, author={Pauck, Felix}, year={2017} }' chicago: Pauck, Felix. Cooperative Static Analysis of Android Applications. Universität Paderborn, 2017. ieee: F. Pauck, Cooperative static analysis of Android applications. Universität Paderborn, 2017. mla: Pauck, Felix. Cooperative Static Analysis of Android Applications. Universität Paderborn, 2017. short: F. Pauck, Cooperative Static Analysis of Android Applications, Universität Paderborn, 2017. date_created: 2017-10-17T12:41:12Z date_updated: 2022-01-06T06:50:52Z ddc: - '000' department: - _id: '77' file: - access_level: open_access content_type: application/pdf creator: fpauck date_created: 2019-08-07T08:55:58Z date_updated: 2019-08-07T09:03:48Z file_id: '12905' file_name: fpauck_2017.pdf file_size: 5093611 relation: main_file title: Master's Thesis file_date_updated: 2019-08-07T09:03:48Z has_accepted_license: '1' language: - iso: eng oa: '1' project: - _id: '1' name: SFB 901 - _id: '12' name: SFB 901 - Subprojekt B4 - _id: '3' name: SFB 901 - Project Area B publisher: Universität Paderborn status: public supervisor: - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim title: Cooperative static analysis of Android applications type: mastersthesis user_id: '22398' year: '2017' ... --- _id: '201' author: - first_name: Henrik full_name: Bröcher, Henrik last_name: Bröcher citation: ama: Bröcher H. Evaluation von Graphpartitionierungsalgorithmen im Kontext von Konfigurierbarer Softwarezertifizierung. Universität Paderborn; 2016. apa: Bröcher, H. (2016). Evaluation von Graphpartitionierungsalgorithmen im Kontext von Konfigurierbarer Softwarezertifizierung. Universität Paderborn. bibtex: '@book{Bröcher_2016, title={Evaluation von Graphpartitionierungsalgorithmen im Kontext von Konfigurierbarer Softwarezertifizierung}, publisher={Universität Paderborn}, author={Bröcher, Henrik}, year={2016} }' chicago: Bröcher, Henrik. Evaluation von Graphpartitionierungsalgorithmen im Kontext von Konfigurierbarer Softwarezertifizierung. Universität Paderborn, 2016. ieee: H. Bröcher, Evaluation von Graphpartitionierungsalgorithmen im Kontext von Konfigurierbarer Softwarezertifizierung. Universität Paderborn, 2016. mla: Bröcher, Henrik. Evaluation von Graphpartitionierungsalgorithmen im Kontext von Konfigurierbarer Softwarezertifizierung. Universität Paderborn, 2016. short: H. Bröcher, Evaluation von Graphpartitionierungsalgorithmen im Kontext von Konfigurierbarer Softwarezertifizierung, Universität Paderborn, 2016. date_created: 2017-10-17T12:41:31Z date_updated: 2022-01-06T06:54:18Z department: - _id: '77' language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '12' name: SFB 901 - Subprojekt B4 - _id: '3' name: SFB 901 - Project Area B publisher: Universität Paderborn status: public supervisor: - first_name: Heike full_name: Wehrheim, Heike last_name: Wehrheim title: Evaluation von Graphpartitionierungsalgorithmen im Kontext von Konfigurierbarer Softwarezertifizierung type: bachelorsthesis user_id: '15504' year: '2016' ... --- _id: '3157' author: - first_name: Steffen full_name: Beringer, Steffen last_name: Beringer - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Beringer S, Wehrheim H. Verification of AUTOSAR Software Architectures with Timed Automata. In: H. ter Beek M, Gnesi S, Knapp A, eds. Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings. Lecture Notes in Computer Science. ; 2016:189--204. doi:10.1007/978-3-319-45943-1_13' apa: 'Beringer, S., & Wehrheim, H. (2016). Verification of AUTOSAR Software Architectures with Timed Automata. In M. H. ter Beek, S. Gnesi, & A. Knapp (Eds.), Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings (pp. 189--204). https://doi.org/10.1007/978-3-319-45943-1_13' bibtex: '@inproceedings{Beringer_Wehrheim_2016, series={Lecture Notes in Computer Science}, title={Verification of AUTOSAR Software Architectures with Timed Automata}, DOI={10.1007/978-3-319-45943-1_13}, booktitle={Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings}, author={Beringer, Steffen and Wehrheim, Heike}, editor={H. ter Beek, Maurice and Gnesi, Stefania and Knapp, AlexanderEditors}, year={2016}, pages={189--204}, collection={Lecture Notes in Computer Science} }' chicago: 'Beringer, Steffen, and Heike Wehrheim. “Verification of AUTOSAR Software Architectures with Timed Automata.” In Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings, edited by Maurice H. ter Beek, Stefania Gnesi, and Alexander Knapp, 189--204. Lecture Notes in Computer Science, 2016. https://doi.org/10.1007/978-3-319-45943-1_13.' ieee: 'S. Beringer and H. Wehrheim, “Verification of AUTOSAR Software Architectures with Timed Automata,” in Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings, 2016, pp. 189--204.' mla: 'Beringer, Steffen, and Heike Wehrheim. “Verification of AUTOSAR Software Architectures with Timed Automata.” Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings, edited by Maurice H. ter Beek et al., 2016, pp. 189--204, doi:10.1007/978-3-319-45943-1_13.' short: 'S. Beringer, H. Wehrheim, in: M. H. ter Beek, S. Gnesi, A. Knapp (Eds.), Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings, 2016, pp. 189--204.' date_created: 2018-06-13T07:39:35Z date_updated: 2022-01-06T06:59:01Z ddc: - '000' department: - _id: '77' doi: 10.1007/978-3-319-45943-1_13 editor: - first_name: Maurice full_name: H. ter Beek, Maurice last_name: H. ter Beek - first_name: Stefania full_name: Gnesi, Stefania last_name: Gnesi - first_name: Alexander full_name: Knapp, Alexander last_name: Knapp file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T14:17:13Z date_updated: 2018-11-02T14:17:13Z file_id: '5267' file_name: VerificationOfAUTOSARSoftwareA.pdf file_size: 2640695 relation: main_file success: 1 file_date_updated: 2018-11-02T14:17:13Z has_accepted_license: '1' language: - iso: eng page: 189--204 project: - _id: '3' name: SFB 901 - Project Area B - _id: '1' name: SFB 901 - _id: '11' name: SFB 901 - Subproject B3 publication: 'Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings' series_title: Lecture Notes in Computer Science status: public title: Verification of AUTOSAR Software Architectures with Timed Automata type: conference user_id: '477' year: '2016' ... --- _id: '3158' author: - first_name: Oleg full_name: Travkin, Oleg last_name: Travkin - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Travkin O, Wehrheim H. Verification of Concurrent Programs on Weak Memory Models. In: Sampaio A, Wang F, eds. Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings. Lecture Notes in Computer Science. ; 2016:3--24. doi:10.1007/978-3-319-46750-4_1' apa: Travkin, O., & Wehrheim, H. (2016). Verification of Concurrent Programs on Weak Memory Models. In A. Sampaio & F. Wang (Eds.), Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings (pp. 3--24). https://doi.org/10.1007/978-3-319-46750-4_1 bibtex: '@inproceedings{Travkin_Wehrheim_2016, series={Lecture Notes in Computer Science}, title={Verification of Concurrent Programs on Weak Memory Models}, DOI={10.1007/978-3-319-46750-4_1}, booktitle={Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings}, author={Travkin, Oleg and Wehrheim, Heike}, editor={Sampaio, Augusto and Wang, FarnEditors}, year={2016}, pages={3--24}, collection={Lecture Notes in Computer Science} }' chicago: Travkin, Oleg, and Heike Wehrheim. “Verification of Concurrent Programs on Weak Memory Models.” In Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings, edited by Augusto Sampaio and Farn Wang, 3--24. Lecture Notes in Computer Science, 2016. https://doi.org/10.1007/978-3-319-46750-4_1. ieee: O. Travkin and H. Wehrheim, “Verification of Concurrent Programs on Weak Memory Models,” in Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings, 2016, pp. 3--24. mla: Travkin, Oleg, and Heike Wehrheim. “Verification of Concurrent Programs on Weak Memory Models.” Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings, edited by Augusto Sampaio and Farn Wang, 2016, pp. 3--24, doi:10.1007/978-3-319-46750-4_1. short: 'O. Travkin, H. Wehrheim, in: A. Sampaio, F. Wang (Eds.), Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings, 2016, pp. 3--24.' date_created: 2018-06-13T07:41:07Z date_updated: 2022-01-06T06:59:01Z department: - _id: '77' doi: 10.1007/978-3-319-46750-4_1 editor: - first_name: Augusto full_name: Sampaio, Augusto last_name: Sampaio - first_name: Farn full_name: Wang, Farn last_name: Wang page: 3--24 publication: Theoretical Aspects of Computing - {ICTAC} 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings series_title: Lecture Notes in Computer Science status: public title: Verification of Concurrent Programs on Weak Memory Models type: conference user_id: '29719' year: '2016' ...