@inproceedings{13142, author = {{Weidmann, Nils and Anjorin, Anthony and Fritsche, Lars and Varró, Gergely and Schürr, Andy and Leblebici, Erhan}}, booktitle = {{Proceedings of the 8th International Workshop on Bidirectional Transformations co-located with the Philadelphia Logic Week, Bx@PLW 2019}}, editor = {{Cheney, James and Ko, Hsiang-Shang}}, location = {{Philadelphia, PA, USA}}, pages = {{45--55}}, publisher = {{CEUR-WS.org}}, title = {{{Incremental Bidirectional Model Transformation with eMoflon::IBeX}}}, year = {{2019}}, } @inproceedings{13144, author = {{El Baff, Roxanne and Wachsmuth, Henning and Al-Khatib, Khalid and Stede, Manfred and Stein, Benno}}, booktitle = {{Proceedings of the 12th International Conference on Natural Language Generation}}, location = {{Tokyo, Japan}}, pages = {{54--64}}, publisher = {{Association for Computational Linguistics}}, title = {{{Computational Argumentation Synthesis as a Language Modeling Task}}}, year = {{2019}}, } @inproceedings{13182, abstract = {{We consider congestion control in peer-to-peer distributed systems. The problem can be reduced to the following scenario: Consider a set $V$ of $n$ peers (called \emph{clients} in this paper) that want to send messages to a fixed common peer (called \emph{server} in this paper). We assume that each client $v \in V$ sends a message with probability $p(v) \in [0,1)$ and the server has a capacity of $\sigma \in \mathbb{N}$, i.e., it can recieve at most $\sigma$ messages per round and excess messages are dropped. The server can modify these probabilities when clients send messages. Ideally, we wish to converge to a state with $\sum p(v) = \sigma$ and $p(v) = p(w)$ for all $v,w \in V$. We propose a \emph{loosely} self-stabilizing protocol with a slightly relaxed legitimate state. Our protocol lets the system converge from \emph{any} initial state to a state where $\sum p(v) \in \left[\sigma \pm \epsilon\right]$ and $|p(v)-p(w)| \in O(\frac{1}{n})$. This property is then maintained for $\Omega(n^{\mathfrak{c}})$ rounds in expectation. In particular, the initial client probabilities and server variables are not necessarily well-defined, i.e., they may have arbitrary values. Our protocol uses only $O(W + \log n)$ bits of memory where $W$ is length of node identifiers, making it very lightweight. Finally we state a lower bound on the convergence time an see that our protocol performs asymptotically optimal (up to some polylogarithmic factor). }}, author = {{Feldmann, Michael and Götte, Thorsten and Scheideler, Christian}}, booktitle = {{Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}}, pages = {{149--164}}, publisher = {{Springer, Cham}}, title = {{{A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory}}}, doi = {{https://doi.org/10.1007/978-3-030-34992-9_13}}, year = {{2019}}, } @inproceedings{13261, author = {{Wolters, Dennis and Kirchhoff, Jonas and Engels, Gregor}}, booktitle = {{Service-Oriented Computing – ICSOC 2019 Workshops}}, editor = {{Yangui, Sami and Bouguettaya, Athman and Xue, Xiao and Faci, Noura and Gaaloul, Walid and Yu, Qi and Zhou, Zhangbing and Hernandez, Nathalie and Nakagawa, Elisa Y.}}, pages = {{30--41}}, publisher = {{Springer}}, title = {{{Specifying Web Interfaces for Command-line Applications Based on OpenAPI}}}, doi = {{10.1007/978-3-030-45989-5\_3}}, volume = {{12019}}, year = {{2019}}, } @inproceedings{13292, abstract = {{Building on 5G and network function virtualization (NFV), smart manufacturing has the potential to drastically increase productivity, reduce cost, and introduce novel, flexible manufacturing services. Current work mostly focuses on high-level scenarios or emulation-based prototype deployments. Extending our previous work, we showcase one of the first cloud-native 5G verticals focusing on the deployment of smart manufacturing use cases on production infrastructure. In particular, we use the 5GTANGO service platform to deploy our developed network services on Kubernetes. For this demo, we implemented a series of cloud-native virtualized network functions (VNFs) and created suitable service descriptors. Their light-weight, stateless deployment on Kubernetes enables quick instantiation, scalability, and robustness.}}, author = {{Schneider, Stefan Balthasar and Peuster, Manuel and Hannemann, Kai and Behnke, Daniel and Müller, Marcel and Bök, Patrick-Benjamin and Karl, Holger}}, booktitle = {{IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN) Demo Track}}, keywords = {{5G, NFV, Smart Manufacturing, Cloud-Native, Kubernetes}}, location = {{Dallas, TX, USA}}, publisher = {{IEEE}}, title = {{{"Producing Cloud-Native": Smart Manufacturing Use Cases on Kubernetes}}}, year = {{2019}}, } @article{10011, author = {{Fränzle, Martin and Kapur, Deepak and Wehrheim, Heike and Zhan, Naijun}}, journal = {{Formal Asp. Comput.}}, number = {{1}}, pages = {{1}}, title = {{{Editorial}}}, doi = {{10.1007/s00165-018-00477-6}}, volume = {{31}}, year = {{2019}}, } @inproceedings{10091, author = {{König, Jürgen and Wehrheim, Heike}}, booktitle = {{{NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings}}, editor = {{M. Badger, Julia and Yvonne Rozier, Kristin}}, pages = {{263--279}}, publisher = {{Springer}}, title = {{{Data Independence for Software Transactional Memory}}}, doi = {{10.1007/978-3-030-20652-9\_18}}, volume = {{11460}}, year = {{2019}}, } @inproceedings{10092, author = {{Doherty, Simon and Dongol, Brijesh and Wehrheim, Heike and Derrick, John}}, booktitle = {{Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019}}, editor = {{K. Hollingsworth, Jeffrey and Keidar, Idit}}, pages = {{355--365}}, publisher = {{{ACM}}}, title = {{{Verifying C11 programs operationally}}}, doi = {{10.1145/3293883.3295702}}, year = {{2019}}, } @inproceedings{10093, author = {{Beyer, Dirk and Jakobs, Marie-Christine and Lemberger, Thomas and Wehrheim, Heike}}, booktitle = {{Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019}}, editor = {{Becker, Steffen and Bogicevic, Ivan and Herzwurm, Georg and Wagner, Stefan}}, pages = {{151----152}}, publisher = {{GI}}, title = {{{Combining Verifiers in Conditional Model Checking via Reducers}}}, doi = {{10.18420/se2019-46}}, volume = {{P-292}}, year = {{2019}}, } @inproceedings{10094, author = {{Sharma, Arnab and Wehrheim, Heike}}, booktitle = {{Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019}}, editor = {{Becker, Steffen and Bogicevic, Ivan and Herzwurm, Georg and Wagner, Stefan}}, pages = {{157--158}}, publisher = {{{GI}}}, title = {{{Testing Balancedness of ML Algorithms}}}, doi = {{10.18420/se2019-48}}, volume = {{{P-292}}}, year = {{2019}}, } @inproceedings{10095, author = {{Richter, Cedric and Wehrheim, Heike}}, 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}}}, editor = {{Beyer, Dirk and Huisman, Marieke and Kordon, Fabrice and Steffen, Bernhard}}, pages = {{229--233}}, publisher = {{Springer}}, title = {{{PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution)}}}, doi = {{10.1007/978-3-030-17502-3_19}}, volume = {{11429}}, year = {{2019}}, } @misc{10105, author = {{Haltermann, Jan}}, publisher = {{Universität Paderborn}}, title = {{{Analyzing Data Usage in Array Programs}}}, year = {{2019}}, } @inproceedings{10232, abstract = {{Existing tools for automated machine learning, such as Auto-WEKA, TPOT, auto-sklearn, and more recently ML-Plan, have shown impressive results for the tasks of single-label classification and regression. Yet, there is only little work on other types of machine learning problems so far. In particular, there is almost no work on automating the engineering of machine learning solutions for multi-label classification (MLC). We show how the scope of ML-Plan, an AutoML-tool for multi-class classification, can be extended towards MLC using MEKA, which is a multi-label extension of the well-known Java library WEKA. The resulting approach recursively refines MEKA's multi-label classifiers, nesting other multi-label classifiers for meta algorithms and single-label classifiers provided by WEKA as base learners. In our evaluation, we find that the proposed approach yields strong results and performs significantly better than a set of baselines we compare with.}}, author = {{Wever, Marcel Dominik and Mohr, Felix and Tornede, Alexander and Hüllermeier, Eyke}}, location = {{Long Beach, CA, USA}}, title = {{{Automating Multi-Label Classification Extending ML-Plan}}}, year = {{2019}}, } @misc{10271, author = {{N., N.}}, publisher = {{Universität Paderborn}}, title = {{{Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves}}}, year = {{2019}}, } @inproceedings{10281, abstract = {{Competing firms tend to select similar locations for their stores. This phenomenon, called the principle of minimum differentiation, was captured by Hotelling with a landmark model of spatial competition but is still the object of an ongoing scientific debate. Although consistently observed in practice, many more realistic variants of Hotelling's model fail to support minimum differentiation or do not have pure equilibria at all. In particular, it was recently proven for a generalized model which incorporates negative network externalities and which contains Hotelling's model and classical selfish load balancing as special cases, that the unique equilibria do not adhere to minimum differentiation. Furthermore, it was shown that for a significant parameter range pure equilibria do not exist. We derive a sharp contrast to these previous results by investigating Hotelling's model with negative network externalities from an entirely new angle: approximate pure subgame perfect equilibria. This approach allows us to prove analytically and via agent-based simulations that approximate equilibria having good approximation guarantees and that adhere to minimum differentiation exist for the full parameter range of the model. Moreover, we show that the obtained approximate equilibria have high social welfare.}}, author = {{Feldotto, Matthias and Lenzner, Pascal and Molitor, Louise and Skopalik, Alexander}}, booktitle = {{Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems}}, location = {{Montreal QC, Canada}}, pages = {{1949----1951}}, publisher = {{International Foundation for Autonomous Agents and Multiagent Systems}}, title = {{{ From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation}}}, year = {{2019}}, } @inproceedings{10284, abstract = {{We study text reuse related to Wikipedia at scale by compiling the first corpus of text reuse cases within Wikipedia as well as without (i.e., reuse of Wikipedia text in a sample of the Common Crawl). To discover reuse beyond verbatim copy and paste, we employ state-of-the-art text reuse detection technology, scaling it for the first time to process the entire Wikipedia as part of a distributed retrieval pipeline. We further report on a pilot analysis of the 100 million reuse cases inside, and the 1.6 million reuse cases outside Wikipedia that we discovered. Text reuse inside Wikipedia gives rise to new tasks such as article template induction, fixing quality flaws, or complementing Wikipedia's ontology. Text reuse outside Wikipedia yields a tangible metric for the emerging field of quantifying Wikipedia's influence on the web. To foster future research into these tasks, and for reproducibility's sake, the Wikipedia text reuse corpus and the retrieval pipeline are made freely available.}}, author = {{Alshomary, Milad and Völske, Michael and Licht, Tristan and Wachsmuth, Henning and Stein, Benno and Hagen, Matthias and Potthast, Martin}}, booktitle = {{Advances in Information Retrieval}}, editor = {{Azzopardi, Leif and Stein, Benno and Fuhr, Norbert and Mayr, Philipp and Hauff, Claudia and Hiemstra, Djoerd}}, isbn = {{978-3-030-15712-8}}, pages = {{747--754}}, publisher = {{Springer International Publishing}}, title = {{{Wikipedia Text Reuse: Within and Without}}}, year = {{2019}}, } @misc{10306, author = {{Porzenheim, Laurens Alexander}}, title = {{{Post-Quantum Secure Group Signatures}}}, year = {{2019}}, } @article{10325, author = {{Peuster, Manuel and Marchetti, Michael and García de Blas, Gerardo and Karl, Holger}}, issn = {{1687-1499}}, journal = {{EURASIP Journal on Wireless Communications and Networking}}, publisher = {{Springer}}, title = {{{Automated testing of NFV orchestrators against carrier-grade multi-PoP scenarios using emulation-based smoke testing}}}, doi = {{10.1186/s13638-019-1493-2}}, year = {{2019}}, } @misc{10344, author = {{Pukrop, Simon}}, publisher = {{Universität Paderborn}}, title = {{{Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine}}}, year = {{2019}}, } @inproceedings{13554, abstract = {{We propose a novel personal reputation system for cross-platform reputation. We observe that, in certain usage scenarios, e.g. crowd work, the rater anonymity property typically imposed on reputation systems is not necessary. Instead, we propose a relaxed notion of rater anonymity that is more applicable in the crowd work scenario. This allows us to construct a secure personal reputation system from simple cryptographic primitives.}}, author = {{Blömer, Johannes and Löken, Nils}}, booktitle = {{Security and Trust Management, STM 2019}}, title = {{{Personal Cross-Platform Reputation}}}, doi = {{10.1007/978-3-030-31511-5_9}}, volume = {{11738}}, year = {{2019}}, }