@article{6725, author = {{Czerwinski, Wojciech and Martens, Wim and van Rooijen, Lorijn and Zeitoun, Marc and Zetzsche, Georg}}, journal = {{Discrete Mathematics & Theoretical Computer Science}}, number = {{4}}, title = {{{A Characterization for Decidable Separability by Piecewise Testable Languages}}}, doi = {{10.23638/DMTCS-19-4-1}}, volume = {{19}}, year = {{2017}}, } @article{6737, author = {{Wolters, Dennis and Gerth, Christian and Engels, Gregor}}, journal = {{Computer Science and Information Systems (ComSIS)}}, number = {{2}}, pages = {{517--536}}, title = {{{Visual Requirements Modeling for Cross-Device Systems}}}, doi = {{10.2298/CSIS160930015W}}, volume = {{14}}, year = {{2017}}, } @article{6764, author = {{Jovanovikj, Ivan and Sauer, Stefan}}, journal = {{Softwaretechnik-Trends, Proceedings of the 19th Workshop Software-Reengineering & Evolution (WSRE) & 8th Workshop Design for Future (DFF)}}, location = {{Bad Honnef}}, number = {{2}}, pages = {{ 50--51 }}, publisher = {{Gesellschaft für Informatik e.V., Fachgruppe PARS}}, title = {{{Towards a Framework for Constructing Context-Specific Migration Methods for Test Cases}}}, volume = {{37}}, year = {{2017}}, } @article{68, abstract = {{Proof-carrying hardware (PCH) is a principle for achieving safety for dynamically reconfigurable hardware systems. The producer of a hardware module spends huge effort when creating a proof for a safety policy. The proof is then transferred as a certificate together with the configuration bitstream to the consumer of the hardware module, who can quickly verify the given proof. Previous work utilized SAT solvers and resolution traces to set up a PCH technology and corresponding tool flows. In this article, we present a novel technology for PCH based on inductive invariants. For sequential circuits, our approach is fundamentally stronger than the previous SAT-based one since we avoid the limitations of bounded unrolling. We contrast our technology to existing ones and show that it fits into previously proposed tool flows. We conduct experiments with four categories of benchmark circuits and report consumer and producer runtime and peak memory consumption, as well as the size of the certificates and the distribution of the workload between producer and consumer. Experiments clearly show that our new induction-based technology is superior for sequential circuits, whereas the previous SAT-based technology is the better choice for combinational circuits.}}, author = {{Isenberg, Tobias and Platzner, Marco and Wehrheim, Heike and Wiersema, Tobias}}, journal = {{ACM Transactions on Design Automation of Electronic Systems}}, number = {{4}}, pages = {{61:1----61:23}}, publisher = {{ACM}}, title = {{{Proof-Carrying Hardware via Inductive Invariants}}}, doi = {{10.1145/3054743}}, year = {{2017}}, } @article{680, author = {{Peter, Manuel and Hildebrandt, Andre and Schlickriede, Christian and Gharib, Kimia and Zentgraf, Thomas and Förstner, Jens and Linden, Stefan}}, issn = {{1530-6984}}, journal = {{Nano Letters}}, keywords = {{tet_topic_opticalantenna}}, number = {{7}}, pages = {{4178--4183}}, publisher = {{American Chemical Society (ACS)}}, title = {{{Directional Emission from Dielectric Leaky-Wave Nanoantennas}}}, doi = {{10.1021/acs.nanolett.7b00966}}, volume = {{17}}, year = {{2017}}, } @phdthesis{685, author = {{Jakobs, Marie-Christine}}, publisher = {{Universität Paderborn}}, title = {{{On-The-Fly Safety Checking - Customizing Program Certification and Program Restructuring}}}, doi = {{10.17619/UNIPB/1-104}}, year = {{2017}}, } @article{69, abstract = {{Today, software is traded worldwide on global markets, with apps being downloaded to smartphones within minutes or seconds. This poses, more than ever, the challenge of ensuring safety of software in the face of (1) unknown or untrusted software providers together with (2) resource-limited software consumers. The concept of Proof-Carrying Code (PCC), years ago suggested by Necula, provides one framework for securing the execution of untrusted code. PCC techniques attach safety proofs, constructed by software producers, to code. Based on the assumption that checking proofs is usually much simpler than constructing proofs, software consumers should thus be able to quickly check the safety of software. However, PCC techniques often suffer from the size of certificates (i.e., the attached proofs), making PCC techniques inefficient in practice.In this article, we introduce a new framework for the safe execution of untrusted code called Programs from Proofs (PfP). The basic assumption underlying the PfP technique is the fact that the structure of programs significantly influences the complexity of checking a specific safety property. Instead of attaching proofs to program code, the PfP technique transforms the program into an efficiently checkable form, thus guaranteeing quick safety checks for software consumers. For this transformation, the technique also uses a producer-side automatic proof of safety. More specifically, safety proving for the software producer proceeds via the construction of an abstract reachability graph (ARG) unfolding the control-flow automaton (CFA) up to the degree necessary for simple checking. To this end, we combine different sorts of software analysis: expensive analyses incrementally determining the degree of unfolding, and cheap analyses responsible for safety checking. Out of the abstract reachability graph we generate the new program. In its CFA structure, it is isomorphic to the graph and hence another, this time consumer-side, cheap analysis can quickly determine its safety.Like PCC, Programs from Proofs is a general framework instantiable with different sorts of (expensive and cheap) analysis. Here, we present the general framework and exemplify it by some concrete examples. We have implemented different instantiations on top of the configurable program analysis tool CPAchecker and report on experiments, in particular on comparisons with PCC techniques.}}, author = {{Jakobs, Marie-Christine and Wehrheim, Heike}}, journal = {{ACM Transactions on Programming Languages and Systems}}, number = {{2}}, pages = {{7:1--7:56}}, publisher = {{ACM}}, title = {{{Programs from Proofs: A Framework for the Safe Execution of Untrusted Software}}}, doi = {{10.1145/3014427}}, year = {{2017}}, } @misc{695, author = {{Nowack, Joshua}}, publisher = {{Universität Paderborn}}, title = {{{On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen}}}, year = {{2017}}, } @book{16444, author = {{Gausemeier, Jürgen and Bodden, Eric and Dressler, Falko and Dumitrescu, Roman and Meyer auf der Heide, Friedhelm and Scheytt, Christoph and Trächtler, Ansgar}}, pages = {{369}}, title = {{{Wissenschaftsforum Intelligente Technische Systeme (WInTeSys)}}}, 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}}, } @article{16540, author = {{Dellnitz, Michael and Klus, Stefan}}, issn = {{1468-9367}}, journal = {{Dynamical Systems}}, pages = {{61--79}}, title = {{{Sensing and control in symmetric networks}}}, doi = {{10.1080/14689367.2016.1215410}}, year = {{2017}}, } @article{16581, author = {{Dellnitz, Michael and Klus, Stefan and Ziessler, Adrian}}, issn = {{1536-0040}}, journal = {{SIAM Journal on Applied Dynamical Systems}}, pages = {{120--138}}, title = {{{A Set-Oriented Numerical Approach for Dynamical Systems with Parameter Uncertainty}}}, doi = {{10.1137/16m1072735}}, year = {{2017}}, } @article{16657, author = {{Peitz, Sebastian and Schäfer, Kai and Ober-Blöbaum, Sina and Eckstein, Julian and Köhler, Ulrich and Dellnitz, Michael}}, issn = {{2405-8963}}, journal = {{IFAC-PapersOnLine}}, pages = {{8674--8679}}, title = {{{A Multiobjective MPC Approach for Autonomously Driven Electric Vehicles * *This research was funded by the German Federal Ministry of Education and Research (BMBF) within the Leading-Edge Cluster Intelligent Technical Systems OstWestfalenLippe (it’s OWL).}}}, doi = {{10.1016/j.ifacol.2017.08.1526}}, year = {{2017}}, } @misc{104, author = {{Diemert, Denis}}, publisher = {{Universität Paderborn}}, title = {{{EAX - An Authenticated Encryption Mode for Block Ciphers}}}, year = {{2017}}, } @inproceedings{105, abstract = {{We initiate the study of network monitoring algorithms in a class of hybrid networks in which the nodes are connected by an external network and an internal network (as a short form for externally and internally controlled network). While the external network lies outside of the control of the nodes (or in our case, the monitoring protocol running in them) and might be exposed to continuous changes, the internal network is fully under the control of the nodes. As an example, consider a group of users with mobile devices having access to the cell phone infrastructure. While the network formed by the WiFi connections of the devices is an external network (as its structure is not necessarily under the control of the monitoring protocol), the connections between the devices via the cell phone infrastructure represent an internal network (as it can be controlled by the monitoring protocol). Our goal is to continuously monitor properties of the external network with the help of the internal network. We present scalable distributed algorithms that efficiently monitor the number of edges, the average node degree, the clustering coefficient, the bipartiteness, and the weight of a minimum spanning tree. Their performance bounds demonstrate that monitoring the external network state with the help of an internal network can be done much more efficiently than just using the external network, as is usually done in the literature.}}, author = {{Gmyr, Robert and Hinnenthal, Kristian and Scheideler, Christian and Sohler, Christian}}, booktitle = {{Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP)}}, pages = {{137:1----137:15}}, title = {{{Distributed Monitoring of Network Properties: The Power of Hybrid Networks}}}, doi = {{10.4230/LIPIcs.ICALP.2017.137}}, year = {{2017}}, } @misc{10589, author = {{Fürnkranz, J. and Hüllermeier, Eyke}}, booktitle = {{Encyclopedia of Machine Learning and Data Mining}}, pages = {{1000--1005}}, title = {{{Preference Learning}}}, year = {{2017}}, } @phdthesis{10594, abstract = {{Multiobjective optimization plays an increasingly important role in modern applications, where several criteria are often of equal importance. The task in multiobjective optimization and multiobjective optimal control is therefore to compute the set of optimal compromises (the Pareto set) between the conflicting objectives. Since – in contrast to the solution of a single objective optimization problem – the Pareto set generally consists of an infinite number of solutions, the computational effort can quickly become challenging. This is even more the case when many problems have to be solved, when the number of objectives is high, or when the objectives are costly to evaluate. Consequently, this thesis is devoted to the identification and exploitation of structure both in the Pareto set and the dynamics of the underlying model as well as to the development of efficient algorithms for solving problems with additional parameters, with a high number of objectives or with PDE-constraints. These three challenges are addressed in three respective parts. In the first part, predictor-corrector methods are extended to entire Pareto sets. When certain smoothness assumptions are satisfied, then the set of parameter dependent Pareto sets possesses additional structure, i.e. it is a manifold. The tangent space can be approximated numerically which yields a direction for the predictor step. In the corrector step, the predicted set converges to the Pareto set at a new parameter value. The resulting algorithm is applied to an example from autonomous driving. In the second part, the hierarchical structure of Pareto sets is investigated. When considering a subset of the objectives, the resulting solution is a subset of the Pareto set of the original problem. Under additional smoothness assumptions, the respective subsets are located on the boundary of the Pareto set of the full problem. This way, the “skeleton” of a Pareto set can be computed and due to the exponential increase in computing time with the number of objectives, the computations of these subsets are significantly faster which is demonstrated using an example from industrial laundries. In the third part, PDE-constrained multiobjective optimal control problems are addressed by reduced order modeling methods. Reduced order models exploit the structure in the system dynamics, for example by describing the dynamics of only the most energetic modes. The model reduction introduces an error in both the function values and their gradients, which has to be taken into account in the development of algorithms. Both scalarization and set-oriented approaches are coupled with reduced order modeling. Convergence results are presented and the numerical benefit is investigated. The algorithms are applied to semi-linear heat flow problems as well as to the Navier-Stokes equations. }}, author = {{Peitz, Sebastian}}, title = {{{ Exploiting structure in multiobjective optimization and optimal control}}}, doi = {{10.17619/UNIPB/1-176}}, year = {{2017}}, } @article{10600, author = {{H.W. Leong, Philip and Amano, Hideharu and Anderson, Jason and Bertels, Koen and M.P. Cardoso, Jo\~{a}o and Diessel, Oliver and Gogniat, Guy and Hutton, Mike and Lee, JunKyu and Luk, Wayne and Lysaght, Patrick and Platzner, Marco and K. Prasanna, Viktor and Rissa, Tero and Silvano, Cristina and So, Hayden and Wang, Yu}}, journal = {{ACM Transactions on Reconfigurable Technology and Systems}}, title = {{{The First 25 Years of the FPL Conference – Significant Papers}}}, doi = {{10.1145/2996468}}, year = {{2017}}, } @article{10601, author = {{F. DeMara, Ronald and Platzner, Marco and Ottavi, Marco}}, journal = {{IEEE Transactions on Computers and IEEE Transactions on Emerging Topics in Computing}}, title = {{{Innovation in Reconfigurable Computing Fabrics: from Devices to Architectures (guest editorial)}}}, doi = {{10.1109/TETC.2016.2641599}}, year = {{2017}}, } @article{10611, author = {{Anwer, Jahanzeb and Platzner, Marco}}, journal = {{Microprocessors and Microsystems}}, pages = {{160--172}}, publisher = {{Elsevier}}, title = {{{Evaluating fault-tolerance of redundant FPGA structures using Boolean difference calculus}}}, doi = {{10.1016/j.micpro.2017.06.002}}, year = {{2017}}, }