@article{669,
  abstract     = {{We study a new class of games which generalizes congestion games andits bottleneck variant. We introduce congestion games with mixed objectives to modelnetwork scenarios in which players seek to optimize for latency and bandwidths alike.We characterize the (non-)existence of pure Nash equilibria (PNE), the convergenceof improvement dynamics, the quality of equilibria and show the complexity of thedecision problem. For games that do not possess PNE we give bounds on the approx-imation ratio of approximate pure Nash equilibria.}},
  author       = {{Feldotto, Matthias and Leder, Lennart and Skopalik, Alexander}},
  issn         = {{1382-6905}},
  journal      = {{Journal of Combinatorial Optimization}},
  number       = {{4}},
  pages        = {{1145--1167}},
  publisher    = {{Springer Nature}},
  title        = {{{Congestion games with mixed objectives}}},
  doi          = {{10.1007/s10878-017-0189-y}},
  volume       = {{36}},
  year         = {{2018}},
}

@article{6743,
  author       = {{Wolters, Dennis}},
  journal      = {{die hochschullehre}},
  number       = {{4}},
  title        = {{{Einsatz von Classroom-Response-Systemen und Peer Instruction in der Veranstaltung Grundlagen von Datenbanken}}},
  year         = {{2018}},
}

@inproceedings{6761,
  author       = {{Jovanovikj, Ivan and Narasimhan, Vishwak and Engels, Gregor and Sauer, Stefan}},
  booktitle    = {{Proceedings of the 6th International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD,}},
  isbn         = {{978-989-758-283-7}},
  location     = {{Madeira, Portugal}},
  pages        = {{594--601}},
  publisher    = {{SciTePress}},
  title        = {{{Context-specific Quality Evaluation of Test Cases}}},
  doi          = {{10.5220/0006724405940601}},
  year         = {{2018}},
}

@inproceedings{6763,
  abstract     = {{Existing test cases represent important assets, which are worth reusing in software migration projects. The benefit is twofold, reuse of relevant information as well cost saving by avoiding design of new test cases. As test cases are implemented in the same or a compatible technology as the system they are testing, they have to somehow follow the system migration, i.e., they should be co-migrated. Due to the size of the test case set, and often missing conformity in the structure of the test cases, migration of test cases is a quite challenging task. As model-driven engineering has been established to manage those complex tasks, we apply it in the test case domain. In this paper, we propose a generic migration method based on model-driven reengineering techniques. Our method which involves reverse engineering, restructuring, and forward engineering is applied in an industrial case study where appropriate tooling was developed as well.}},
  author       = {{Jovanovikj, Ivan and Engels, Gregor and Anjorin, Anthony and Sauer, Stefan}},
  booktitle    = {{Information Systems in the Big Data Era - CAiSE Forum 2018, Tallinn, Estonia, June 11-15, 2018, ProceedingIs}},
  editor       = {{Mendling, Jan and Mouratidis, Haralambos}},
  isbn         = {{978-3-319-92901-9}},
  location     = {{Tallinn, Estonia}},
  pages        = {{133--147}},
  publisher    = {{Springer International Publishing}},
  title        = {{{Model-Driven Test Case Migration: The Test Case Reengineering Horseshoe Model}}},
  doi          = {{https://doi.org/10.1007/978-3-319-92901-9_13}},
  year         = {{2018}},
}

@article{6828,
  author       = {{Derrick, John and Doherty, Simon and Dongol, Brijesh and Schellhorn, Gerhard and Travkin, Oleg and Wehrheim, Heike}},
  journal      = {{Formal Asp. Comput.}},
  number       = {{5}},
  pages        = {{597--625}},
  title        = {{{Mechanized proofs of opacity: a comparison of two techniques}}},
  doi          = {{10.1007/s00165-017-0433-3}},
  volume       = {{30}},
  year         = {{2018}},
}

@inproceedings{6836,
  author       = {{Doherty, Simon and Dongol, Brijesh and Wehrheim, Heike and Derrick, John}},
  booktitle    = {{Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings}},
  pages        = {{110--129}},
  title        = {{{Making Linearizability Compositional for Partially Ordered Executions}}},
  doi          = {{10.1007/978-3-319-98938-9\_7}},
  year         = {{2018}},
}

@inproceedings{6838,
  author       = {{Doherty, Simon and Dongol, Brijesh and Wehrheim, Heike and Derrick, John}},
  booktitle    = {{Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings}},
  pages        = {{110--129}},
  title        = {{{Making Linearizability Compositional for Partially Ordered Executions}}},
  doi          = {{10.1007/978-3-319-98938-9\_7}},
  year         = {{2018}},
}

@inproceedings{6839,
  author       = {{Doherty, Simon and Dongol, Brijesh and Wehrheim, Heike and Derrick, John}},
  booktitle    = {{32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018}},
  pages        = {{45:1--45:3}},
  title        = {{{Brief Announcement: Generalising Concurrent Correctness to Weak Memory}}},
  doi          = {{10.4230/LIPIcs.DISC.2018.45}},
  year         = {{2018}},
}

@article{6967,
  author       = {{Derakhshanmanesh, Mahdi and Ebert, Jürgen and Grieger, Marvin and Engels, Gregor}},
  journal      = {{Software & Systems Modeling}},
  pages        = {{1--30}},
  title        = {{{Model-integrating development of software systems: a flexible component-based approach}}},
  year         = {{2018}},
}

@inproceedings{6970,
  abstract     = {{Dynamic allocation of resources is a key feature in network function virtualization (NFV), enabling flexible adjustment of slices and contained network services to ever-changing service demands. 
Considering resource allocation across the entire network, many authors have proposed approaches to optimize the placement and chaining of virtual network function (VNF) instances and the allocation of resources to these VNF instances. In doing so, various optimization objectives are conceivable, e.g., minimizing certain required resources or the end-to-end delay of the placed services.

In this paper, we investigate the relationship between four typical optimization objectives when coordinating the placement and resource allocation of chained VNF instances. We observe an interesting trade-off between minimizing the overhead of starting/stopping VNF instances and all other objectives when adapting to changed service demands.}},
  author       = {{Schneider, Stefan Balthasar and Dräxler, Sevil and Karl, Holger}},
  booktitle    = {{IEEE Global Communications Conference (GLOBECOM 2018)}},
  location     = {{Abu Dhabi, UAE}},
  publisher    = {{IEEE}},
  title        = {{{Trade-offs in Dynamic Resource Allocation in Network Function Virtualization}}},
  year         = {{2018}},
}

@inproceedings{6972,
  abstract     = {{In recent years, a variety of different approaches
have been proposed to tackle the problem of scaling and placing
network services, consisting of interconnected virtual network
functions (VNFs). This paper presents a placement abstraction
layer (PAL) that provides a clear and simple northbound interface
for using such algorithms while hiding their internal
functionality and implementation. Through its southbound interface,
PAL can connect to different back ends that evaluate
the calculated placements, e.g., using simulations, emulations, or
testbed approaches. As an example for such evaluation back ends,
we introduce a novel placement emulation framework (PEF)
that allows executing calculated placements using real, containerbased
VNFs on real-world network topologies. In a case study,
we show how PAL and PEF facilitate reusing and evaluating
placement algorithms as well as validating their underlying
models and performance claims.}},
  author       = {{Schneider, Stefan Balthasar and Peuster, Manuel and Karl, Holger}},
  booktitle    = {{IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)}},
  location     = {{Verona, Italy}},
  publisher    = {{IEEE}},
  title        = {{{A Generic Emulation Framework for Reusing and Evaluating VNF Placement Algorithms}}},
  doi          = {{10.1109/NFV-SDN.2018.8725795}},
  year         = {{2018}},
}

@inproceedings{6974,
  abstract     = {{A key challenge of network function virtualization
(NFV) is the complexity of developing and deploying new
network services. Currently, development requires many manual
steps that are time-consuming and error-prone (e.g., for creating
service descriptors). Furthermore, existing management and
orchestration (MANO) platforms only offer limited support of
standardized descriptor models or package formats, limiting the
re-usability of network services.

To this end, we introduce a fully integrated, open-source
NFV service development kit (SDK) with multi-MANO platform
support. Our SDK simplifies many NFV service development
steps by offering initial generation of descriptors, advanced
project management, as well as fully automated packaging and
submission for on-boarding. To achieve multi-platform support,
we present a package format that extends ETSI’s VNF package
format. In this demonstration, we present the end-to-end workflow
to develop an NFV service that is then packaged for multiple
platforms, i.e., 5GTANGO and OSM.}},
  author       = {{Schneider, Stefan Balthasar and Peuster, Manuel and Tavernier, Wouter and Karl, Holger}},
  booktitle    = {{IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN 2018)}},
  location     = {{Verona, Italy}},
  publisher    = {{IEEE}},
  title        = {{{A Fully Integrated Multi-Platform NFV SDK}}},
  doi          = {{10.1109/NFV-SDN.2018.8725794}},
  year         = {{2018}},
}

@inproceedings{16937,
  author       = {{Cunha, Jácome and Fernandes, Joao Paulo and Kelleher, Caitlin and Mendes, Jorge and Engels, Gregor}},
  booktitle    = {{Proceedings of 2018 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC), Lisbon, Portugal, October 1-4, 2018}},
  isbn         = {{9781538642351}},
  location     = {{Lisbon, Portugal}},
  publisher    = {{IEEE}},
  title        = {{{2018 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)}}},
  doi          = {{10.1109/vl/hcc43341.2018}},
  year         = {{2018}},
}

@inbook{16938,
  author       = {{Engels, Gregor and Maier, Günter W. and Ötting, Sonja K. and Steffen, Eckhard and Teetz, Alexander}},
  booktitle    = {{Zukunft der Arbeit – Eine praxisnahe Betrachtung}},
  editor       = {{Wischmann, Steffen and Hartmann, Ernst Andreas}},
  isbn         = {{9783662492659}},
  pages        = {{221--231}},
  publisher    = {{Springer Verlag}},
  title        = {{{Gerechtigkeit in flexiblen Arbeits- und Managementprozessen}}},
  doi          = {{10.1007/978-3-662-49266-6_16}},
  year         = {{2018}},
}

@article{1043,
  abstract     = {{Approximate computing (AC) is an emerging paradigm for energy-efficient computation. The basic idea of AC is to sacrifice high precision for low energy by allowing hardware to carry out “approximately correct” calculations. This provides a major challenge for software quality assurance: programs successfully verified to be correct might be erroneous on approximate hardware. In this letter, we present a novel approach for determining under what conditions a software verification result is valid for approximate hardware. To this end, we compute the allowed tolerances for AC hardware from successful verification runs. More precisely, we derive a set of constraints which—when met by the AC hardware—guarantees the verification result to carry over to AC. On the practical side, we furthermore: 1) show how to extract tolerances from verification runs employing predicate abstraction as verification technology and 2) show how to check such constraints on hardware designs. We have implemented all techniques, and exemplify them on example C programs and a number of recently proposed approximate adders.}},
  author       = {{Isenberg, Tobias and Jakobs, Marie-Christine and Pauck, Felix and Wehrheim, Heike}},
  issn         = {{1943-0663}},
  journal      = {{IEEE Embedded Systems Letters}},
  pages        = {{22--25}},
  publisher    = {{Institute of Electrical and Electronics Engineers (IEEE)}},
  title        = {{{Validity of Software Verification Results on Approximate Hardware}}},
  doi          = {{10.1109/LES.2017.2758200}},
  year         = {{2018}},
}

@misc{1044,
  author       = {{Leer, Richard}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Measuring Performance of a Static Analysis Framework with an application to Immutability Analysis}}},
  year         = {{2018}},
}

@misc{1045,
  author       = {{Strüwer, Jan Niclas}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Interactive Data Visualization for Exploded Supergraphs}}},
  year         = {{2018}},
}

@proceedings{10591,
  editor       = {{Abiteboul, S. and Arenas, M. and Barceló, P. and Bienvenu, M. and Calvanese, D. and David, C. and Hull, R. and Hüllermeier, Eyke and Kimelfeld, B. and Libkin, L. and Martens, W. and Milo, T. and Murlak, F. and Neven, F. and Ortiz, M. and Schwentick, T. and Stoyanovich, J. and Su, J. and Suciu, D. and Vianu, V. and Yi, K.}},
  number       = {{1}},
  pages        = {{1--29}},
  title        = {{{Research Directions for Principles of Data Management}}},
  volume       = {{7}},
  year         = {{2018}},
}

@inproceedings{10598,
  abstract     = {{Approximate computing has become a very popular design
strategy that exploits error resilient computations to achieve higher
performance and energy efficiency. Automated synthesis of approximate
circuits is performed via functional approximation, in which various
parts of the target circuit are extensively examined with a library
of approximate components/transformations to trade off the functional
accuracy and computational budget (i.e., power). However, as the number
of possible approximate transformations increases, traditional search
techniques suffer from a combinatorial explosion due to the large
branching factor. In this work, we present a comprehensive framework
for automated synthesis of approximate circuits from either structural
or behavioral descriptions. We adapt the Monte Carlo Tree Search
(MCTS), as a stochastic search technique, to deal with the large design
space exploration, which enables a broader range of potential possible
approximations through lightweight random simulations. The proposed
framework is able to recognize the design Pareto set even with low
computational budgets. Experimental results highlight the capabilities of
the proposed synthesis framework by resulting in up to 61.69% energy
saving while maintaining the predefined quality constraints.}},
  author       = {{Awais, Muhammad and Ghasemzadeh Mohammadi, Hassan and Platzner, Marco}},
  booktitle    = {{26th IFIP/IEEE International Conference on Very Large Scale Integration (VLSI-SoC)}},
  keywords     = {{Approximate computing, High-level synthesis, Accuracy, Monte-Carlo tree search, Circuit simulation}},
  pages        = {{219--224}},
  title        = {{{An MCTS-based Framework for Synthesis of Approximate Circuits}}},
  doi          = {{10.1109/VLSI-SoC.2018.8645026}},
  year         = {{2018}},
}

@misc{10782,
  author       = {{Clausing, Lennart}},
  publisher    = {{Ruhr-University Bochum}},
  title        = {{{Development of a Hardware / Software Codesign for sonification of LIDAR-based sensor data}}},
  year         = {{2018}},
}