@inproceedings{19656, author = {{Sharma, Arnab and Wehrheim, Heike}}, booktitle = {{Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS)}}, publisher = {{Springer}}, title = {{{Automatic Fairness Testing of Machine Learning Models}}}, year = {{2020}}, } @article{19864, author = {{Meyer, Maurice and Frank, Maximilian and Massmann, Melina and Dumitrescu, Roman}}, journal = {{Proceedings of The 11th International Multi-Conference on Complexity, Informatics and Cybernetics (IMCIC 2020)}}, title = {{{Research and Consulting in Data-Driven Strategic Product Planning}}}, year = {{2020}}, } @article{19866, author = {{Meyer, Maurice and Frank, Maximilian and Massmann, Melina and Dumitrescu, Roman}}, journal = {{Journal of Systemics, Cybernetics and Informatics}}, number = {{2}}, pages = {{55--61}}, title = {{{Research and Consulting in Data-Driven Strategic Product Planning}}}, volume = {{18}}, year = {{2020}}, } @inproceedings{19899, abstract = {{Most existing robot formation problems seek a target formation of a certain minimal and, thus, efficient structure. Examples include the Gathering and the Chain-Formation problem. In this work, we study formation problems that try to reach a maximal structure, supporting for example an efficient coverage in exploration scenarios. A recent example is the NASA Shapeshifter project, which describes how the robots form a relay chain along which gathered data from extraterrestrial cave explorations may be sent to a home base. As a first step towards understanding such maximization tasks, we introduce and study the Max-Chain-Formation problem, where $n$ robots are ordered along a winding, potentially self-intersecting chain and must form a connected, straight line of maximal length connecting its two endpoints. We propose and analyze strategies in a discrete and in a continuous time model. In the discrete case, we give a complete analysis if all robots are initially collinear, showing that the worst-case time to reach an $\varepsilon$-approximation is upper bounded by $\mathcal{O}(n^2 \cdot \log (n/\varepsilon))$ and lower bounded by $\Omega(n^2 \cdot~\log (1/\varepsilon))$. If one endpoint of the chain remains stationary, this result can be extended to the non-collinear case. If both endpoints move, we identify a family of instances whose runtime is unbounded. For the continuous model, we give a strategy with an optimal runtime bound of $\Theta(n)$. Avoiding an unbounded runtime similar to the discrete case relies crucially on a counter-intuitive aspect of the strategy: slowing down the endpoints while all other robots move at full speed. Surprisingly, we can show that a similar trick does not work in the discrete model.}}, author = {{Castenow, Jannik and Kling, Peter and Knollmann, Till and Meyer auf der Heide, Friedhelm}}, booktitle = {{Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings}}, editor = {{Devismes , Stéphane and Mittal, Neeraj }}, isbn = {{978-3-030-64347-8}}, pages = {{65--80}}, publisher = {{Springer}}, title = {{{A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up}}}, doi = {{10.1007/978-3-030-64348-5_6}}, volume = {{12514}}, year = {{2020}}, } @inproceedings{19953, abstract = {{Current GNN architectures use a vertex neighborhood aggregation scheme, which limits their discriminative power to that of the 1-dimensional Weisfeiler-Lehman (WL) graph isomorphism test. Here, we propose a novel graph convolution operator that is based on the 2-dimensional WL test. We formally show that the resulting 2-WL-GNN architecture is more discriminative than existing GNN approaches. This theoretical result is complemented by experimental studies using synthetic and real data. On multiple common graph classification benchmarks, we demonstrate that the proposed model is competitive with state-of-the-art graph kernels and GNNs.}}, author = {{Damke, Clemens and Melnikov, Vitaly and Hüllermeier, Eyke}}, booktitle = {{Proceedings of the 12th Asian Conference on Machine Learning (ACML 2020)}}, editor = {{Jialin Pan, Sinno and Sugiyama, Masashi}}, keywords = {{graph neural networks, Weisfeiler-Lehman test, cycle detection}}, location = {{Bangkok, Thailand}}, pages = {{49--64}}, publisher = {{PMLR}}, title = {{{A Novel Higher-order Weisfeiler-Lehman Graph Convolution}}}, volume = {{129}}, year = {{2020}}, } @misc{19999, author = {{Mayer, Stefan}}, publisher = {{Universität Paderborn}}, title = {{{Optimierung von JMCTest beim Testen von Inter Method Contracts}}}, year = {{2020}}, } @inproceedings{20116, author = {{Nouri, Zahra and Wachsmuth, Henning and Engels, Gregor}}, booktitle = {{Proceedings of COLING 2020, the 28th International Conference on Computational Linguistics}}, location = {{Barcelona, Spain}}, pages = {{6264--6276}}, title = {{{Mining Crowdsourcing Problems from Discussion Forums of Workers}}}, year = {{2020}}, } @inproceedings{20122, author = {{El Baff, Roxanne and Al-Khatib, Khalid and Stein, Benno and Wachsmuth, Henning}}, booktitle = {{Third Workshop on Computational Modeling of People's Opinions, Personality, and Emotions in Social Media (PEOPLES 2020)}}, pages = {{29--40}}, title = {{{Persuasiveness of News Editorials depending on Ideology and Personality}}}, year = {{2020}}, } @inproceedings{20139, author = {{Spliethöver, Maximilian and Wachsmuth, Henning}}, booktitle = {{Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)}}, pages = {{76--87}}, title = {{{Argument from Old Man's View: Assessing Social Bias in Argumentation}}}, year = {{2020}}, } @inproceedings{20140, author = {{Dorsch, Jonas and Wachsmuth, Henning}}, booktitle = {{Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)}}, pages = {{19--29}}, title = {{{Semi-Supervised Cleansing of Web Argument Corpora}}}, year = {{2020}}, } @inproceedings{20159, abstract = {{Let G = (V,E) be an undirected graph on n vertices with non-negative capacities on its edges. The mincut sensitivity problem for the insertion of an edge is defined as follows. Build a compact data structure for G and a given set S ⊆ V of vertices that, on receiving any edge (x,y) ∈ S×S of positive capacity as query input, can efficiently report the set of all pairs from S× S whose mincut value increases upon insertion of the edge (x,y) to G. The only result that exists for this problem is for a single pair of vertices (Picard and Queyranne, Mathematical Programming Study, 13 (1980), 8-16). We present the following results for the single source and the all-pairs versions of this problem. 1) Single source: Given any designated source vertex s, there exists a data structure of size 𝒪(|S|) that can output all those vertices from S whose mincut value to s increases upon insertion of any given edge. The time taken by the data structure to answer any query is 𝒪(|S|). 2) All-pairs: There exists an 𝒪(|S|²) size data structure that can output all those pairs of vertices from S× S whose mincut value gets increased upon insertion of any given edge. The time taken by the data structure to answer any query is 𝒪(k), where k is the number of pairs of vertices whose mincut increases. For both these versions, we also address the problem of reporting the values of the mincuts upon insertion of any given edge. To derive our results, we use interesting insights into the nearest and the farthest mincuts for a pair of vertices. In addition, a crucial result, that we establish and use in our data structures, is that there exists a directed acyclic graph of 𝒪(n) size that compactly stores the farthest mincuts from all vertices of V to a designated vertex s in the graph. We believe that this result is of independent interest, especially, because it also complements a previously existing result by Hariharan et al. (STOC 2007) that the nearest mincuts from all vertices of V to s is a laminar family, and hence, can be stored compactly in a tree of 𝒪(n) size.}}, author = {{Baswana, Surender and Gupta, Shiv and Knollmann, Till}}, booktitle = {{28th Annual European Symposium on Algorithms (ESA 2020)}}, editor = {{Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}}, isbn = {{978-3-95977-162-7}}, issn = {{1868-8969}}, keywords = {{Mincut, Sensitivity, Data Structure}}, pages = {{12:1--12:14}}, publisher = {{Schloss Dagstuhl -- Leibniz-Zentrum für Informatik}}, title = {{{Mincut Sensitivity Data Structures for the Insertion of an Edge}}}, doi = {{10.4230/LIPIcs.ESA.2020.12}}, volume = {{173}}, year = {{2020}}, } @inproceedings{20166, author = {{Bondarenko, Alexander and Fröbe, Maik and Beloucif, Meriem and Gienapp, Lukas and Ajjour, Yamen and Panchenko, Alexander and Biemann, Chris and Stein, Benno and Wachsmuth, Henning and Potthast, Martin and Hagen, Matthias}}, booktitle = {{CEUR Workshop Proceedings}}, pages = {{384--395}}, title = {{{Overview of Touché 2020: Argument Retrieval}}}, volume = {{2696}}, year = {{2020}}, } @inproceedings{20185, author = {{Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Knollmann, Till and Meyer auf der Heide, Friedhelm}}, booktitle = {{Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings }}, editor = {{Devismes, Stéphane and Mittal, Neeraj}}, isbn = {{978-3-030-64347-8}}, pages = {{60--64}}, publisher = {{Springer}}, title = {{{Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility }}}, doi = {{10.1007/978-3-030-64348-5_5}}, volume = {{12514}}, year = {{2020}}, } @misc{20221, author = {{Yeole, Paresh Kishor}}, title = {{{Plurality Consensus in Hybrid Networks}}}, year = {{2020}}, } @inproceedings{20274, author = {{Bila, Eleni and Doherty, Simon and Dongol, Brijesh and Derrick, John and Schellhorn, Gerhard and Wehrheim, Heike}}, booktitle = {{Formal Techniques for Distributed Objects, Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings}}, editor = {{Gotsman, Alexey and Sokolova, Ana}}, pages = {{39--58}}, publisher = {{Springer}}, title = {{{Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory}}}, doi = {{10.1007/978-3-030-50086-3\_3}}, volume = {{12136}}, year = {{2020}}, } @inproceedings{20275, author = {{Beringer, Steffen and Wehrheim, Heike}}, booktitle = {{Proceedings of the 15th International Conference on Software Technologies, {ICSOFT} 2020, Lieusaint, Paris, France, July 7-9, 2020}}, editor = {{van Sinderen, Marten and Fill, Hans{-}Georg and A. Maciaszek, Leszek}}, pages = {{15--26}}, publisher = {{ScitePress}}, title = {{{Consistency Analysis of AUTOSAR Timing Requirements}}}, doi = {{10.5220/0009766600150026}}, year = {{2020}}, } @inproceedings{20276, author = {{Beyer, Dirk and Wehrheim, Heike}}, booktitle = {{Leveraging Applications of Formal Methods, Verification and Validation: Verification Principles - 9th International Symposium on Leveraging Applications of Formal Methods, ISoLA 2020, Rhodes, Greece, October 20-30, 2020, Proceedings, Part {I}}}, editor = {{Margaria, Tiziana and Steffen, Bernhard}}, pages = {{143--167}}, publisher = {{Springer}}, title = {{{Verification Artifacts in Cooperative Verification: Survey and Unifying Component Framework}}}, doi = {{10.1007/978-3-030-61362-4\_8}}, volume = {{12476}}, year = {{2020}}, } @proceedings{20277, editor = {{Wehrheim, Heike and Cabot, Jordi}}, isbn = {{978-3-030-45233-9}}, publisher = {{Springer}}, title = {{{Fundamental Approaches to Software Engineering - 23rd International Conference, FASE 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings}}}, doi = {{10.1007/978-3-030-45234-6}}, volume = {{12076}}, year = {{2020}}, } @proceedings{20278, editor = {{Ahrendt, Wolfgang and Wehrheim, Heike}}, isbn = {{978-3-030-50994-1}}, publisher = {{Springer}}, title = {{{Tests and Proofs - 14th International Conference, TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings [postponed]}}}, doi = {{10.1007/978-3-030-50995-8}}, volume = {{12165}}, year = {{2020}}, } @article{20279, author = {{Sharma, Arnab and Wehrheim, Heike}}, journal = {{CoRR}}, title = {{{Testing Monotonicity of Machine Learning Models}}}, volume = {{abs/2002.12278}}, year = {{2020}}, }