@inbook{3536, author = {{Schellhorn, Gerhard and Wedel, Monika and Travkin, Oleg and König, Jürgen and Wehrheim, Heike}}, booktitle = {{Software Engineering and Formal Methods}}, isbn = {{9783319929699}}, issn = {{0302-9743}}, pages = {{105--120}}, publisher = {{Springer International Publishing}}, title = {{{FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity}}}, doi = {{10.1007/978-3-319-92970-5_7}}, year = {{2018}}, } @inproceedings{5774, abstract = {{Information flow analysis investigates the flow of data in applications, checking in particular for flows from private sources to public sinks. Flow- and path-sensitive analyses are, however, often too costly to be performed every time a security-critical application is run. In this paper, we propose a variant of proof carrying code for information flow security. To this end, we develop information flow (IF) certificates which get attached to programs as well as a method for IF certificate validation. We prove soundness of our technique, i.e., show it to be tamper-free. The technique is implemented within the program analysis tool CPAchecker. Our experiments confirm that the use of certificates pays off for costly analysis runs.}}, author = {{Töws, Manuel and Wehrheim, Heike}}, booktitle = {{Theoretical Aspects of Computing – ICTAC 2018}}, isbn = {{9783030025076}}, issn = {{0302-9743}}, pages = {{435--454}}, publisher = {{Springer International Publishing}}, title = {{{Information Flow Certificates}}}, doi = {{10.1007/978-3-030-02508-3_23}}, year = {{2018}}, } @inbook{6253, author = {{Senft, Björn and Fischer, Holger Gerhard and Oberthür, Simon and Patkar, Nitish}}, booktitle = {{Design, User Experience, and Usability: Theory and Practice}}, isbn = {{9783319917962}}, issn = {{0302-9743}}, location = {{Las Vegas, USA}}, pages = {{758--770}}, publisher = {{Springer International Publishing}}, title = {{{Assist Users to Straightaway Suggest and Describe Experienced Problems}}}, doi = {{10.1007/978-3-319-91797-9_52}}, volume = {{10918}}, year = {{2018}}, } @inbook{6254, author = {{Fischer, Holger Gerhard and Senft, Björn and Rittmeier, Florian and Sauer, Stefan}}, booktitle = {{Design, User Experience, and Usability: Theory and Practice. Proceedings of the 20th International Conference on Human-Computer Interaktion (HCI International 2018)}}, editor = {{Marcus, Aaron and Wang, Wentao}}, isbn = {{9783319917962}}, issn = {{0302-9743}}, location = {{Las Vegas, USA}}, pages = {{711--724}}, publisher = {{Springer International Publishing}}, title = {{{A Canvas Method to Foster Interdisciplinary Discussions on Digital Assistance Systems}}}, doi = {{10.1007/978-3-319-91797-9_49}}, volume = {{10918}}, year = {{2018}}, } @inbook{6423, author = {{Schäfer, Dirk and Hüllermeier, Eyke}}, booktitle = {{Discovery Science}}, isbn = {{9783030017705}}, issn = {{0302-9743}}, pages = {{161--175}}, publisher = {{Springer International Publishing}}, title = {{{Preference-Based Reinforcement Learning Using Dyad Ranking}}}, doi = {{10.1007/978-3-030-01771-2_11}}, year = {{2018}}, } @inbook{16392, author = {{Feldkord, Björn and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}}, booktitle = {{Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications}}, isbn = {{9783319125671}}, issn = {{0302-9743}}, title = {{{A Dynamic Distributed Data Structure for Top-k and k-Select Queries}}}, doi = {{10.1007/978-3-319-98355-4_18}}, year = {{2018}}, } @inproceedings{24398, abstract = {{Through this study, we introduce the idea of applying scheduling techniques to allocate spatial resources that are shared among multiple robots moving in a static environment and having temporal constraints on the arrival time to destinations. To illustrate this idea, we present an exemplified algorithm that plans and assigns a motion path to each robot. The considered problem is particularly challenging because: (i) the robots share the same environment and thus the planner must take into account overlapping paths which cannot happen at the same time; (ii) there are time deadlines thus the planner must deal with temporal constraints; (iii) new requests arrive without a priori knowledge thus the planner must be able to add new paths online and adjust old plans; (iv) the robot motion is subject to noise thus the planner must be reactive to adapt to online changes. We showcase the functioning of the proposed algorithm through a set of agent-based simulations.}}, author = {{Khaluf, Yara and Markarian, Christine and Simoens, Pieter and Reina, Andreagiovanni}}, booktitle = {{International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017)}}, issn = {{0302-9743}}, title = {{{Scheduling Access to Shared Space in Multi-robot Systems}}}, doi = {{10.1007/978-3-319-59930-4_12}}, year = {{2017}}, } @inproceedings{2967, author = {{Blömer, Johannes and Liske, Gennadij}}, booktitle = {{Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)}}, isbn = {{9783319724522}}, issn = {{0302-9743}}, pages = {{438--453}}, publisher = {{Springer International Publishing}}, title = {{{Subtleties in Security Definitions for Predicate Encryption with Public Index}}}, doi = {{10.1007/978-3-319-72453-9_35}}, volume = {{10693}}, year = {{2017}}, } @inproceedings{2344, author = {{Blömer, Johannes and Günther, Peter and Krummel, Volker and Löken, Nils}}, booktitle = {{Foundations and Practice of Security}}, isbn = {{9783319756493}}, issn = {{0302-9743}}, pages = {{3--17}}, publisher = {{Springer International Publishing}}, title = {{{Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations}}}, doi = {{10.1007/978-3-319-75650-9_1}}, year = {{2017}}, } @inbook{2381, abstract = {{Metric facility location and K-means are well-known problems of combinatorial optimization. Both admit a fairly simple heuristic called single-swap, which adds, drops or swaps open facilities until it reaches a local optimum. For both problems, it is known that this algorithm produces a solution that is at most a constant factor worse than the respective global optimum. In this paper, we show that single-swap applied to the weighted metric uncapacitated facility location and weighted discrete K-means problem is tightly PLS-complete and hence has exponential worst-case running time.}}, author = {{Brauer, Sascha}}, booktitle = {{Lecture Notes in Computer Science}}, editor = {{Fotakis, Dimitris and Pagourtzis, Aris and Paschos, Vangelis Th.}}, isbn = {{9783319575858}}, issn = {{0302-9743}}, location = {{Athens, Greece}}, pages = {{116--127}}, publisher = {{Springer International Publishing}}, title = {{{Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems}}}, doi = {{10.1007/978-3-319-57586-5_11}}, volume = {{10236}}, 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}}, } @inbook{6255, author = {{Fischer, Holger Gerhard and Engler, Michael and Sauer, Stefan}}, booktitle = {{Design, User Experience, and Usability: Theory, Methodology, and Management}}, isbn = {{9783319586335}}, issn = {{0302-9743}}, location = {{Vancouver, Canada}}, pages = {{570--583}}, publisher = {{Springer International Publishing}}, title = {{{A Human-Centered Perspective on Software Quality: Acceptance Criteria for Work 4.0}}}, doi = {{10.1007/978-3-319-58634-2_42}}, volume = {{10288}}, year = {{2017}}, } @inbook{16461, author = {{Bemmann, Pascal and Biermeier, Felix and Bürmann, Jan and Kemper, Arne and Knollmann, Till and Knorr, Steffen and Kothe, Nils and Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören and Schaefer, Johannes Sebastian and Sundermeier, Jannik}}, booktitle = {{Structural Information and Communication Complexity}}, isbn = {{9783319720494}}, issn = {{0302-9743}}, title = {{{Monitoring of Domain-Related Problems in Distributed Data Streams}}}, doi = {{10.1007/978-3-319-72050-0_13}}, year = {{2017}}, } @inbook{14857, author = {{Beckschäfer, Michaela and Malberg, Simon and Tierney, Kevin and Weskamp, Christoph}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783319684956}}, issn = {{0302-9743}}, title = {{{Simulating Storage Policies for an Automated Grid-Based Warehouse System}}}, doi = {{10.1007/978-3-319-68496-3_31}}, year = {{2017}}, } @inbook{23396, author = {{Gerking, Christopher and Schubert, David and Budde, Ingo}}, booktitle = {{Theory and Practice of Model Transformation}}, issn = {{0302-9743}}, title = {{{Reducing the Verbosity of Imperative Model Refinements by Using General-Purpose Language Facilities}}}, doi = {{10.1007/978-3-319-61473-1_2}}, year = {{2017}}, } @inbook{60902, author = {{Senk, Johanna and Yegenoglu, Alper and Amblet, Olivier and Brukau, Yury and Davison, Andrew and Lester, David Roland and Lührs, Anna and Quaglio, Pietro and Rostami, Vahid and Rowley, Andrew and Schuller, Bernd and Stokes, Alan Barry and van Albada, Sacha Jennifer and Zielasko, Daniel and Diesmann, Markus and Weyers, Benjamin and Denker, Michael and Grün, Sonja}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783319538617}}, issn = {{0302-9743}}, publisher = {{Springer International Publishing}}, title = {{{A Collaborative Simulation-Analysis Workflow for Computational Neuroscience Using HPC}}}, doi = {{10.1007/978-3-319-53862-4_21}}, year = {{2017}}, } @inproceedings{20000, author = {{Hamann, Heiko and Valentini, Gabriele and Dorigo, Marco}}, booktitle = {{10th Int. Conf. on Swarm Intelligence, ANTS 2016}}, isbn = {{9783319444260}}, issn = {{0302-9743}}, title = {{{Population Coding: A New Design Paradigm for Embodied Distributed Systems}}}, doi = {{10.1007/978-3-319-44427-7_15}}, year = {{2016}}, } @inproceedings{20004, author = {{Valentini, Gabriele and Brambilla, Davide and Hamann, Heiko and Dorigo, Marco}}, booktitle = {{10th Int. Conf. on Swarm Intelligence, ANTS 2016}}, isbn = {{9783319444260}}, issn = {{0302-9743}}, title = {{{Collective Perception of Environmental Features in a Robot Swarm}}}, doi = {{10.1007/978-3-319-44427-7_6}}, year = {{2016}}, } @inbook{2948, author = {{Günther, Peter and Krummel, Volker}}, booktitle = {{Mathematical Aspects of Computer and Information Sciences}}, isbn = {{9783319328584}}, issn = {{0302-9743}}, pages = {{151--165}}, publisher = {{Springer International Publishing}}, title = {{{Implementing Cryptographic Pairings on Accumulator Based Smart Card Architectures}}}, doi = {{10.1007/978-3-319-32859-1_13}}, year = {{2016}}, } @inbook{2968, author = {{Blömer, Johannes and Lammersen, Christiane and Schmidt, Melanie and Sohler, Christian}}, booktitle = {{Algorithm Engineering}}, isbn = {{9783319494869}}, issn = {{0302-9743}}, pages = {{81--116}}, publisher = {{Springer International Publishing}}, title = {{{Theoretical Analysis of the k-Means Algorithm – A Survey}}}, doi = {{10.1007/978-3-319-49487-6_3}}, year = {{2016}}, }