@inproceedings{20726,
  author       = {{Falzon, Kevin and Bodden, Eric}},
  booktitle    = {{Principles of Security and Trust: 5th International Conference, POST 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2--8, 2016, Proceedings}},
  editor       = {{Piessens, Frank and Vigan'o, Luca}},
  isbn         = {{978-3-662-49635-0}},
  pages        = {{116--138}},
  publisher    = {{Springer Berlin Heidelberg}},
  title        = {{{Towards a Comprehensive Model of Isolation for Mitigating Illicit Channels}}},
  doi          = {{10.1007/978-3-662-49635-0_7}},
  year         = {{2016}},
}

@inproceedings{20727,
  author       = {{Rasthofer, Siegfried and Arzt, Steven and Miltenberger, Marc and Bodden, Eric}},
  booktitle    = {{Network and Distributed System Security Symposium (NDSS)}},
  keywords     = {{ATTRACT, ITSECWEBSITE}},
  title        = {{{Harvesting Runtime Values in Android Applications That Feature Anti-Analysis Techniques}}},
  year         = {{2016}},
}

@inproceedings{20728,
  author       = {{Nadi, Sarah and Krüger, Stefan and Mezini, Mira and Bodden, Eric}},
  booktitle    = {{International Conference for Software Engineering (ICSE)}},
  keywords     = {{CROSSING, ITSECWEBSITE}},
  pages        = {{935--946}},
  title        = {{{Jumping Through Hoops: Why do Java Developers Struggle With Cryptography APIs?}}},
  year         = {{2016}},
}

@inproceedings{20729,
  author       = {{Arzt, Steven and Bodden, Eric}},
  booktitle    = {{International Conference for Software Engineering (ICSE)}},
  keywords     = {{ITSECWEBSITE}},
  title        = {{{StubDroid: Automatic Inference of Precise Data-flow Summaries for the Android Framework}}},
  year         = {{2016}},
}

@inproceedings{20730,
  author       = {{Eling, N. and Rasthofer, S. and Kolhagen, M. and Bodden, Eric and Buxmann, P.}},
  booktitle    = {{2016 49th Hawaii International Conference on System Sciences (HICSS)}},
  issn         = {{1530-1605}},
  pages        = {{3666--3675}},
  title        = {{{Investigating Users' Reaction to Fine-Grained Data Requests: A Market Experiment}}},
  doi          = {{10.1109/HICSS.2016.458}},
  year         = {{2016}},
}

@inproceedings{208,
  abstract     = {{This paper presents a new framework for constructing fully CCA-secure predicate encryption schemes from pair encoding schemes. Our construction is the first in the context of predicate encryption which uses the technique of well-formedness proofs known from public key encryption. The resulting constructions are simpler and more efficient compared to the schemes achieved using known generic transformations from CPA-secure to CCA-secure schemes. The reduction costs of our framework are comparable to the reduction costs of the underlying CPA-secure framework. We achieve this last result by applying the dual system encryption methodology in a novel way.}},
  author       = {{Blömer, Johannes and Liske, Gennadij}},
  booktitle    = {{Proceedings of the CT-RSA 2016}},
  pages        = {{431--447}},
  title        = {{{Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes}}},
  doi          = {{10.1007/978-3-319-29485-8_25}},
  year         = {{2016}},
}

@techreport{20822,
  abstract     = {{Several examples of mechatronic systems can be found nowadays in modern cars, production systems, and medical technology. Day by day, the number of innovative functionalities in such mechatronic systems is increasing. These functionalities are realized with complex software. Such software exhibits hard real-time, safety requirements. The adherence to these requirements must be thoroughly analyzed and verified. Moreover, to obtain a significant increment in the reliability, performance, and efficiency of such software, it needs to maintain the self-adaptation of its properties. In order to develop such systems with a high quality and within a short time, we need a systematic and consistent design method. For this purpose, the software engineering group at the University of Paderborn and the Fraunhofer IEM in Paderborn propose the MechatronicUML method. This method provides a comprehensive model-driven process support, that starts from requirements and reaches the executable software after passing through several design and analysis steps. This process improves the comprehension during development and makes complex systems manageable. MechatronicUML emphasizes mainly on: (1) modeling and (formal) verification of reconfigurable software architectures, (2) the coordination among system components in such architectures, and (3) the integration of discrete software events with the continuous behavior of control devices.}},
  author       = {{Dziwok, Stefan and Pohlmann, Uwe and Piskachev, Goran and Schubert, David and Thiele, Sebastian and Gerking, Christopher}},
  title        = {{{The MechatronicUML Design Method: Process and Language for Platform-Independent Modeling}}},
  year         = {{2016}},
}

@techreport{20823,
  abstract     = {{In this technical report, we present the MechatronicUML requirements engineering method. The method encompasses a process and a scenario-based modeling language for the documentation and analysis of requirements on the message-based interaction behavior of software-intensive systems. The modeling language uses a scenario notation based on Modal Sequence Diagrams (MSDs), which borrows concepts of UML Interactions as well as of Live Sequence Charts. Furthermore, we introduce the so-called Emergency Braking & Evasion System (EBEAS) as a running example, which is based on current and upcoming real-world driver assistance systems. }},
  author       = {{Holtmann, Jörg and Fockel, Markus and Koch, Thorsten and Schmelter, David and Brenner, Christian and Bernijazov, Ruslan and Sander, Marcel}},
  title        = {{{The MechatronicUML Requirements Engineering Method: Process and Language}}},
  doi          = {{10.13140/RG.2.2.33223.29606}},
  year         = {{2016}},
}

@inproceedings{20825,
  abstract     = {{Das Systemmodell ist der Kern des Model-Based Systems Engineering (MBSE). Während jedoch im Systems Engineering dem Zusammenspiel von Produkt und Projekt ein hoher Stellenwert beigemessen wird, liegt der Fokus im MBSE noch sehr stark auf technischen Prozessen. Im Hinblick auf die Idee des Systemmodells als zentrale Datenquelle sollten auch Stakeholder jenseits der direkten Entwicklungsaktivitäten das Systemmodell entsprechend nutzen können und davon profitieren. Dazu wird ein Demonstrator vorgestellt, welcher die Anwendung einer Komplexitätsanalyse auf Basis des Systemmodells mechatronischer Systeme stellvertretend für Methoden in Sinne der technischen Managementprozesse der ISO/IEC 15288 aufzeigt. Grundlage des Demonstrators bildet das Systemmodell eines Pedelecs. Die darin modellierten Strukturen dienen als Input für die Komplexitätsanalyse. Über die automatisierte Anwendung der Komplexitätsanalyse ergibt sich als Output ein Portfolio, das die Komplexität der funktionserfüllenden Komponenten mit der Bewertung der Funktionalität in Beziehung setzt und somit eine Beurteilung und entsprechende Handlungsempfehlungen der Komponenten ermöglicht.}},
  author       = {{Greinert, Matthias and Tschirner, Christian and Holtmann, Jörg}},
  booktitle    = {{Tag des Systems Engineering 2016}},
  pages        = {{77--86}},
  publisher    = {{Gesellschaft f{\"u}r Systems Engineering e.V.}},
  title        = {{{Anwendung von Methoden der Produktentstehung auf Basis des Systemmodells mechatronischer Systeme}}},
  doi          = {{10.3139/9783446451414.008}},
  year         = {{2016}},
}

@inproceedings{20830,
  author       = {{Schubert, David and Heinzemann, Christian and Gerking, Christopher}},
  booktitle    = {{Proceedings of the 19th international ACM Sigsoft symposium on component-based software engineering}},
  publisher    = {{ACM}},
  title        = {{{Towards Safe Execution of Reconfigurations in Cyber-Physical Systems}}},
  year         = {{2016}},
}

@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}},
}