@inbook{7561, author = {{Engels, Gregor and W. Maier, Günter and Ötting, Sonja and Steffen, Eckhard and Teetz, Alexander}}, booktitle = {{Zukunft der Arbeit: Eine praxisnahe Betrachtung}}, editor = {{Wischmann, Steffen}}, pages = {{12}}, publisher = {{Springer}}, title = {{{Gerechtigkeit in flexiblen Arbeits- und Managementprozessen}}}, year = {{2016}}, } @phdthesis{7567, author = {{Grieger, Marvin}}, publisher = {{Paderborn University}}, title = {{{Model-Driven Software Modernization: Concept-Based Engineering of Situation-Specific Methods}}}, year = {{2016}}, } @inproceedings{8494, author = {{Derakhshanmanesh , Mahdi and Grieger, Marvin }}, booktitle = {{Gemeinsamer Tagungsband der Workshops der Tagung Software Engineering 2016 (SE 2016)}}, pages = {{142--147}}, publisher = {{CEUR Workshop Proceedings}}, title = {{{Model-Integrating Microservices: A Vision Paper}}}, volume = {{1559}}, year = {{2016}}, } @inproceedings{985, author = {{v. Rossem, S. and Tavernier, W. and Peuster, Manuel and Colle, D. and Pickavet, M. and Demeester, P.}}, booktitle = {{Proc. IEEE Conference on Network Function Virtualization and Software Defined Network (NFV-SDN), Demo Track}}, title = {{{Monitoring and debugging using an SDK for NFV-powered telecom applications}}}, year = {{2016}}, } @inproceedings{5205, author = {{Späth, Johannes and Nguyen Quang Do, Lisa and Ali, Karim and Bodden, Eric}}, booktitle = {{European Conference on Object-Oriented Programming (ECOOP)}}, keywords = {{ATTRACT, ITSECWEBSITE}}, title = {{{Boomerang: Demand-Driven Flow- and Context-Sensitive Pointer Analysis for Java}}}, year = {{2016}}, } @misc{5406, author = {{Bülling, Jonas}}, title = {{{Parallelisierung von Algorithmen zur IR-Luftbildanalyse von Laubholzmischbeständen zur Verifizierung der Ausbreitung von Eichenkomplexschäden}}}, year = {{2016}}, } @misc{5407, author = {{Koepe, Jörn}}, publisher = {{Universität Paderborn}}, title = {{{Price-Based Allocation Games}}}, year = {{2016}}, } @misc{5418, author = {{Tölke, Christian}}, publisher = {{Universität Paderborn}}, title = {{{Sicherheit von hybriden FPGA-Systemen in der industriellen Automatisierungstechnik -- Anforderungen und Umsetzung}}}, year = {{2016}}, } @misc{5420, author = {{Wüllrich, Gunnar}}, publisher = {{Universität Paderborn}}, title = {{{Dynamic OpenCL Task Scheduling for Energy and Performance in a Heterogeneous Environment}}}, year = {{2016}}, } @article{5446, author = {{Jager, Tibor and Rupp, Andy}}, issn = {{2299-0984}}, journal = {{Proceedings on Privacy Enhancing Technologies}}, number = {{3}}, pages = {{62--82}}, publisher = {{Walter de Gruyter GmbH}}, title = {{{Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way}}}, doi = {{10.1515/popets-2016-0016}}, volume = {{2016}}, year = {{2016}}, } @article{6736, author = {{Böttcher, Stefan and Hartel, Rita and Wolters, Dennis}}, issn = {{0306-4379}}, journal = {{Information Systems}}, pages = {{198--213}}, publisher = {{Elsevier BV}}, title = {{{S2CX: From relational data via SQL/XML to (Un-)Compressed XML}}}, doi = {{10.1016/j.is.2015.09.011}}, volume = {{56}}, year = {{2016}}, } @inproceedings{6739, author = {{Wolters, Dennis and Gerth, Christian and Engels, Gregor}}, booktitle = {{Proceedings of the CAiSE'18 Forum at the 28th International Conference on Advanced Information Systems Engineering (CAiSE'16)}}, pages = {{89--96}}, publisher = {{CEUR-WS.org}}, title = {{{Modeling Cross-Device Systems with Use Case Diagrams}}}, volume = {{1612}}, year = {{2016}}, } @article{6766, author = {{Jovanovikj, Ivan and Güldali, Baris and Grieger, Marvin}}, journal = {{Softwaretechnik-Trends}}, location = {{Bremen}}, number = {{3}}, title = {{{Towards Applying Model-based Testing in Test Case Migration}}}, volume = {{36}}, year = {{2016}}, } @article{6768, author = {{Jovanovikj, Ivan and Grieger, Marvin and Güldali, Baris and Teetz, Alexander}}, journal = {{Softwaretechnik-Trends, Proceedings of the 3rd Workshop Model-Based and Model-Driven Software Modernization (MMSM)}}, location = {{Karlsruhe}}, number = {{3}}, title = {{{Reengineering of Legacy Test Cases: Problem Domain & Scenarios}}}, volume = {{36}}, year = {{2016}}, } @misc{688, author = {{Kutzias, Damian}}, publisher = {{Universität Paderborn}}, title = {{{Friendship Processes in Network Creation Games}}}, year = {{2016}}, } @misc{689, author = {{Schaefer, Johannes Sebastian}}, publisher = {{Universität Paderborn}}, title = {{{Routing Algorithms on Delayed Networks for Disaster Management Support}}}, year = {{2016}}, } @unpublished{16450, abstract = {{In this paper, we solve the local gathering problem of a swarm of $n$ indistinguishable, point-shaped robots on a two dimensional grid in asymptotically optimal time $\mathcal{O}(n)$ in the fully synchronous $\mathcal{FSYNC}$ time model. Given an arbitrarily distributed (yet connected) swarm of robots, the gathering problem on the grid is to locate all robots within a $2\times 2$-sized area that is not known beforehand. Two robots are connected if they are vertical or horizontal neighbors on the grid. The locality constraint means that no global control, no compass, no global communication and only local vision is available; hence, a robot can only see its grid neighbors up to a constant $L_1$-distance, which also limits its movements. A robot can move to one of its eight neighboring grid cells and if two or more robots move to the same location they are \emph{merged} to be only one robot. The locality constraint is the significant challenging issue here, since robot movements must not harm the (only globally checkable) swarm connectivity. For solving the gathering problem, we provide a synchronous algorithm -- executed by every robot -- which ensures that robots merge without breaking the swarm connectivity. In our model, robots can obtain a special state, which marks such a robot to be performing specific connectivity preserving movements in order to allow later merge operations of the swarm. Compared to the grid, for gathering in the Euclidean plane for the same robot and time model the best known upper bound is $\mathcal{O}(n^2)$.}}, author = {{Cord-Landwehr, Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}}, booktitle = {{arXiv:1602.03303}}, title = {{{Asymptotically Optimal Gathering on a Grid}}}, year = {{2016}}, } @inproceedings{166, abstract = {{Network function virtualization and software-defined networking allow services consisting of virtual network functions to be designed and implemented with great flexibility by facilitating automatic deployments, migrations, and reconfigurations for services and their components. For extended flexibility, we go beyond seeing services as a fixed chain of functions. We present a YANG model for describing the service structure in deployment requests in a flexible way that enables changing the order of functions in case the order of traversing them does not affect the functionality of the service. Upon receiving such requests, the network orchestration system can choose the optimal composition of service components that gives the best results for placement of services in the network. This introduces new complexities to the placement problem by greatly increasing the number of possible ways a service can be composed. In this paper, we describe a heuristic solution that selects a Pareto set of the possible compositions of a service as well as possible combinations of different services, with respect to different resource requirements of the services. Our evaluations show that the selected combinations consist of representative samples of possible structures and requirements and therefore, can result in optimal or close-to-optimal placement results.}}, author = {{Dräxler, Sevil and Karl, Holger}}, booktitle = {{Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft)}}, pages = {{184----192}}, title = {{{Placement of Services with Flexible Structures Specified by a YANG Data Model}}}, doi = {{10.1109/NETSOFT.2016.7502412}}, year = {{2016}}, } @phdthesis{167, author = {{Günther, Peter}}, publisher = {{Universität Paderborn}}, title = {{{Physical attacks on pairing-based cryptography}}}, year = {{2016}}, } @inproceedings{169, abstract = {{We apply methods of genetic programming to a general problem from software engineering, namely example-based generation of specifications. In particular, we focus on model transformation by example. The definition and implementation of model transformations is a task frequently carried out by domain experts, hence, a (semi-)automatic approach is desirable. This application is challenging because the underlying search space has rich semantics, is high-dimensional, and unstructured. Hence, a computationally brute-force approach would be unscalable and potentially infeasible. To address that problem, we develop a sophisticated approach of designing complex mutation operators. We define ‘patterns’ for constructing mutation operators and report a successful case study. Furthermore, the code of the evolved model transformation is required to have high maintainability and extensibility, that is, the code should be easily readable by domain experts. We report an evaluation of this approach in a software engineering case study.}}, author = {{Kühne, Thomas and Hamann, Heiko and Arifulina, Svetlana and Engels, Gregor}}, booktitle = {{Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016)}}, pages = {{278----293}}, title = {{{Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application}}}, doi = {{10.1007/978-3-319-30668-1_18}}, year = {{2016}}, }