@inproceedings{209,
  abstract     = {{We study a new class of games which generalizes congestion games and its bottleneck variant. We introduce congestion games with mixed objectives to model network scenarios in which players seek to optimize for latency and bandwidths alike. We characterize the existence of pure Nash equilibria (PNE) and the convergence of improvement dynamics. For games that do not possess PNE we give bounds on the approximation ratio of approximate pure Nash equilibria.}},
  author       = {{Feldotto, Matthias and Leder, Lennart and Skopalik, Alexander}},
  booktitle    = {{Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}},
  pages        = {{655----669}},
  title        = {{{Congestion Games with Mixed Objectives}}},
  doi          = {{10.1007/978-3-319-48749-6_47}},
  year         = {{2016}},
}

@misc{18025,
  author       = {{Heuchler, Sebastian}},
  title        = {{{Nibbler: Implementing a Turing machine to simulate the Busy Beaver problem}}},
  year         = {{2016}},
}

@article{1835,
  author       = {{Schmid, Stefan and Avin, Chen and Scheideler, Christian and Borokhovich, Michael and Haeupler, Bernhard and Lotker, Zvi}},
  journal      = {{IEEE/ACM Trans. Netw.}},
  number       = {{3}},
  pages        = {{1421----1433}},
  title        = {{{SplayNet: Towards Locally Self-Adjusting Networks}}},
  doi          = {{10.1109/TNET.2015.2410313}},
  year         = {{2016}},
}

@inproceedings{1836,
  author       = {{Derakhshandeh, Zahra and Gmyr, Robert and Porter, Alexandra and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik}},
  booktitle    = {{DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings}},
  pages        = {{148----164}},
  title        = {{{On the Runtime of Universal Coating for Programmable Matter}}},
  doi          = {{10.1007/978-3-319-43994-5_10}},
  volume       = {{9818}},
  year         = {{2016}},
}

@inproceedings{1837,
  author       = {{Derakhshandeh, Zahra and Gmyr, Robert and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik}},
  booktitle    = {{Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016}},
  pages        = {{289----299}},
  publisher    = {{ACM}},
  title        = {{{Universal Shape Formation for Programmable Matter}}},
  doi          = {{10.1145/2935764.2935784}},
  year         = {{2016}},
}

@inproceedings{184,
  abstract     = {{In this paper, we propose a framework for a class of learning problems that we refer to as “learning to aggregate”. Roughly, learning-to-aggregate problems are supervised machine learning problems, in which instances are represented in the form of a composition of a (variable) number on constituents; such compositions are associated with an evaluation, score, or label, which is the target of the prediction task, and which can presumably be modeled in the form of a suitable aggregation of the properties of its constituents. Our learning-to-aggregate framework establishes a close connection between machine learning and a branch of mathematics devoted to the systematic study of aggregation functions. We specifically focus on a class of functions called uninorms, which combine conjunctive and disjunctive modes of aggregation. Experimental results for a corresponding model are presented for a review data set, for which the aggregation problem consists of combining different reviewer opinions about a paper into an overall decision of acceptance or rejection.}},
  author       = {{Melnikov, Vitaly and Hüllermeier, Eyke}},
  booktitle    = {{Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases (ECML/PKDD 2016)}},
  pages        = {{756--771}},
  title        = {{{Learning to Aggregate Using Uninorms}}},
  doi          = {{10.1007/978-3-319-46227-1_47}},
  year         = {{2016}},
}

@proceedings{1844,
  editor       = {{Scheideler, Christian and Gilbert, Seth}},
  isbn         = {{978-1-4503-4210-0}},
  title        = {{{Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016}}},
  doi          = {{10.1145/2935764}},
  year         = {{2016}},
}

@inbook{1845,
  author       = {{W. Richa, Andrea and Scheideler, Christian}},
  booktitle    = {{Encyclopedia of Algorithms}},
  pages        = {{999----1002}},
  title        = {{{Jamming-Resistant MAC Protocols for Wireless Networks}}},
  doi          = {{10.1007/978-1-4939-2864-4_593}},
  year         = {{2016}},
}

@inproceedings{186,
  abstract     = {{Software verification is an established method to ensure software safety. Nevertheless, verification still often fails, either because it consumes too much resources, e.g., time or memory, or the technique is not mature enough to verify the property. Often then discarding the partial verification, the validation process proceeds with techniques like testing.To enable standard testing to profit from previous, partial verification, we use a summary of the verification effort to simplify the program for subsequent testing. Our techniques use this summary to construct a residual program which only contains program paths with unproven assertions. Afterwards, the residual program can be used with standard testing tools.Our first experiments show that testing profits from the partial verification.The test effort is reduced and combined verification and testing is faster than a complete verification.}},
  author       = {{Czech, Mike and Jakobs, Marie-Christine and Wehrheim, Heike}},
  booktitle    = {{Software Engineering 2016}},
  editor       = {{Jens Knoop, Uwe Zdun}},
  pages        = {{17--18}},
  title        = {{{Just test what you cannot verify!}}},
  year         = {{2016}},
}

@techreport{221,
  author       = {{Platenius, Marie Christin and Josifovska, Klementina and van Rooijen, Lorijn and Arifulina, Svetlana and Becker, Matthias and Engels, Gregor and Schäfer, Wilhelm}},
  publisher    = {{Universität Paderborn}},
  title        = {{{An Overview of Service Specification Language and Matching in On-The-Fly Computing (v0.3)}}},
  year         = {{2016}},
}

@article{222,
  abstract     = {{Virtual field programmable gate arrays (FPGA) are overlay architectures realized on top of physical FPGAs. They are proposed to enhance or abstract away from the physical FPGA for experimenting with novel architectures and design tool flows. In this paper, we present an embedding of a ZUMA-based virtual FPGA fabric into a complete configurable system-on-chip. Such an embedding is required to fully harness the potential of virtual FPGAs, in particular to give the virtual circuits access to main memory and operating system services, and to enable a concurrent operation of virtualized and non-virtualized circuitry. We discuss our extension to ZUMA and its embedding into the ReconOS operating system for hardware/software systems. Furthermore, we present an open source tool flow to synthesize configurations for the virtual FPGA, along with an analysis of the area and delay overheads involved.}},
  author       = {{Wiersema, Tobias and Bockhorn, Arne and Platzner, Marco}},
  journal      = {{Computers & Electrical Engineering}},
  pages        = {{112----122}},
  publisher    = {{Elsevier}},
  title        = {{{An Architecture and Design Tool Flow for Embedding a Virtual FPGA into a Reconfigurable System-on-Chip}}},
  doi          = {{10.1016/j.compeleceng.2016.04.005}},
  year         = {{2016}},
}

@misc{223,
  abstract     = {{We consider the problem of aggregation in overlay networks. We use a synchronous time model in which each node has polylogarithmic memory and can send at most a polylogarithmic number of messages per round. We investigate how to quickly compute the result of an aggregate functionf over elements that are distributed among the nodes of the network such that the result is eventually known by a selected root node. We show how to compute distributive aggregate functions such as SUM, MAX, and OR in time $O(\log n / \log\log n)$ using a tree that is created in a pre-processing phase. If only a polylogarithmic number of data items need to be aggregated, we show how to compute the result in time $O(\sqrt{\log n / \log\log n})$. Furthermore, we show how to compute holistic aggregate functions such as DISTINCT, SMALLEST(k) and MODE(k) in time $O(\log n / \log\log n)$. Finally, we show a lower bound of $\Omega(\sqrt{\log n / \log\log n})$ for deterministic algorithms that compute any of the aggregate functions in the scope of the thesis.}},
  author       = {{Hinnenthal, Kristian}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Aggregation in Overlay Networks}}},
  year         = {{2016}},
}

@inproceedings{224,
  abstract     = {{In modern software development, paradigms like component-based software engineering (CBSE) and service-oriented architectures (SOA) emphasize the construction of large software systems out of existing components or services. Therein, a service is a self-contained piece of software, which adheres to a specified interface. In a model-based software design, this interface constitutes our sole knowledge of the service at design time, while service implementations are not available. Therefore, correctness checks or detection of potential errors in service compositions has to be carried out without the possibility of executing services. This challenges the usage of standard software error localization techniques for service compositions. In this paper, we review state-of-the-art approaches for error localization of software and discuss their applicability to service compositions.}},
  author       = {{Krämer, Julia and Wehrheim, Heike}},
  booktitle    = {{Proceedings of the 5th European Conference on Service-Oriented and Cloud Computing (ESOCC 2016)}},
  pages        = {{248----262}},
  title        = {{{A short survey on using software error localization for service compositions}}},
  doi          = {{10.1007/978-3-319-44482-6_16}},
  year         = {{2016}},
}

@inproceedings{226,
  abstract     = {{Error detection, localization and correction are time-intensive tasks in software development, but crucial to deliver functionally correct products. Thus, automated approaches to these tasks have been intensively studied for standard software systems. For model-based software systems, the situation is different. While error detection is still well-studied, error localization and correction is a less-studied domain. In this paper, we examine error localization and correction for models of service compositions. Based on formal definitions of error and correction in this context, we show that the classical approach of error localization and correction, i.e. first determining a set of suspicious statements and then proposing changes to these statements, is ineffective in our context. In fact, it lessens the chance to succeed in finding a correction at all.In this paper, we introduce correction proposal as a novel approach on error correction in service compositions integrating error localization and correction in one combined step. In addition, we provide an algorithm to compute such correction proposals automatically.}},
  author       = {{Krämer, Julia and Wehrheim, Heike}},
  booktitle    = {{Proceedings of the 1st International Workshop on Formal to Practical Software Verification and Composition (VeryComp 2016)}},
  pages        = {{445----457}},
  title        = {{{A Formal Approach to Error Localization and Correction in Service Compositions}}},
  doi          = {{10.1007/978-3-319-50230-4_35}},
  year         = {{2016}},
}

@inproceedings{227,
  abstract     = {{Information flow analysis studies the flow of data between program entities (e.g. variables), where the allowed flow is specified via security policies. Typical information flow analyses compute a conservative (over-)approximation of the flows in a program. Such an analysis may thus signal non-existing violations of the security policy.In this paper, we propose a new technique for inspecting the reported violations (counterexamples) for spuriousity. Similar to counterexample-guided-abstraction-refinement (CEGAR) in software verification, we use the result of this inspection to improve the next round of the analysis. We prove soundness of this scheme.}},
  author       = {{Töws, Manuel and Wehrheim, Heike}},
  booktitle    = {{Proceedings of the 18th International Conference on Formal Engineering Methods (ICFEM 2016)}},
  pages        = {{466----483}},
  title        = {{{A CEGAR Scheme for Information Flow Analysis}}},
  doi          = {{10.1007/978-3-319-47846-3_29}},
  year         = {{2016}},
}

@inproceedings{22870,
  author       = {{Röltgen, Daniel and Anacker, Harald and Dumitrescu, Roman}},
  booktitle    = {{VDE Kongress 2016 Internet of Things, Mannheim, Deutschland, 7. - 8. Nov. 2016}},
  title        = {{{Einsatz- und Nutzenpotentiale von Augmented Reality im Kontext von Industrie 4.0}}},
  year         = {{2016}},
}

@inproceedings{22871,
  author       = {{Falkowski, Tommy and Fechtelpeter, Christian and Peitz, Christoph and Kühn, Arno and Dumitrescu, Roman}},
  booktitle    = {{VDE Kongress 2016, 7. - 8. Nov. 2016}},
  title        = {{{ Einsatz von Leuchten zur Standortbestimmung in der Produktion}}},
  year         = {{2016}},
}

@inproceedings{22872,
  author       = {{Westermann, Matthias and Anacker, Harald and Dumitrescu, Roman and Czaja, Anja Maria}},
  booktitle    = {{2nd IEEE International Symposium on Systems Engineering 2016, Edinburgh, Scotland, 4. - 5. Okt. 2016}},
  title        = {{{Reference Architecture and Maturity Levels for Cyber-Physical Systems}}},
  year         = {{2016}},
}

@inproceedings{22873,
  author       = {{Fechtelpeter, Christian and Jürgenhake, Christoph and Dumitrescu, Roman and Mager, Thomas and Fritz, Karl-Peter and Grötzinger, Tobias and Müller, Hagen and Wild, Paul and Zimmermann, Andre}},
  booktitle    = {{12th International Congress on Molded Interconnect Devices, Conference Proceedings , 28. - 30. Sep. 2016}},
  title        = {{{Reliability in MID - barriers, potentials, fields of action}}},
  year         = {{2016}},
}

@inproceedings{22874,
  author       = {{Jürgenhake, Christoph and Falkowski, Tommy and Dumitrescu, Roman}},
  booktitle    = {{12th International Congress on Molded Interconnect Devices, Würzburg, 28. - 30. Sep. 2016}},
  title        = {{{Classification of MID-prototypes}}},
  year         = {{2016}},
}