@inproceedings{8073, author = {{Grieger, Marvin and Fazal-Baqaie, Masud and Engels, Gregor and Klenke, Markus}}, booktitle = {{Software Engineering 2017}}, pages = {{65--66}}, title = {{{Concept-Based Engineering of Situation-Specific Migration Methods}}}, year = {{2017}}, } @misc{81, author = {{Luo, Linghui}}, publisher = {{Universität Paderborn}}, title = {{{MultiSkipList: A Self-stabilizing Overlay Network with Monotonic Searchability maintained}}}, year = {{2017}}, } @inproceedings{82, abstract = {{Many graph problems such as maximum cut, chromatic number, hamiltonian cycle, and edge dominating set are known to be fixed-parameter tractable (FPT) when parameterized by the treewidth of the input graphs, but become W-hard with respect to the clique-width parameter. Recently, Gajarský et al. proposed a new parameter called modular-width using the notion of modular decomposition of graphs. They showed that the chromatic number problem and the partitioning into paths problem, and hence hamiltonian path and hamiltonian cycle, are FPT when parameterized by this parameter. In this paper, we study modular-width in parameterized parallel complexity and show that the weighted maximum clique problem and the maximum matching problem are fixed-parameter parallel-tractable (FPPT) when parameterized by this parameter.}}, author = {{Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}}, booktitle = {{Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW)}}, pages = {{139--150}}, title = {{{Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity}}}, doi = {{10.1007/978-3-319-59605-1_13}}, year = {{2017}}, } @inproceedings{8225, author = {{Mendes, Jorge and Cunha, Jácome and Duarte, Francisco and Engels, Gregor and Saraiva, Joao and Sauer, Stefan}}, booktitle = {{Proceedings of the 39th International Conference on Software Engineering, {ICSE} 2017, Buenos Aires, Argentina, May 20-28, 2017 - Companion Volume}}, pages = {{123--127}}, publisher = {{IEEE}}, title = {{{Systematic spreadsheet construction processes}}}, doi = {{http://dx.doi.org/10.1109/VLHCC.2017.8103459}}, year = {{2017}}, } @misc{83, author = {{Uden, Dennis}}, publisher = {{Universität Paderborn}}, title = {{{Microsoft vs. the EU Commission - An analysis on product bundeling}}}, year = {{2017}}, } @inproceedings{5692, abstract = {{We consider Max-min Share (MmS) fair allocations of indivisible chores (items with negative utilities). We show that allocation of chores and classical allocation of goods (items with positive utilities) have some fundamental connections but also differences which prevent a straightforward application of algorithms for goods in the chores setting and viceversa. We prove that an MmS allocation does not need to exist for chores and computing an MmS allocation - if it exists - is strongly NP-hard. In view of these non-existence and complexity results, we present a polynomial-time 2-approximation algorithm for MmS fairness for chores. We then introduce a new fairness concept called optimal MmS that represents the best possible allocation in terms of MmS that is guaranteed to exist. We use connections to parallel machine scheduling to give (1) a polynomial-time approximation scheme for computing an optimal MmS allocation when the number of agents is fixed and (2) an effective and efficient heuristic with an ex-post worst-case analysis.}}, author = {{Aziz, Haris and Rauchecker, Gerhard and Schryen, Guido and Walsh, Toby}}, booktitle = {{Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17)}}, location = {{San Francisco, CA, USA}}, number = {{1}}, pages = {{1--7}}, title = {{{Algorithms for Max-Min Share Fair Allocation of Indivisible Chores}}}, volume = {{31}}, year = {{2017}}, } @misc{5694, author = {{Schnitker, Nino Noel}}, publisher = {{Universität Paderborn}}, title = {{{Genetischer Algorithmus zur Erstellung von Ensembles von Nested Dichotomies}}}, year = {{2017}}, } @inproceedings{5695, author = {{Jazayeri, Bahar and Schwichtenberg, Simon}}, booktitle = {{Proceedings of Softwaretechnik-Trends Workshops}}, publisher = {{Gesellschaft für Informatik eV, Fachgruppe PARS}}, title = {{{On the Necessity of an Architecture Framework for On-The-Fly Computing}}}, volume = {{37}}, year = {{2017}}, } @inproceedings{57, abstract = {{Users prefer natural language software requirements because of their usability and accessibility. Many approaches exist to elaborate these requirements and to support the users during the elicitation process. But there is a lack of adequate resources, which are needed to train and evaluate approaches for requirement refinement. We are trying to close this gap by using online available software descriptions from SourceForge and app stores. Thus, we present two real-life requirements collections based on online-available software descriptions. Our goal is to show the domain-specific characteristics of content words describing functional requirements. On the one hand, we created a semantic role-labeled requirements set, which we use for requirements classification. On the other hand, we enriched software descriptions with linguistic features and dependencies to provide evidence for the context-awareness of software functionalities. }}, author = {{Bäumer, Frederik Simon and Dollmann, Markus and Geierhos, Michaela}}, booktitle = {{Proceedings of the 2nd ACM SIGSOFT International Workshop on App Market Analytics}}, editor = {{Sarro, Federica and Shihab, Emad and Nagappan, Meiyappan and Platenius, Marie Christin and Kaimann, Daniel}}, isbn = {{978-1-4503-5158-4}}, location = {{Paderborn, Germany}}, pages = {{19--25}}, publisher = {{ACM}}, title = {{{Studying Software Descriptions in SourceForge and App Stores for a better Understanding of real-life Requirements}}}, doi = {{10.1145/3121264.3121269}}, year = {{2017}}, } @inproceedings{5722, author = {{Gupta, Pritha and Hetzer, Alexander and Tornede, Tanja and Gottschalk, Sebastian and Kornelsen, Andreas and Osterbrink, Sebastian and Pfannschmidt, Karlson and Hüllermeier, Eyke}}, location = {{Rostock}}, title = {{{jPL: A Java-based Software Framework for Preference Learning}}}, year = {{2017}}, } @misc{5724, author = {{Hetzer, Alexander and Tornede, Tanja}}, publisher = {{Universität Paderborn}}, title = {{{Solving the Container Pre-Marshalling Problem using Reinforcement Learning and Structured Output Prediction}}}, year = {{2017}}, } @inproceedings{5725, author = {{Holzinger, Philipp and Hermann, Ben and Lerch, Johannes and Bodden, Eric and Mezini, Mira}}, booktitle = {{2017 IEEE Symposium on Security and Privacy (SP)}}, isbn = {{9781509055333}}, publisher = {{IEEE}}, title = {{{Hardening Java’s Access Control by Abolishing Implicit Privilege Elevation}}}, doi = {{10.1109/sp.2017.16}}, year = {{2017}}, } @inproceedings{5726, author = {{Reif, Michael and Eichberg, Michael and Hermann, Ben and Mezini, Mira}}, booktitle = {{Proceedings of the 6th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis - SOAP 2017}}, isbn = {{9781450350723}}, publisher = {{ACM Press}}, title = {{{Hermes: assessment and creation of effective test corpora}}}, doi = {{10.1145/3088515.3088523}}, year = {{2017}}, } @inproceedings{5727, author = {{Kübler, Florian and Müller, Patrick and Hermann, Ben}}, booktitle = {{Proceedings of the 6th ACM SIGPLAN International Workshop on State Of the Art in Program Analysis - SOAP 2017}}, isbn = {{9781450350723}}, publisher = {{ACM Press}}, title = {{{SootKeeper: runtime reusability for modular static analysis}}}, doi = {{10.1145/3088515.3088518}}, year = {{2017}}, } @inproceedings{5739, author = {{Yigitbas, Enes and Stahl, Hagen and Sauer, Stefan and Engels, Gregor}}, booktitle = {{Modelling Foundations and Applications - 13th European Conference, {ECMFA} 2017, Held as Part of {STAF} 2017, Marburg, Germany, July 19-20, 2017, Proceedings}}, pages = {{126--141}}, title = {{{Self-adaptive UIs: Integrated Model-Driven Development of UIs and Their Adaptations}}}, doi = {{10.1007/978-3-319-61482-3\_8}}, year = {{2017}}, } @inproceedings{5740, author = {{Yigitbas, Enes and Sauer, Stefan and Engels, Gregor}}, booktitle = {{Proceedings of the {ACM} {SIGCHI} Symposium on Engineering Interactive Computing Systems, {EICS} 2017, Lisbon, Portugal, June 26-29, 2017}}, pages = {{99--104}}, title = {{{Adapt-UI: an IDE supporting model-driven development of self-adaptive UIs}}}, doi = {{10.1145/3102113.3102144}}, year = {{2017}}, } @inproceedings{5741, author = {{Yigitbas, Enes and Grün, Silas and Sauer, Stefan and Engels, Gregor}}, booktitle = {{Ubiquitous Computing and Ambient Intelligence - 11th International Conference, UCAmI 2017, Philadelphia, PA, USA, November 7-10, 2017, Proceedings}}, pages = {{624--635}}, title = {{{Model-Driven Context Management for Self-adaptive User Interfaces}}}, doi = {{10.1007/978-3-319-67585-5\_61}}, year = {{2017}}, } @inproceedings{5769, abstract = {{Information Flow Analysis (IFA) aims at detecting illegal flows of information between program entities. “Legality” is therein specified in terms of various security policies. For the analysis, this opens up two possibilities: building generic, policy independent and building specific, policy dependent IFAs. While the former needs to track all dependencies between program entities, the latter allows for a reduced and thus more efficient analysis. In this paper, we start out by formally defining a policy independent information flow analysis. Next, we show how to specialize this IFA via policy specific variable tracking, and prove soundness of the specialization. We furthermore investigate refinement relationships between policies, allowing an IFA for one policy to be employed for its refinements. As policy refinement depends on concrete program entities, we additionally propose a precomputation of policy refinement conditions, enabling an efficient refinement check for concrete programs.}}, author = {{Töws, Manuel and Wehrheim, Heike}}, booktitle = {{Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods (ICFEM 2017)}}, isbn = {{9783319686899}}, issn = {{0302-9743}}, pages = {{362--378}}, publisher = {{Springer International Publishing}}, title = {{{Policy Dependent and Independent Information Flow Analyses}}}, doi = {{10.1007/978-3-319-68690-5_22}}, year = {{2017}}, } @article{58, 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 define the service structure in a flexible way that enables changing the order of functions in case the functionality of the service is not influenced by this, and propose a YANG data model for expressing this flexibility. Flexible structures allow the network orchestration system to choose the optimal composition of service components that for example gives the best results for placement of services in the network. When number of flexible services and number of components in each service increase, combinatorial explosion limits the practical use of this flexibility. In this paper, we describe a selection heuristic that gives a Pareto set of the possible compositions of a service as well as possible combinations of different services, with respect to different optimization objectives. Moreover, we present a heuristic algorithm for placement of a combination of services, which aims at placing service components along shortest paths that have enough capacity for accommodating the services. By applying these solutions, we show that allowing flexibility in the service structure is feasible.}}, author = {{Dräxler, Sevil and Karl, Holger}}, journal = {{International Journal of Network Management}}, number = {{2}}, pages = {{1----16}}, publisher = {{Wiley Online Library}}, title = {{{Specification, Composition, and Placement of Network Services with Flexible Structures}}}, doi = {{10.1002/nem.1963}}, year = {{2017}}, } @article{5800, author = {{Tramm, T. and Kremer, H.-Hugo and Reinmann, G.}}, journal = {{bwp@ Berufs- und Wirtschaftspädagogik - online}}, number = {{33}}, pages = {{1--5}}, title = {{{Editorial zur Ausgabe 33: Entwicklungsbezogene (Praxis-)Forschung }}}, year = {{2017}}, }