--- _id: '17084' author: - first_name: Nils full_name: Weidmann, Nils id: '53103' last_name: Weidmann - first_name: Anthony full_name: Anjorin, Anthony last_name: Anjorin citation: ama: 'Weidmann N, Anjorin A. Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming. In: Wehrheim H, Cabot J, eds. Proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020. Cham: Springer; 2020. doi:10.1007/978-3-030-45234-6_16' apa: 'Weidmann, N., & Anjorin, A. (2020). Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming. In H. Wehrheim & J. Cabot (Eds.), Proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020. Cham: Springer. https://doi.org/10.1007/978-3-030-45234-6_16' bibtex: '@inproceedings{Weidmann_Anjorin_2020, place={Cham}, title={Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming}, DOI={10.1007/978-3-030-45234-6_16}, booktitle={Proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020}, publisher={Springer}, author={Weidmann, Nils and Anjorin, Anthony}, editor={Wehrheim, Heike and Cabot, JordiEditors}, year={2020} }' chicago: 'Weidmann, Nils, and Anthony Anjorin. “Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming.” In Proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020, edited by Heike Wehrheim and Jordi Cabot. Cham: Springer, 2020. https://doi.org/10.1007/978-3-030-45234-6_16.' ieee: N. Weidmann and A. Anjorin, “Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming,” in Proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020, Dublin, Ireland, 2020. mla: Weidmann, Nils, and Anthony Anjorin. “Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming.” Proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020, edited by Heike Wehrheim and Jordi Cabot, Springer, 2020, doi:10.1007/978-3-030-45234-6_16. short: 'N. Weidmann, A. Anjorin, in: H. Wehrheim, J. Cabot (Eds.), Proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020, Springer, Cham, 2020.' conference: end_date: 2020-04-30 location: Dublin, Ireland name: Fundamental Approaches to Software Engineering - 23rd International Conference, FASE 2020 start_date: 2020-04-25 date_created: 2020-06-06T09:50:42Z date_updated: 2022-01-06T06:53:04Z department: - _id: '28' - _id: '66' - _id: '534' doi: 10.1007/978-3-030-45234-6_16 editor: - first_name: Heike full_name: Wehrheim, Heike last_name: Wehrheim - first_name: Jordi full_name: Cabot, Jordi last_name: Cabot language: - iso: eng place: Cham publication: Proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020 publication_identifier: isbn: - '9783030452339' - '9783030452346' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer status: public title: Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming type: conference user_id: '53103' year: '2020' ... --- _id: '17085' author: - first_name: Bahar full_name: Schwichtenberg, Bahar id: '36399' last_name: Schwichtenberg - first_name: Simon full_name: Schwichtenberg, Simon id: '13235' last_name: Schwichtenberg - first_name: Jochen full_name: Küster, Jochen last_name: Küster - first_name: Olaf full_name: Zimmermann, Olaf last_name: Zimmermann - first_name: Gregor full_name: Engels, Gregor id: '107' last_name: Engels citation: ama: 'Schwichtenberg B, Schwichtenberg S, Küster J, Zimmermann O, Engels G. Modeling and Analyzing Architectural Diversity of Open Platforms. In: Advanced Information Systems Engineering. Cham; 2020. doi:10.1007/978-3-030-49435-3_3' apa: Schwichtenberg, B., Schwichtenberg, S., Küster, J., Zimmermann, O., & Engels, G. (2020). Modeling and Analyzing Architectural Diversity of Open Platforms. In Advanced Information Systems Engineering. Cham. https://doi.org/10.1007/978-3-030-49435-3_3 bibtex: '@inproceedings{Schwichtenberg_Schwichtenberg_Küster_Zimmermann_Engels_2020, place={Cham}, title={Modeling and Analyzing Architectural Diversity of Open Platforms}, DOI={10.1007/978-3-030-49435-3_3}, booktitle={Advanced Information Systems Engineering}, author={Schwichtenberg, Bahar and Schwichtenberg, Simon and Küster, Jochen and Zimmermann, Olaf and Engels, Gregor}, year={2020} }' chicago: Schwichtenberg, Bahar, Simon Schwichtenberg, Jochen Küster, Olaf Zimmermann, and Gregor Engels. “Modeling and Analyzing Architectural Diversity of Open Platforms.” In Advanced Information Systems Engineering. Cham, 2020. https://doi.org/10.1007/978-3-030-49435-3_3. ieee: B. Schwichtenberg, S. Schwichtenberg, J. Küster, O. Zimmermann, and G. Engels, “Modeling and Analyzing Architectural Diversity of Open Platforms,” in Advanced Information Systems Engineering, 2020. mla: Schwichtenberg, Bahar, et al. “Modeling and Analyzing Architectural Diversity of Open Platforms.” Advanced Information Systems Engineering, 2020, doi:10.1007/978-3-030-49435-3_3. short: 'B. Schwichtenberg, S. Schwichtenberg, J. Küster, O. Zimmermann, G. Engels, in: Advanced Information Systems Engineering, Cham, 2020.' date_created: 2020-06-07T08:53:10Z date_updated: 2022-01-06T06:53:04Z doi: 10.1007/978-3-030-49435-3_3 language: - iso: eng place: Cham publication: Advanced Information Systems Engineering publication_identifier: isbn: - '9783030494346' - '9783030494353' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Modeling and Analyzing Architectural Diversity of Open Platforms type: conference user_id: '36399' year: '2020' ... --- _id: '28997' abstract: - lang: eng text: "Modern cryptographic protocols, such as TLS 1.3 and QUIC, can send cryptographically protected data in “zero round-trip times (0-RTT)”, that is, without the need for a prior interactive handshake. Such protocols meet the demand for communication with minimal latency, but those currently deployed in practice achieve only rather weak security properties, as they may not achieve forward security for the first transmitted payload message and require additional countermeasures against replay attacks.Recently, 0-RTT protocols with full forward security and replay resilience have been proposed in the academic literature. These are based on puncturable encryption, which uses rather heavy building blocks, such as cryptographic pairings. Some constructions were claimed to have practical efficiency, but it is unclear how they compare concretely to protocols deployed in practice, and we currently do not have any benchmark results that new protocols can be compared with.We provide the first concrete performance analysis of a modern 0-RTT protocol with full forward security, by integrating the Bloom Filter Encryption scheme of Derler et al. (EUROCRYPT 2018) in the Chromium QUIC implementation and comparing it to Google’s original QUIC protocol. We find that for reasonable deployment parameters, the server CPU load increases approximately by a factor of eight and the memory consumption on the server increases significantly, but stays below 400 MB even for medium-scale deployments that handle up to 50K connections per day. The difference of the size of handshake messages is small enough that transmission time on the network is identical, and therefore not significant.We conclude that while current 0-RTT protocols with full forward security come with significant computational overhead, their use in practice is feasible, and may be used in applications where the increased CPU and memory load can be tolerated in exchange for full forward security and replay resilience on the cryptographic protocol level. Our results serve as a first benchmark that can be used to assess the efficiency of 0-RTT protocols potentially developed in the future.\r\n" author: - first_name: Fynn full_name: Dallmeier, Fynn last_name: Dallmeier - first_name: Jan P. full_name: Drees, Jan P. last_name: Drees - first_name: Kai full_name: Gellert, Kai last_name: Gellert - first_name: Tobias full_name: Handirk, Tobias last_name: Handirk - first_name: Tibor full_name: Jager, Tibor last_name: Jager - first_name: Jonas full_name: Klauke, Jonas id: '40915' last_name: Klauke orcid: 0000-0001-9160-9636 - first_name: Simon full_name: Nachtigall, Simon last_name: Nachtigall - first_name: Timo full_name: Renzelmann, Timo last_name: Renzelmann - first_name: Rudi full_name: Wolf, Rudi last_name: Wolf citation: ama: 'Dallmeier F, Drees JP, Gellert K, et al. Forward-Secure 0-RTT Goes Live: Implementation and Performance Analysis in QUIC. In: Cryptology and Network Security. Springer-Verlag; 2020:211-231. doi:10.1007/978-3-030-65411-5_11' apa: 'Dallmeier, F., Drees, J. P., Gellert, K., Handirk, T., Jager, T., Klauke, J., Nachtigall, S., Renzelmann, T., & Wolf, R. (2020). Forward-Secure 0-RTT Goes Live: Implementation and Performance Analysis in QUIC. Cryptology and Network Security, 211–231. https://doi.org/10.1007/978-3-030-65411-5_11' bibtex: '@inproceedings{Dallmeier_Drees_Gellert_Handirk_Jager_Klauke_Nachtigall_Renzelmann_Wolf_2020, place={Cham}, title={Forward-Secure 0-RTT Goes Live: Implementation and Performance Analysis in QUIC}, DOI={10.1007/978-3-030-65411-5_11}, booktitle={Cryptology and Network Security}, publisher={Springer-Verlag}, author={Dallmeier, Fynn and Drees, Jan P. and Gellert, Kai and Handirk, Tobias and Jager, Tibor and Klauke, Jonas and Nachtigall, Simon and Renzelmann, Timo and Wolf, Rudi}, year={2020}, pages={211–231} }' chicago: 'Dallmeier, Fynn, Jan P. Drees, Kai Gellert, Tobias Handirk, Tibor Jager, Jonas Klauke, Simon Nachtigall, Timo Renzelmann, and Rudi Wolf. “Forward-Secure 0-RTT Goes Live: Implementation and Performance Analysis in QUIC.” In Cryptology and Network Security, 211–31. Cham: Springer-Verlag, 2020. https://doi.org/10.1007/978-3-030-65411-5_11.' ieee: 'F. Dallmeier et al., “Forward-Secure 0-RTT Goes Live: Implementation and Performance Analysis in QUIC,” in Cryptology and Network Security, Vienna, 2020, pp. 211–231, doi: 10.1007/978-3-030-65411-5_11.' mla: 'Dallmeier, Fynn, et al. “Forward-Secure 0-RTT Goes Live: Implementation and Performance Analysis in QUIC.” Cryptology and Network Security, Springer-Verlag, 2020, pp. 211–31, doi:10.1007/978-3-030-65411-5_11.' short: 'F. Dallmeier, J.P. Drees, K. Gellert, T. Handirk, T. Jager, J. Klauke, S. Nachtigall, T. Renzelmann, R. Wolf, in: Cryptology and Network Security, Springer-Verlag, Cham, 2020, pp. 211–231.' conference: end_date: 2020-12-16 location: Vienna name: CANS 2020 start_date: 2020-12-14 date_created: 2021-12-15T17:43:11Z date_updated: 2022-03-11T10:59:41Z doi: 10.1007/978-3-030-65411-5_11 extern: '1' language: - iso: eng page: 211-231 place: Cham publication: Cryptology and Network Security publication_identifier: isbn: - '9783030654108' - '9783030654115' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer-Verlag status: public title: 'Forward-Secure 0-RTT Goes Live: Implementation and Performance Analysis in QUIC' type: conference user_id: '40915' year: '2020' ... --- _id: '20706' author: - first_name: Philipp full_name: zur Heiden, Philipp last_name: zur Heiden citation: ama: 'zur Heiden P. Considering Context in Design Science Research: A Systematic Literature Review. In: Designing for Digital Transformation. Co-Creating Services with Citizens and Industry. ; 2020. doi:10.1007/978-3-030-64823-7_21' apa: 'zur Heiden, P. (2020). Considering Context in Design Science Research: A Systematic Literature Review. Designing for Digital Transformation. Co-Creating Services with Citizens and Industry. https://doi.org/10.1007/978-3-030-64823-7_21' bibtex: '@inproceedings{zur Heiden_2020, place={Cham}, title={Considering Context in Design Science Research: A Systematic Literature Review}, DOI={10.1007/978-3-030-64823-7_21}, booktitle={Designing for Digital Transformation. Co-Creating Services with Citizens and Industry}, author={zur Heiden, Philipp}, year={2020} }' chicago: 'Heiden, Philipp zur. “Considering Context in Design Science Research: A Systematic Literature Review.” In Designing for Digital Transformation. Co-Creating Services with Citizens and Industry. Cham, 2020. https://doi.org/10.1007/978-3-030-64823-7_21.' ieee: 'P. zur Heiden, “Considering Context in Design Science Research: A Systematic Literature Review,” 2020, doi: 10.1007/978-3-030-64823-7_21.' mla: 'zur Heiden, Philipp. “Considering Context in Design Science Research: A Systematic Literature Review.” Designing for Digital Transformation. Co-Creating Services with Citizens and Industry, 2020, doi:10.1007/978-3-030-64823-7_21.' short: 'P. zur Heiden, in: Designing for Digital Transformation. Co-Creating Services with Citizens and Industry, Cham, 2020.' date_created: 2020-12-11T14:01:48Z date_updated: 2022-04-04T09:59:49Z doi: 10.1007/978-3-030-64823-7_21 language: - iso: eng place: Cham publication: Designing for Digital Transformation. Co-Creating Services with Citizens and Industry publication_identifier: isbn: - '9783030648220' - '9783030648237' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: 'Considering Context in Design Science Research: A Systematic Literature Review' type: conference user_id: '64394' year: '2020' ... --- _id: '45848' author: - first_name: Yasir full_name: Mahmood, Yasir last_name: Mahmood - first_name: Arne full_name: Meier, Arne last_name: Meier citation: ama: 'Mahmood Y, Meier A. Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic. In: Lecture Notes in Computer Science. Springer International Publishing; 2020. doi:10.1007/978-3-030-39951-1_10' apa: Mahmood, Y., & Meier, A. (2020). Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-030-39951-1_10 bibtex: '@inproceedings{Mahmood_Meier_2020, place={Cham}, title={Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic}, DOI={10.1007/978-3-030-39951-1_10}, booktitle={Lecture Notes in Computer Science}, publisher={Springer International Publishing}, author={Mahmood, Yasir and Meier, Arne}, year={2020} }' chicago: 'Mahmood, Yasir, and Arne Meier. “Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic.” In Lecture Notes in Computer Science. Cham: Springer International Publishing, 2020. https://doi.org/10.1007/978-3-030-39951-1_10.' ieee: 'Y. Mahmood and A. Meier, “Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic,” 2020, doi: 10.1007/978-3-030-39951-1_10.' mla: Mahmood, Yasir, and Arne Meier. “Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic.” Lecture Notes in Computer Science, Springer International Publishing, 2020, doi:10.1007/978-3-030-39951-1_10. short: 'Y. Mahmood, A. Meier, in: Lecture Notes in Computer Science, Springer International Publishing, Cham, 2020.' date_created: 2023-07-03T11:41:58Z date_updated: 2023-07-03T11:43:37Z doi: 10.1007/978-3-030-39951-1_10 language: - iso: eng place: Cham publication: Lecture Notes in Computer Science publication_identifier: isbn: - '9783030399504' - '9783030399511' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer International Publishing status: public title: Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic type: conference user_id: '99353' year: '2020' ... --- _id: '47261' author: - first_name: Julie M. full_name: Haney, Julie M. last_name: Haney - first_name: Susanne M. full_name: Furman, Susanne M. last_name: Furman - first_name: Yasemin full_name: Acar, Yasemin id: '94636' last_name: Acar citation: ama: 'Haney JM, Furman SM, Acar Y. Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges. In: HCI for Cybersecurity, Privacy and Trust. Springer International Publishing; 2020. doi:10.1007/978-3-030-50309-3_26' apa: 'Haney, J. M., Furman, S. M., & Acar, Y. (2020). Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges. In HCI for Cybersecurity, Privacy and Trust. Springer International Publishing. https://doi.org/10.1007/978-3-030-50309-3_26' bibtex: '@inbook{Haney_Furman_Acar_2020, place={Cham}, title={Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges}, DOI={10.1007/978-3-030-50309-3_26}, booktitle={HCI for Cybersecurity, Privacy and Trust}, publisher={Springer International Publishing}, author={Haney, Julie M. and Furman, Susanne M. and Acar, Yasemin}, year={2020} }' chicago: 'Haney, Julie M., Susanne M. Furman, and Yasemin Acar. “Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges.” In HCI for Cybersecurity, Privacy and Trust. Cham: Springer International Publishing, 2020. https://doi.org/10.1007/978-3-030-50309-3_26.' ieee: 'J. M. Haney, S. M. Furman, and Y. Acar, “Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges,” in HCI for Cybersecurity, Privacy and Trust, Cham: Springer International Publishing, 2020.' mla: 'Haney, Julie M., et al. “Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges.” HCI for Cybersecurity, Privacy and Trust, Springer International Publishing, 2020, doi:10.1007/978-3-030-50309-3_26.' short: 'J.M. Haney, S.M. Furman, Y. Acar, in: HCI for Cybersecurity, Privacy and Trust, Springer International Publishing, Cham, 2020.' date_created: 2023-09-22T12:59:53Z date_updated: 2023-11-22T09:57:52Z department: - _id: '34' - _id: '740' doi: 10.1007/978-3-030-50309-3_26 extern: '1' language: - iso: eng place: Cham publication: HCI for Cybersecurity, Privacy and Trust publication_identifier: isbn: - '9783030503086' - '9783030503093' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer International Publishing status: public title: 'Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges' type: book_chapter user_id: '15458' year: '2020' ... --- _id: '11952' author: - first_name: Björn full_name: Senft, Björn id: '9109' last_name: Senft - first_name: Florian full_name: Rittmeier, Florian id: '5281' last_name: Rittmeier - first_name: Holger Gerhard full_name: Fischer, Holger Gerhard id: '30457' last_name: Fischer - first_name: Simon full_name: Oberthür, Simon id: '383' last_name: Oberthür citation: ama: 'Senft B, Rittmeier F, Fischer HG, Oberthür S. A Value-Centered Approach for Unique and Novel Software Applications. In: Design, User Experience, and Usability. Practice and Case Studies. Cham; 2019. doi:10.1007/978-3-030-23535-2_27' apa: Senft, B., Rittmeier, F., Fischer, H. G., & Oberthür, S. (2019). A Value-Centered Approach for Unique and Novel Software Applications. In Design, User Experience, and Usability. Practice and Case Studies. Cham. https://doi.org/10.1007/978-3-030-23535-2_27 bibtex: '@inbook{Senft_Rittmeier_Fischer_Oberthür_2019, place={Cham}, title={A Value-Centered Approach for Unique and Novel Software Applications}, DOI={10.1007/978-3-030-23535-2_27}, booktitle={Design, User Experience, and Usability. Practice and Case Studies}, author={Senft, Björn and Rittmeier, Florian and Fischer, Holger Gerhard and Oberthür, Simon}, year={2019} }' chicago: Senft, Björn, Florian Rittmeier, Holger Gerhard Fischer, and Simon Oberthür. “A Value-Centered Approach for Unique and Novel Software Applications.” In Design, User Experience, and Usability. Practice and Case Studies. Cham, 2019. https://doi.org/10.1007/978-3-030-23535-2_27. ieee: B. Senft, F. Rittmeier, H. G. Fischer, and S. Oberthür, “A Value-Centered Approach for Unique and Novel Software Applications,” in Design, User Experience, and Usability. Practice and Case Studies, Cham, 2019. mla: Senft, Björn, et al. “A Value-Centered Approach for Unique and Novel Software Applications.” Design, User Experience, and Usability. Practice and Case Studies, 2019, doi:10.1007/978-3-030-23535-2_27. short: 'B. Senft, F. Rittmeier, H.G. Fischer, S. Oberthür, in: Design, User Experience, and Usability. Practice and Case Studies, Cham, 2019.' conference: end_date: 2019-07-31 location: Orlando, FL, USA name: 21st International Conference on Human-Computer Interaction start_date: 2019-07-26 date_created: 2019-07-14T07:57:53Z date_updated: 2022-01-06T06:51:13Z department: - _id: '66' doi: 10.1007/978-3-030-23535-2_27 language: - iso: eng place: Cham publication: Design, User Experience, and Usability. Practice and Case Studies publication_identifier: isbn: - '9783030235345' - '9783030235352' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: A Value-Centered Approach for Unique and Novel Software Applications type: book_chapter user_id: '9109' year: '2019' ... --- _id: '14890' author: - first_name: Stefan full_name: Kuhlemann, Stefan id: '38910' last_name: Kuhlemann - first_name: Meinolf full_name: Sellmann, Meinolf last_name: Sellmann - first_name: Kevin full_name: Tierney, Kevin last_name: Tierney citation: ama: 'Kuhlemann S, Sellmann M, Tierney K. Exploiting Counterfactuals for Scalable Stochastic Optimization. In: Lecture Notes in Computer Science. Cham; 2019. doi:10.1007/978-3-030-30048-7_40' apa: Kuhlemann, S., Sellmann, M., & Tierney, K. (2019). Exploiting Counterfactuals for Scalable Stochastic Optimization. In Lecture Notes in Computer Science. Cham. https://doi.org/10.1007/978-3-030-30048-7_40 bibtex: '@inbook{Kuhlemann_Sellmann_Tierney_2019, place={Cham}, title={Exploiting Counterfactuals for Scalable Stochastic Optimization}, DOI={10.1007/978-3-030-30048-7_40}, booktitle={Lecture Notes in Computer Science}, author={Kuhlemann, Stefan and Sellmann, Meinolf and Tierney, Kevin}, year={2019} }' chicago: Kuhlemann, Stefan, Meinolf Sellmann, and Kevin Tierney. “Exploiting Counterfactuals for Scalable Stochastic Optimization.” In Lecture Notes in Computer Science. Cham, 2019. https://doi.org/10.1007/978-3-030-30048-7_40. ieee: S. Kuhlemann, M. Sellmann, and K. Tierney, “Exploiting Counterfactuals for Scalable Stochastic Optimization,” in Lecture Notes in Computer Science, Cham, 2019. mla: Kuhlemann, Stefan, et al. “Exploiting Counterfactuals for Scalable Stochastic Optimization.” Lecture Notes in Computer Science, 2019, doi:10.1007/978-3-030-30048-7_40. short: 'S. Kuhlemann, M. Sellmann, K. Tierney, in: Lecture Notes in Computer Science, Cham, 2019.' date_created: 2019-11-12T07:45:53Z date_updated: 2022-01-06T06:52:09Z department: - _id: '277' doi: 10.1007/978-3-030-30048-7_40 language: - iso: eng place: Cham publication: Lecture Notes in Computer Science publication_identifier: isbn: - '9783030300470' - '9783030300487' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Exploiting Counterfactuals for Scalable Stochastic Optimization type: book_chapter user_id: '38910' year: '2019' ... --- _id: '15004' author: - first_name: Mohsen full_name: Ahmadi Fahandar, Mohsen id: '59547' last_name: Ahmadi Fahandar - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier citation: ama: 'Ahmadi Fahandar M, Hüllermeier E. Feature Selection for Analogy-Based Learning to Rank. In: Discovery Science. Cham; 2019. doi:10.1007/978-3-030-33778-0_22' apa: Ahmadi Fahandar, M., & Hüllermeier, E. (2019). Feature Selection for Analogy-Based Learning to Rank. In Discovery Science. Cham. https://doi.org/10.1007/978-3-030-33778-0_22 bibtex: '@inbook{Ahmadi Fahandar_Hüllermeier_2019, place={Cham}, title={Feature Selection for Analogy-Based Learning to Rank}, DOI={10.1007/978-3-030-33778-0_22}, booktitle={Discovery Science}, author={Ahmadi Fahandar, Mohsen and Hüllermeier, Eyke}, year={2019} }' chicago: Ahmadi Fahandar, Mohsen, and Eyke Hüllermeier. “Feature Selection for Analogy-Based Learning to Rank.” In Discovery Science. Cham, 2019. https://doi.org/10.1007/978-3-030-33778-0_22. ieee: M. Ahmadi Fahandar and E. Hüllermeier, “Feature Selection for Analogy-Based Learning to Rank,” in Discovery Science, Cham, 2019. mla: Ahmadi Fahandar, Mohsen, and Eyke Hüllermeier. “Feature Selection for Analogy-Based Learning to Rank.” Discovery Science, 2019, doi:10.1007/978-3-030-33778-0_22. short: 'M. Ahmadi Fahandar, E. Hüllermeier, in: Discovery Science, Cham, 2019.' date_created: 2019-11-15T10:24:45Z date_updated: 2022-01-06T06:52:14Z department: - _id: '34' - _id: '355' doi: 10.1007/978-3-030-33778-0_22 language: - iso: eng place: Cham publication: Discovery Science publication_identifier: isbn: - '9783030337773' - '9783030337780' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Feature Selection for Analogy-Based Learning to Rank type: book_chapter user_id: '315' year: '2019' ... --- _id: '15005' author: - first_name: Mohsen full_name: Ahmadi Fahandar, Mohsen id: '59547' last_name: Ahmadi Fahandar - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier citation: ama: 'Ahmadi Fahandar M, Hüllermeier E. Analogy-Based Preference Learning with Kernels. In: KI 2019: Advances in Artificial Intelligence. Cham; 2019. doi:10.1007/978-3-030-30179-8_3' apa: 'Ahmadi Fahandar, M., & Hüllermeier, E. (2019). Analogy-Based Preference Learning with Kernels. In KI 2019: Advances in Artificial Intelligence. Cham. https://doi.org/10.1007/978-3-030-30179-8_3' bibtex: '@inbook{Ahmadi Fahandar_Hüllermeier_2019, place={Cham}, title={Analogy-Based Preference Learning with Kernels}, DOI={10.1007/978-3-030-30179-8_3}, booktitle={KI 2019: Advances in Artificial Intelligence}, author={Ahmadi Fahandar, Mohsen and Hüllermeier, Eyke}, year={2019} }' chicago: 'Ahmadi Fahandar, Mohsen, and Eyke Hüllermeier. “Analogy-Based Preference Learning with Kernels.” In KI 2019: Advances in Artificial Intelligence. Cham, 2019. https://doi.org/10.1007/978-3-030-30179-8_3.' ieee: 'M. Ahmadi Fahandar and E. Hüllermeier, “Analogy-Based Preference Learning with Kernels,” in KI 2019: Advances in Artificial Intelligence, Cham, 2019.' mla: 'Ahmadi Fahandar, Mohsen, and Eyke Hüllermeier. “Analogy-Based Preference Learning with Kernels.” KI 2019: Advances in Artificial Intelligence, 2019, doi:10.1007/978-3-030-30179-8_3.' short: 'M. Ahmadi Fahandar, E. Hüllermeier, in: KI 2019: Advances in Artificial Intelligence, Cham, 2019.' date_created: 2019-11-15T10:30:10Z date_updated: 2022-01-06T06:52:14Z department: - _id: '34' - _id: '355' doi: 10.1007/978-3-030-30179-8_3 language: - iso: eng place: Cham publication: 'KI 2019: Advances in Artificial Intelligence' publication_identifier: isbn: - '9783030301781' - '9783030301798' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Analogy-Based Preference Learning with Kernels type: book_chapter user_id: '315' year: '2019' ... --- _id: '15006' author: - first_name: Vu-Linh full_name: Nguyen, Vu-Linh last_name: Nguyen - first_name: Sébastien full_name: Destercke, Sébastien last_name: Destercke - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier citation: ama: 'Nguyen V-L, Destercke S, Hüllermeier E. Epistemic Uncertainty Sampling. In: Discovery Science. Cham; 2019. doi:10.1007/978-3-030-33778-0_7' apa: Nguyen, V.-L., Destercke, S., & Hüllermeier, E. (2019). Epistemic Uncertainty Sampling. In Discovery Science. Cham. https://doi.org/10.1007/978-3-030-33778-0_7 bibtex: '@inbook{Nguyen_Destercke_Hüllermeier_2019, place={Cham}, title={Epistemic Uncertainty Sampling}, DOI={10.1007/978-3-030-33778-0_7}, booktitle={Discovery Science}, author={Nguyen, Vu-Linh and Destercke, Sébastien and Hüllermeier, Eyke}, year={2019} }' chicago: Nguyen, Vu-Linh, Sébastien Destercke, and Eyke Hüllermeier. “Epistemic Uncertainty Sampling.” In Discovery Science. Cham, 2019. https://doi.org/10.1007/978-3-030-33778-0_7. ieee: V.-L. Nguyen, S. Destercke, and E. Hüllermeier, “Epistemic Uncertainty Sampling,” in Discovery Science, Cham, 2019. mla: Nguyen, Vu-Linh, et al. “Epistemic Uncertainty Sampling.” Discovery Science, 2019, doi:10.1007/978-3-030-33778-0_7. short: 'V.-L. Nguyen, S. Destercke, E. Hüllermeier, in: Discovery Science, Cham, 2019.' date_created: 2019-11-15T10:35:08Z date_updated: 2022-01-06T06:52:14Z department: - _id: '34' - _id: '355' doi: 10.1007/978-3-030-33778-0_7 language: - iso: eng place: Cham publication: Discovery Science publication_identifier: isbn: - '9783030337773' - '9783030337780' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Epistemic Uncertainty Sampling type: book_chapter user_id: '49109' year: '2019' ... --- _id: '15080' author: - first_name: Rita full_name: Hartel, Rita id: '14961' last_name: Hartel - first_name: Alexander full_name: Dunst, Alexander last_name: Dunst citation: ama: 'Hartel R, Dunst A. How Good Is Good Enough? Establishing Quality Thresholds for the Automatic Text Analysis of Retro-Digitized Comics. In: International Conference on Multimedia Modeling, MMM. Springer; 2019:662-671. doi:10.1007/978-3-030-05716-9_59' apa: 'Hartel, R., & Dunst, A. (2019). How Good Is Good Enough? Establishing Quality Thresholds for the Automatic Text Analysis of Retro-Digitized Comics. In International Conference on Multimedia Modeling, MMM (pp. 662–671). Thessaloniki, Greece: Springer. https://doi.org/10.1007/978-3-030-05716-9_59' bibtex: '@inproceedings{Hartel_Dunst_2019, title={How Good Is Good Enough? Establishing Quality Thresholds for the Automatic Text Analysis of Retro-Digitized Comics}, DOI={10.1007/978-3-030-05716-9_59}, booktitle={International Conference on Multimedia Modeling, MMM}, publisher={Springer}, author={Hartel, Rita and Dunst, Alexander}, year={2019}, pages={662–671} }' chicago: Hartel, Rita, and Alexander Dunst. “How Good Is Good Enough? Establishing Quality Thresholds for the Automatic Text Analysis of Retro-Digitized Comics.” In International Conference on Multimedia Modeling, MMM, 662–71. Springer, 2019. https://doi.org/10.1007/978-3-030-05716-9_59. ieee: R. Hartel and A. Dunst, “How Good Is Good Enough? Establishing Quality Thresholds for the Automatic Text Analysis of Retro-Digitized Comics,” in International Conference on Multimedia Modeling, MMM, Thessaloniki, Greece, 2019, pp. 662–671. mla: Hartel, Rita, and Alexander Dunst. “How Good Is Good Enough? Establishing Quality Thresholds for the Automatic Text Analysis of Retro-Digitized Comics.” International Conference on Multimedia Modeling, MMM, Springer, 2019, pp. 662–71, doi:10.1007/978-3-030-05716-9_59. short: 'R. Hartel, A. Dunst, in: International Conference on Multimedia Modeling, MMM, Springer, 2019, pp. 662–671.' conference: location: Thessaloniki, Greece date_created: 2019-11-21T14:42:25Z date_updated: 2022-01-06T06:52:15Z department: - _id: '69' doi: 10.1007/978-3-030-05716-9_59 language: - iso: eng page: 662-671 publication: International Conference on Multimedia Modeling, MMM publication_identifier: isbn: - '9783030057152' - '9783030057169' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer status: public title: How Good Is Good Enough? Establishing Quality Thresholds for the Automatic Text Analysis of Retro-Digitized Comics type: conference user_id: '14961' 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: '45818' author: - first_name: Yasir full_name: Mahmood, Yasir last_name: Mahmood - first_name: Arne full_name: Meier, Arne last_name: Meier - first_name: Johannes full_name: Schmidt, Johannes last_name: Schmidt citation: ama: 'Mahmood Y, Meier A, Schmidt J. Parameterised Complexity of Abduction in Schaefer’s Framework. In: Logical Foundations of Computer Science. Springer International Publishing; 2019. doi:10.1007/978-3-030-36755-8_13' apa: Mahmood, Y., Meier, A., & Schmidt, J. (2019). Parameterised Complexity of Abduction in Schaefer’s Framework. Logical Foundations of Computer Science. https://doi.org/10.1007/978-3-030-36755-8_13 bibtex: '@inproceedings{Mahmood_Meier_Schmidt_2019, place={Cham}, title={Parameterised Complexity of Abduction in Schaefer’s Framework}, DOI={10.1007/978-3-030-36755-8_13}, booktitle={Logical Foundations of Computer Science}, publisher={Springer International Publishing}, author={Mahmood, Yasir and Meier, Arne and Schmidt, Johannes}, year={2019} }' chicago: 'Mahmood, Yasir, Arne Meier, and Johannes Schmidt. “Parameterised Complexity of Abduction in Schaefer’s Framework.” In Logical Foundations of Computer Science. Cham: Springer International Publishing, 2019. https://doi.org/10.1007/978-3-030-36755-8_13.' ieee: 'Y. Mahmood, A. Meier, and J. Schmidt, “Parameterised Complexity of Abduction in Schaefer’s Framework,” 2019, doi: 10.1007/978-3-030-36755-8_13.' mla: Mahmood, Yasir, et al. “Parameterised Complexity of Abduction in Schaefer’s Framework.” Logical Foundations of Computer Science, Springer International Publishing, 2019, doi:10.1007/978-3-030-36755-8_13. short: 'Y. Mahmood, A. Meier, J. Schmidt, in: Logical Foundations of Computer Science, Springer International Publishing, Cham, 2019.' date_created: 2023-06-30T11:51:03Z date_updated: 2023-07-03T11:44:22Z doi: 10.1007/978-3-030-36755-8_13 language: - iso: eng place: Cham publication: Logical Foundations of Computer Science publication_identifier: isbn: - '9783030367541' - '9783030367558' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer International Publishing status: public title: Parameterised Complexity of Abduction in Schaefer’s Framework type: conference user_id: '99353' year: '2019' ... --- _id: '2862' author: - first_name: Johannes full_name: Blömer, Johannes id: '23' last_name: Blömer - first_name: Fabian full_name: Eidens, Fabian id: '25078' last_name: Eidens - first_name: Jakob full_name: Juhnke, Jakob id: '48090' last_name: Juhnke citation: ama: 'Blömer J, Eidens F, Juhnke J. Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems. In: Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings. Cham: Springer International Publishing; 2018:470-490. doi:10.1007/978-3-319-76953-0_25' apa: 'Blömer, J., Eidens, F., & Juhnke, J. (2018). Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems. In Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings (pp. 470–490). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-76953-0_25' bibtex: '@inproceedings{Blömer_Eidens_Juhnke_2018, place={Cham}, title={Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems}, DOI={10.1007/978-3-319-76953-0_25}, booktitle={Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings}, publisher={Springer International Publishing}, author={Blömer, Johannes and Eidens, Fabian and Juhnke, Jakob}, year={2018}, pages={470–490} }' chicago: 'Blömer, Johannes, Fabian Eidens, and Jakob Juhnke. “Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems.” In Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings, 470–90. Cham: Springer International Publishing, 2018. https://doi.org/10.1007/978-3-319-76953-0_25.' ieee: J. Blömer, F. Eidens, and J. Juhnke, “Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems,” in Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings, San Francisco, CA, USA, 2018, pp. 470–490. mla: Blömer, Johannes, et al. “Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems.” Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings, Springer International Publishing, 2018, pp. 470–90, doi:10.1007/978-3-319-76953-0_25. short: 'J. Blömer, F. Eidens, J. Juhnke, in: Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings, Springer International Publishing, Cham, 2018, pp. 470–490.' conference: end_date: 2018-04-20 location: San Francisco, CA, USA name: Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the {RSA} Conference 2018 start_date: 2018-04-16 date_created: 2018-05-24T11:14:02Z date_updated: 2022-01-06T06:58:12Z ddc: - '004' department: - _id: '7' - _id: '64' doi: 10.1007/978-3-319-76953-0_25 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T13:45:40Z date_updated: 2018-11-02T13:45:40Z file_id: '5253' file_name: PracticalAnonymousAndPubliclyL.pdf file_size: 3371773 relation: main_file success: 1 file_date_updated: 2018-11-02T13:45:40Z has_accepted_license: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2018/029 oa: '1' page: 470-490 place: Cham project: - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C - _id: '13' name: SFB 901 - Subproject C1 publication: Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the {RSA} Conference 2018, Proceedings publication_identifier: isbn: - '9783319769523' - '9783319769530' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer International Publishing status: public title: Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems type: conference user_id: '477' year: '2018' ... --- _id: '24396' abstract: - lang: eng text: 'We study the Online Prize-collecting Node-weighted Steiner Forest problem (OPC-NWSF) in which we are given an undirected graph \(G=(V, E)\) with \(|V| = n\) and node-weight function \(w: V \rightarrow \mathcal {R}^+\). A sequence of k pairs of nodes of G, each associated with a penalty, arrives online. OPC-NWSF asks to construct a subgraph H such that each pair \(\{s, t\}\) is either connected (there is a path between s and t in H) or its associated penalty is paid. The goal is to minimize the weight of H and the total penalties paid. The current best result for OPC-NWSF is a randomized \(\mathcal {O}(\log ^4 n)\)-competitive algorithm due to Hajiaghayi et al. (ICALP 2014). We improve this by proposing a randomized \(\mathcal {O}(\log n \log k)\)-competitive algorithm for OPC-NWSF, which is optimal up to constant factor since OPC-NWSF has a randomized lower bound of \(\varOmega (\log ^2 n)\) due to Korman [11]. Moreover, our result also implies an improvement for two special cases of OPC-NWSF, the Online Prize-collecting Node-weighted Steiner Tree problem (OPC-NWST) and the Online Node-weighted Steiner Forest problem (ONWSF). In OPC-NWST, there is a distinguished node which is one of the nodes in each pair. In ONWSF, all penalties are set to infinity. The currently best known results for OPC-NWST and ONWSF are a randomized \(\mathcal {O}(\log ^3 n)\)-competitive algorithm due to Hajiaghayi et al. (ICALP 2014) and a randomized \(\mathcal {O}(\log n \log ^2 k)\)-competitive algorithm due to Hajiaghayi et al. (FOCS 2013), respectively.' author: - first_name: Christine full_name: Markarian, Christine last_name: Markarian citation: ama: 'Markarian C. An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest. In: International Workshop on Combinatorial Algorithms (IWOCA). ; 2018. doi:10.1007/978-3-319-94667-2_18' apa: Markarian, C. (2018). An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest. International Workshop on Combinatorial Algorithms (IWOCA). https://doi.org/10.1007/978-3-319-94667-2_18 bibtex: '@inproceedings{Markarian_2018, place={Cham}, title={An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest}, DOI={10.1007/978-3-319-94667-2_18}, booktitle={International Workshop on Combinatorial Algorithms (IWOCA)}, author={Markarian, Christine}, year={2018} }' chicago: Markarian, Christine. “An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest.” In International Workshop on Combinatorial Algorithms (IWOCA). Cham, 2018. https://doi.org/10.1007/978-3-319-94667-2_18. ieee: 'C. Markarian, “An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest,” 2018, doi: 10.1007/978-3-319-94667-2_18.' mla: Markarian, Christine. “An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest.” International Workshop on Combinatorial Algorithms (IWOCA), 2018, doi:10.1007/978-3-319-94667-2_18. short: 'C. Markarian, in: International Workshop on Combinatorial Algorithms (IWOCA), Cham, 2018.' date_created: 2021-09-14T12:23:29Z date_updated: 2022-01-06T06:56:19Z department: - _id: '63' doi: 10.1007/978-3-319-94667-2_18 language: - iso: eng place: Cham publication: International Workshop on Combinatorial Algorithms (IWOCA) publication_identifier: issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest type: conference user_id: '15415' year: '2018' ... --- _id: '3362' abstract: - lang: eng text: Profiling applications on a heterogeneous compute node is challenging since the way to retrieve data from the resources and interpret them varies between resource types and manufacturers. This holds especially true for measuring the energy consumption. In this paper we present Ampehre, a novel open source measurement framework that allows developers to gather comparable measurements from heterogeneous compute nodes, e.g., nodes comprising CPU, GPU, and FPGA. We explain the architecture of Ampehre and detail the measurement process on the example of energy measurements on CPU and GPU. To characterize the probing effect, we quantitatively analyze the trade-off between the accuracy of measurements and the CPU load imposed by Ampehre. Based on this analysis, we are able to specify reasonable combinations of sampling periods for the different resource types of a compute node. author: - first_name: Achim full_name: Lösch, Achim id: '43646' last_name: Lösch - first_name: Alex full_name: Wiens, Alex last_name: Wiens - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner citation: ama: 'Lösch A, Wiens A, Platzner M. Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes. In: Proceedings of the International Conference on Architecture of Computing Systems (ARCS). Vol 10793. Lecture Notes in Computer Science. Cham: Springer International Publishing; 2018:73-84. doi:10.1007/978-3-319-77610-1_6' apa: 'Lösch, A., Wiens, A., & Platzner, M. (2018). Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes. In Proceedings of the International Conference on Architecture of Computing Systems (ARCS) (Vol. 10793, pp. 73–84). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-77610-1_6' bibtex: '@inproceedings{Lösch_Wiens_Platzner_2018, place={Cham}, series={Lecture Notes in Computer Science}, title={Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes}, volume={10793}, DOI={10.1007/978-3-319-77610-1_6}, booktitle={Proceedings of the International Conference on Architecture of Computing Systems (ARCS)}, publisher={Springer International Publishing}, author={Lösch, Achim and Wiens, Alex and Platzner, Marco}, year={2018}, pages={73–84}, collection={Lecture Notes in Computer Science} }' chicago: 'Lösch, Achim, Alex Wiens, and Marco Platzner. “Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes.” In Proceedings of the International Conference on Architecture of Computing Systems (ARCS), 10793:73–84. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2018. https://doi.org/10.1007/978-3-319-77610-1_6.' ieee: 'A. Lösch, A. Wiens, and M. Platzner, “Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes,” in Proceedings of the International Conference on Architecture of Computing Systems (ARCS), 2018, vol. 10793, pp. 73–84.' mla: 'Lösch, Achim, et al. “Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes.” Proceedings of the International Conference on Architecture of Computing Systems (ARCS), vol. 10793, Springer International Publishing, 2018, pp. 73–84, doi:10.1007/978-3-319-77610-1_6.' short: 'A. Lösch, A. Wiens, M. Platzner, in: Proceedings of the International Conference on Architecture of Computing Systems (ARCS), Springer International Publishing, Cham, 2018, pp. 73–84.' date_created: 2018-06-26T13:47:52Z date_updated: 2022-01-06T06:59:13Z ddc: - '040' department: - _id: '78' doi: 10.1007/978-3-319-77610-1_6 file: - access_level: closed content_type: application/pdf creator: aloesch date_created: 2018-06-26T13:58:28Z date_updated: 2018-06-26T13:58:28Z file_id: '3363' file_name: loesch2017_arcs.pdf file_size: 1114026 relation: main_file success: 1 file_date_updated: 2018-06-26T13:58:28Z has_accepted_license: '1' intvolume: ' 10793' page: 73-84 place: Cham project: - _id: '14' name: SFB 901 - Subproject C2 - _id: '4' name: SFB 901 - Project Area C - _id: '1' name: SFB 901 publication: Proceedings of the International Conference on Architecture of Computing Systems (ARCS) publication_identifier: isbn: - '9783319776095' - '9783319776101' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer International Publishing series_title: Lecture Notes in Computer Science status: public title: 'Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes' type: conference user_id: '477' volume: 10793 year: '2018' ... --- _id: '3373' abstract: - lang: eng text: Modern Boolean satisfiability solvers can emit proofs of unsatisfiability. There is substantial interest in being able to verify such proofs and also in using them for further computations. In this paper, we present an FPGA accelerator for checking resolution proofs, a popular proof format. Our accelerator exploits parallelism at the low level by implementing the basic resolution step in hardware, and at the high level by instantiating a number of parallel modules for proof checking. Since proof checking involves highly irregular memory accesses, we employ Hybrid Memory Cube technology for accelerator memory. The results show that while the accelerator is scalable and achieves speedups for all benchmark proofs, performance improvements are currently limited by the overhead of transitioning the proof into the accelerator memory. author: - first_name: Tim full_name: Hansmeier, Tim id: '49992' last_name: Hansmeier orcid: 0000-0003-1377-3339 - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner - first_name: David full_name: Andrews, David last_name: Andrews citation: ama: 'Hansmeier T, Platzner M, Andrews D. An FPGA/HMC-Based Accelerator for Resolution Proof Checking. In: ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications. Vol 10824. Lecture Notes in Computer Science. Springer International Publishing; 2018:153-165. doi:10.1007/978-3-319-78890-6_13' apa: 'Hansmeier, T., Platzner, M., & Andrews, D. (2018). An FPGA/HMC-Based Accelerator for Resolution Proof Checking. In ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications (Vol. 10824, pp. 153–165). Santorini, Greece: Springer International Publishing. https://doi.org/10.1007/978-3-319-78890-6_13' bibtex: '@inproceedings{Hansmeier_Platzner_Andrews_2018, series={Lecture Notes in Computer Science}, title={An FPGA/HMC-Based Accelerator for Resolution Proof Checking}, volume={10824}, DOI={10.1007/978-3-319-78890-6_13}, booktitle={ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications}, publisher={Springer International Publishing}, author={Hansmeier, Tim and Platzner, Marco and Andrews, David}, year={2018}, pages={153–165}, collection={Lecture Notes in Computer Science} }' chicago: 'Hansmeier, Tim, Marco Platzner, and David Andrews. “An FPGA/HMC-Based Accelerator for Resolution Proof Checking.” In ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications, 10824:153–65. Lecture Notes in Computer Science. Springer International Publishing, 2018. https://doi.org/10.1007/978-3-319-78890-6_13.' ieee: 'T. Hansmeier, M. Platzner, and D. Andrews, “An FPGA/HMC-Based Accelerator for Resolution Proof Checking,” in ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications, Santorini, Greece, 2018, vol. 10824, pp. 153–165.' mla: 'Hansmeier, Tim, et al. “An FPGA/HMC-Based Accelerator for Resolution Proof Checking.” ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications, vol. 10824, Springer International Publishing, 2018, pp. 153–65, doi:10.1007/978-3-319-78890-6_13.' short: 'T. Hansmeier, M. Platzner, D. Andrews, in: ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications, Springer International Publishing, 2018, pp. 153–165.' conference: end_date: 2018-05-04 location: Santorini, Greece name: 'ARC: International Symposium on Applied Reconfigurable Computing' start_date: 2018-05-02 date_created: 2018-06-27T09:30:24Z date_updated: 2022-01-06T06:59:13Z ddc: - '000' department: - _id: '78' doi: 10.1007/978-3-319-78890-6_13 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T13:55:07Z date_updated: 2018-11-02T13:55:07Z file_id: '5257' file_name: AnFPGAHMC-BasedAcceleratorForR.pdf file_size: 612367 relation: main_file success: 1 file_date_updated: 2018-11-02T13:55:07Z has_accepted_license: '1' intvolume: ' 10824' language: - iso: eng page: 153-165 project: - _id: '12' name: SFB 901 - Subproject B4 - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B publication: 'ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications' publication_identifier: isbn: - '9783319788890' - '9783319788906' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer International Publishing series_title: Lecture Notes in Computer Science status: public title: An FPGA/HMC-Based Accelerator for Resolution Proof Checking type: conference user_id: '3118' volume: 10824 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: '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' ...