@misc{20495,
  author       = {{Jochmaring, Moritz}},
  title        = {{{A self stabilizing protocol for well-formed trees in hybrid networks}}},
  year         = {{2020}},
}

@article{20507,
  author       = {{Geismann, Johannes and Bodden, Eric}},
  issn         = {{0164-1212}},
  journal      = {{Journal of Systems and Software}},
  pages        = {{110697}},
  title        = {{{A systematic literature review of model-driven security engineering for cyber–physical systems}}},
  doi          = {{https://doi.org/10.1016/j.jss.2020.110697}},
  volume       = {{169}},
  year         = {{2020}},
}

@inproceedings{20509,
  author       = {{Fischer, Andreas and Janneck, Jonas and Kussmaul, Jörn and Krätzschmar, Nikolas and Kerschbaum, Florian and Bodden, Eric}},
  booktitle    = {{2020 IEEE Computer Security Foundations Symposium (CSF)}},
  title        = {{{PASAPTO: Policy-aware Security and Performance Trade-off Analysis - Computation on Encrypted Data with Restricted Leakage}}},
  year         = {{2020}},
}

@inproceedings{20511,
  author       = {{Fischer, Andreas and Fuhry, Benny and Kerschbaum, Florian and Bodden, Eric}},
  booktitle    = {{Privacy Enhancing Technologies Symposium (PETS/PoPETS)}},
  title        = {{{Computation on Encrypted Data using Dataflow Authentication}}},
  year         = {{2020}},
}

@inproceedings{20512,
  author       = {{Krüger, Stefan and Ali, Karim and Bodden, Eric}},
  booktitle    = {{International Symposium on Code Generation and Optimization (CGO)}},
  pages        = {{185--198}},
  title        = {{{CogniCrypt_GEN - Generating Code for the Secure Usage of Crypto APIs}}},
  year         = {{2020}},
}

@phdthesis{20513,
  abstract     = {{Frühere Studien haben empirisch offenbart, dass Fehlbenutzungen von kryptographischen APIs in Softwareanwendungen weitverbreitet sind. Dies geschieht vor allem, weil Software-Entwickler_innen aufgrund schlechten API-Designs und fehlenden Kryptographiewissens Probleme bekommen, wenn sie versuchen kryptographische Features zu implementieren. Die Literatur liefert mehrere Ansätze und Vorschläge diese Probleme zu lösen, aber alle scheitern schlussendlich auf die eine oder andere Weise daran die Anforderungen der Entwickler_innenzu erfüllen. Das Resultat ist eine insgesamt lückenhafte Landschaft verschiedener nur wenigkomplementärer Ansätze.In dieser Arbeit adressieren wir das Problem kryptographischer Fehlbenutzungen systematischer durch CogniCrypt. CogniCrypt integriert verschiedene Arten von Tool Supportin einen gemeinsamen Ansatz, der Entwickler_innen davon befreit wissen zu müssen, wie diese APIs benutzt werden müssen. Zentral für unseren Ansatz ist CrySL, eine Beschreibungssprache,die die kognitive Lücke zwischen Kryptographie-Expert_innen und Software-Entwickler_innenüberbrückt. CrySL ermöglicht es Kryptographie-Expert_innen zu spezifizeren, wie die APIs,die sie bereitstellen, richtig benutzt werden. Wir haben einen Compiler für CrySL implementiert, der es erlaubt auf CrySL-Spezifikationen aufbauenden Tool Support zu entwickeln. Wir haben weiterhin die statische Analyse CogniCrypt_SAST und den Code-Generator CogniCrypt_GEN entwickelt. Schlussendlich haben wir CogniCrypt prototypisch implementiert und diesen Prototyp in einem kontrollierten Experiment evaluiert.
}},
  author       = {{Krüger, Stefan}},
  publisher    = {{Universitaetsbibliothek Paderborn}},
  title        = {{{CogniCrypt -- The Secure Integration of Cryptographic Software}}},
  year         = {{2020}},
}

@inproceedings{20514,
  author       = {{Yigitbas, Enes}},
  booktitle    = {{ACM SIGWEB Newsletter}},
  publisher    = {{ACM}},
  title        = {{{Model-driven engineering and usability evaluation of self-adaptive user interfaces}}},
  doi          = {{https://doi.org/10.1145/3427478.3427480}},
  year         = {{2020}},
}

@inproceedings{20518,
  author       = {{Koch, Thorsten and Dziwok, Stefan and Holtmann, Jörg and Bodden, Eric}},
  booktitle    = {{ACM/IEEE 23rd International Conference on Model Driven Engineering Languages and Systems (MODELS ’20)}},
  publisher    = {{ACM}},
  title        = {{{Scenario-based Specification of Security Protocols and Transformation to Security Model Checkers}}},
  doi          = {{10.1145/3365438.3410946}},
  year         = {{2020}},
}

@phdthesis{20521,
  author       = {{Gerking, Christopher}},
  publisher    = {{Paderborn University}},
  title        = {{{Model-Driven Information Flow Security Engineering for Cyber-Physical Systems}}},
  doi          = {{10.17619/UNIPB/1-1033}},
  year         = {{2020}},
}

@inbook{20568,
  author       = {{Reinhold, Jannik and Koldewey, Christian and Dumitrescu, Roman}},
  booktitle    = {{Der Geschäftsmodell-Toolguide }},
  editor       = {{Buchholz, Birgit and Bürger, Matthias}},
  pages        = {{52--56}},
  publisher    = {{Campus Verlag}},
  title        = {{{GEMINI-Modellierungssprache für Wertschöpfungssysteme}}},
  year         = {{2020}},
}

@inbook{20570,
  author       = {{Koldewey, Christian and Reinhold, Jannik and Dumitrescu, Roman}},
  booktitle    = {{Der Geschäftsmodell-Toolguide}},
  editor       = {{Buchholz, Birgit and Bürger, Matthias}},
  pages        = {{61--66}},
  publisher    = {{Campus Verlag}},
  title        = {{{GEMINI-Geschäftsmodellmuster-Kartenset}}},
  year         = {{2020}},
}

@inbook{20571,
  author       = {{Koldewey, Christian and Reinhold, Jannik and Dumitrescu, Roman}},
  booktitle    = {{Der Geschäftsmodell-Toolguide}},
  editor       = {{Buchholz, Birgit and Bürger, Matthias}},
  pages        = {{106 -- 111}},
  publisher    = {{Campus Verlag}},
  title        = {{{Geschäftsmodellvalidierung}}},
  year         = {{2020}},
}

@inbook{20573,
  author       = {{Koldewey, Christian and Reinhold, Jannik and Dumitrescu, Roman}},
  booktitle    = {{Der Geschäftsmodell-Toolguide}},
  editor       = {{Buchholz, Birgit and Bürger, Matthias}},
  pages        = {{138 -- 143}},
  publisher    = {{Campus Verlag}},
  title        = {{{Geschäftsmodell-Roadmapping}}},
  year         = {{2020}},
}

@techreport{20712,
  author       = {{Schubert, Philipp and Bodden, Eric and Hermann, Ben}},
  title        = {{{Accelerating Static Call-Graph, Points-to and Data-Flow Analysis Through Persisted Summaries}}},
  year         = {{2020}},
}

@unpublished{20748,
  abstract     = {{On the circuit level, the design paradigm Approximate Computing seeks to trade off computational accuracy against a target metric, e.g., energy consumption. This trade-off is possible for many applications due to their inherent resiliency against inaccuracies.
In the past, several automated approximation frameworks have been presented, which either utilize designated approximation techniques or libraries to replace approximable circuit parts with inaccurate versions. The frameworks invoke a search algorithm to iteratively explore the search space of performance degraded circuits, and validate their quality individually. 
In this paper, we propose to reverse this procedure. Rather than exploring the search space, we delineate the approximate parts of the search space which are guaranteed to lead to valid approximate circuits. Our methodology is supported by formal verification and independent of approximation techniques. Eventually, the user is provided with quality bounds of the individual approximable circuit parts. Consequently, our approach guarantees that any approximate circuit which implements these parts within the determined quality constraints satisfies the global quality constraints, superseding a subsequent quality verification.
In our experimental results, we present the runtimes of our approach.}},
  author       = {{Witschen, Linus Matthias and Wiersema, Tobias and Platzner, Marco}},
  booktitle    = {{Fifth Workshop on Approximate Computing (AxC 2020)}},
  pages        = {{2}},
  title        = {{{Search Space Characterization for AxC Synthesis}}},
  year         = {{2020}},
}

@inproceedings{20750,
  author       = {{Lienen, Christian and Platzner, Marco and Rinner, Bernhard}},
  booktitle    = {{Proceedings of the 2020 International Conference on Field-Programmable Technology (FPT)}},
  title        = {{{ReconROS: Flexible Hardware Acceleration for ROS2 Applications}}},
  year         = {{2020}},
}

@inproceedings{20755,
  abstract     = {{We consider the problem of computing shortest paths in \emph{hybrid networks}, in which nodes can make use of different communication modes. For example, mobile phones may use ad-hoc connections via Bluetooth or Wi-Fi in addition to the cellular network to solve tasks more efficiently. Like in this case, the different communication modes may differ considerably in range, bandwidth, and flexibility. We build upon the model of Augustine et al. [SODA '20], which captures these differences by a \emph{local} and a \emph{global} mode. Specifically, the local edges model a fixed communication network in which $O(1)$ messages of size $O(\log n)$ can be sent over every edge in each synchronous round. The global edges form a clique, but nodes are only allowed to send and receive a total of at most $O(\log n)$ messages over global edges, which restricts the nodes to use these edges only very sparsely.

We demonstrate the power of hybrid networks by presenting algorithms to compute Single-Source Shortest Paths and the diameter very efficiently in \emph{sparse graphs}. Specifically, we present exact $O(\log n)$ time algorithms for cactus graphs (i.e., graphs in which each edge is contained in at most one cycle), and $3$-approximations for graphs that have at most $n + O(n^{1/3})$ edges and arboricity $O(\log n)$. For these graph classes, our algorithms provide exponentially faster solutions than the best known algorithms for general graphs in this model.
Beyond shortest paths, we also provide a variety of useful tools and techniques for hybrid networks, which may be of independent interest.
}},
  author       = {{Feldmann, Michael and Hinnenthal, Kristian and Scheideler, Christian}},
  booktitle    = {{Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS)}},
  publisher    = {{Schloss Dagstuhl - Leibniz-Zentrum für Informatik}},
  title        = {{{Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs}}},
  doi          = {{10.4230/LIPIcs.OPODIS.2020.31}},
  year         = {{2020}},
}

@misc{20820,
  author       = {{Thiele, Simon}},
  title        = {{{Implementing Machine Learning Functions as PYNQ FPGA Overlays}}},
  year         = {{2020}},
}

@misc{20821,
  author       = {{Jaganath, Vivek}},
  title        = {{{Extension and Evaluation of Python-based High-Level Synthesis Tool Flows}}},
  year         = {{2020}},
}

@article{20834,
  author       = {{Webb, Mary E and Fluck, Andrew and Magenheim, Johannes and Malyn-Smith, Joyce and Waters, Juliet and Deschênes , Michelle and Zagami, Jason}},
  journal      = {{Educational Technology Research and Development}},
  pages        = {{1--22}},
  publisher    = {{Springer}},
  title        = {{{Machine learning for human learners: opportunities, issues, tensions and threats}}},
  doi          = {{10.1007/s11423-020-09858-2}},
  year         = {{2020}},
}