TY  - JOUR
A1  - Frioux, Clémence
A1  - Schaub, Torsten H.
A1  - Schellhorn, Sebastian
A1  - Siegel, Anne
A1  - Wanko, Philipp
T1  - Hybrid metabolic network completion
JF  - Theory and practice of logic programming
N2  - Metabolic networks play a crucial role in biology since they capture all chemical reactions in an organism. While there are networks of high quality for many model organisms, networks for less studied organisms are often of poor quality and suffer from incompleteness. To this end, we introduced in previous work an answer set programming (ASP)-based approach to metabolic network completion. Although this qualitative approach allows for restoring moderately degraded networks, it fails to restore highly degraded ones. This is because it ignores quantitative constraints capturing reaction rates. To address this problem, we propose a hybrid approach to metabolic network completion that integrates our qualitative ASP approach with quantitative means for capturing reaction rates. We begin by formally reconciling existing stoichiometric and topological approaches to network completion in a unified formalism. With it, we develop a hybrid ASP encoding and rely upon the theory reasoning capacities of the ASP system dingo for solving the resulting logic program with linear constraints over reals. We empirically evaluate our approach by means of the metabolic network of Escherichia coli. Our analysis shows that our novel approach yields greatly superior results than obtainable from purely qualitative or quantitative approaches.
KW  - answer set programming
KW  - metabolic network
KW  - gap-filling
KW  - linear programming
KW  - hybrid solving
KW  - bioinformatics
Y1  - 2018
U6  - https://doi.org/10.1017/S1471068418000455
SN  - 1471-0684
SN  - 1475-3081
VL  - 19
IS  - 1
SP  - 83
EP  - 108
PB  - Cambridge University Press
CY  - New York
ER  - 
TY  - JOUR
A1  - Waitelonis, Jörg
A1  - Jürges, Henrik
A1  - Sack, Harald
T1  - Remixing entity linking evaluation datasets for focused benchmarking
JF  - Semantic Web
N2  - In recent years, named entity linking (NEL) tools were primarily developed in terms of a general approach, whereas today numerous tools are focusing on specific domains such as e.g. the mapping of persons and organizations only, or the annotation of locations or events in microposts. However, the available benchmark datasets necessary for the evaluation of NEL tools do not reflect this focalizing trend. We have analyzed the evaluation process applied in the NEL benchmarking framework GERBIL [in: Proceedings of the 24th International Conference on World Wide Web (WWW’15), International World Wide Web Conferences Steering Committee, Republic and Canton of Geneva, Switzerland, 2015, pp. 1133–1143, Semantic Web 9(5) (2018), 605–625] and all its benchmark datasets. Based on these insights we have extended the GERBIL framework to enable a more fine grained evaluation and in depth analysis of the available benchmark datasets with respect to different emphases. This paper presents the implementation of an adaptive filter for arbitrary entities and customized benchmark creation as well as the automated determination of typical NEL benchmark dataset properties, such as the extent of content-related ambiguity and diversity. These properties are integrated on different levels, which also enables to tailor customized new datasets out of the existing ones by remixing documents based on desired emphases. Besides a new system library to enrich provided NIF [in: International Semantic Web Conference (ISWC’13), Lecture Notes in Computer Science, Vol. 8219, Springer, Berlin, Heidelberg, 2013, pp. 98–113] datasets with statistical information, best practices for dataset remixing are presented, and an in depth analysis of the performance of entity linking systems on special focus datasets is presented.
KW  - Entity Linking
KW  - GERBIL
KW  - evaluation
KW  - benchmark
Y1  - 2019
U6  - https://doi.org/10.3233/SW-180334
SN  - 1570-0844
SN  - 2210-4968
VL  - 10
IS  - 2
SP  - 385
EP  - 412
PB  - IOS Press
CY  - Amsterdam
ER  - 
TY  - GEN
A1  - Alhosseini Almodarresi Yasin, Seyed Ali
A1  - Bin Tareaf, Raad
A1  - Najafi, Pejman
A1  - Meinel, Christoph
T1  - Detect me if you can
BT  - Spam Bot Detection Using Inductive Representation Learning
T2  - Companion Proceedings of The 2019 World Wide Web Conference
N2  - Spam Bots have become a threat to online social networks with their malicious behavior, posting misinformation messages and influencing online platforms to fulfill their motives. As spam bots have become more advanced over time, creating algorithms to identify bots remains an open challenge. Learning low-dimensional embeddings for nodes in graph structured data has proven to be useful in various domains. In this paper, we propose a model based on graph convolutional neural networks (GCNN) for spam bot detection. Our hypothesis is that to better detect spam bots, in addition to defining a features set, the social graph must also be taken into consideration. GCNNs are able to leverage both the features of a node and aggregate the features of a node’s neighborhood. We compare our approach, with two methods that work solely on a features set and on the structure of the graph. To our knowledge, this work is the first attempt of using graph convolutional neural networks in spam bot detection.
KW  - Social Media Analysis
KW  - Bot Detection
KW  - Graph Embedding
KW  - Graph Convolutional Neural Networks
Y1  - 2019
SN  - 978-1-4503-6675-5
U6  - https://doi.org/10.1145/3308560.3316504
SP  - 148
EP  - 153
PB  - Association for Computing Machinery
CY  - New York
ER  - 
TY  - GEN
A1  - Fichte, Johannes Klaus
A1  - Hecher, Markus
A1  - Meier, Arne
T1  - Counting Complexity for Reasoning in Abstract Argumentation
T2  - The Thirty-Third AAAI Conference on Artificial Intelligence, the Thirty-First Innovative Applications of Artificial Intelligence Conference, the Ninth AAAI Symposium on Educational Advances in Artificial Intelligence
N2  - In this paper, we consider counting and projected model counting of extensions in abstract argumentation for various semantics. When asking for projected counts we are interested in counting the number of extensions of a given argumentation framework while multiple extensions that are identical when restricted to the projected arguments count as only one projected extension. We establish classical complexity results and parameterized complexity results when the problems are parameterized by treewidth of the undirected argumentation graph. To obtain upper bounds for counting projected extensions, we introduce novel algorithms that exploit small treewidth of the undirected argumentation graph of the input instance by dynamic programming (DP). Our algorithms run in time double or triple exponential in the treewidth depending on the considered semantics. Finally, we take the exponential time hypothesis (ETH) into account and establish lower bounds of bounded treewidth algorithms for counting extensions and projected extension.
Y1  - 2019
SN  - 978-1-57735-809-1
SP  - 2827
EP  - 2834
PB  - AAAI Press
CY  - Palo Alto
ER  - 
TY  - GEN
A1  - Cabalar, Pedro
A1  - Fandinno, Jorge
A1  - Schaub, Torsten H.
A1  - Schellhorn, Sebastian
T1  - Lower Bound Founded Logic of Here-and-There
T2  - Logics in Artificial Intelligence
N2  - A distinguishing feature of Answer Set Programming is that all atoms belonging to a stable model must be founded. That is, an atom must not only be true but provably true. This can be made precise by means of the constructive logic of Here-and-There, whose equilibrium models correspond to stable models. One way of looking at foundedness is to regard Boolean truth values as ordered by letting true be greater than false. Then, each Boolean variable takes the smallest truth value that can be proven for it. This idea was generalized by Aziz to ordered domains and applied to constraint satisfaction problems. As before, the idea is that a, say integer, variable gets only assigned to the smallest integer that can be justified. In this paper, we present a logical reconstruction of Aziz’ idea in the setting of the logic of Here-and-There. More precisely, we start by defining the logic of Here-and-There with lower bound founded variables along with its equilibrium models and elaborate upon its formal properties. Finally, we compare our approach with related ones and sketch future work.
Y1  - 2019
SN  - 978-3-030-19570-0
SN  - 978-3-030-19569-4
U6  - https://doi.org/10.1007/978-3-030-19570-0_34
SN  - 0302-9743
SN  - 1611-3349
VL  - 11468
SP  - 509
EP  - 525
PB  - Springer
CY  - Cham
ER  - 
TY  - JOUR
A1  - Dimopoulos, Yannis
A1  - Gebser, Martin
A1  - Lühne, Patrick
A1  - Romero Davila, Javier
A1  - Schaub, Torsten H.
T1  - plasp 3
BT  - Towards Effective ASP Planning
JF  - Theory and practice of logic programming
N2  - We describe the new version of the Planning Domain Definition Language (PDDL)-to-Answer Set Programming (ASP) translator plasp. First, it widens the range of accepted PDDL features. Second, it contains novel planning encodings, some inspired by Satisfiability Testing (SAT) planning and others exploiting ASP features such as well-foundedness. All of them are designed for handling multivalued fluents in order to capture both PDDL as well as SAS planning formats. Third, enabled by multishot ASP solving, it offers advanced planning algorithms also borrowed from SAT planning. As a result, plasp provides us with an ASP-based framework for studying a variety of planning techniques in a uniform setting. Finally, we demonstrate in an empirical analysis that these techniques have a significant impact on the performance of ASP planning.
KW  - knowledge representation and nonmonotonic reasoning
KW  - technical notes and rapid communications
KW  - answer set programming
KW  - automated planning
KW  - action and change
Y1  - 2019
U6  - https://doi.org/10.1017/S1471068418000583
SN  - 1471-0684
SN  - 1475-3081
VL  - 19
IS  - 3
SP  - 477
EP  - 504
PB  - Cambridge Univ. Press
CY  - New York
ER  - 
TY  - JOUR
A1  - Metref, Sammy
A1  - Cosme, Emmanuel
A1  - Le Sommer, Julien
A1  - Poel, Nora
A1  - Brankart, Jean-Michel
A1  - Verron, Jacques
A1  - Gomez Navarro, Laura
T1  - Reduction of spatially structured errors in Wide-Swath altimetric satellite data using data assimilation
JF  - Remote sensing
N2  - The Surface Water and Ocean Topography (SWOT) mission is a next generation satellite mission expected to provide a 2 km-resolution observation of the sea surface height (SSH) on a two-dimensional swath. Processing SWOT data will be challenging because of the large amount of data, the mismatch between a high spatial resolution and a low temporal resolution, and the observation errors. The present paper focuses on the reduction of the spatially structured errors of SWOT SSH data. It investigates a new error reduction method and assesses its performance in an observing system simulation experiment. The proposed error-reduction method first projects the SWOT SSH onto a subspace spanned by the SWOT spatially structured errors. This projection is removed from the SWOT SSH to obtain a detrended SSH. The detrended SSH is then processed within an ensemble data assimilation analysis to retrieve a full SSH field. In the latter step, the detrending is applied to both the SWOT data and an ensemble of model-simulated SSH fields. Numerical experiments are performed with synthetic SWOT observations and an ensemble from a North Atlantic, 1/60 degrees simulation of the ocean circulation (NATL60). The data assimilation analysis is carried out with an ensemble Kalman filter. The results are assessed with root mean square errors, power spectrum density, and spatial coherence. They show that a significant part of the large scale SWOT errors is reduced. The filter analysis also reduces the small scale errors and allows for an accurate recovery of the energy of the signal down to 25 km scales. In addition, using the SWOT nadir data to adjust the SSH detrending further reduces the errors.
KW  - SWOT
KW  - correlated errors
KW  - OSSE
KW  - projection
KW  - detrending
KW  - ensemble kalman filter
Y1  - 2019
U6  - https://doi.org/10.3390/rs11111336
SN  - 2072-4292
VL  - 11
IS  - 11
PB  - MDPI
CY  - Basel
ER  - 
TY  - GEN
A1  - Przybylla, Mareen
T1  - Interactive objects in physical computing and their role in the learning process
T2  - Constructivist foundations
N2  - The target article discusses the question of how educational makerspaces can become places supportive of knowledge construction. This question is too often neglected by people who run makerspaces, as they mostly explain how to use different tools and focus on the creation of a product. In makerspaces, often pupils also engage in physical computing activities and thus in the creation of interactive artifacts containing embedded systems, such as smart shoes or wristbands, plant monitoring systems or drink mixing machines. This offers the opportunity to reflect on teaching physical computing in computer science education, where similarly often the creation of the product is so strongly focused upon that the reflection of the learning process is pushed into the background.
Y1  - 2019
SN  - 1782-348X
VL  - 14
IS  - 3
SP  - 264
EP  - 266
PB  - Vrije Univ.
CY  - Bussels
ER  - 
TY  - JOUR
A1  - Cabalar, Pedro
A1  - Fandinno, Jorge
A1  - Schaub, Torsten H.
A1  - Schellhorn, Sebastian
T1  - Gelfond-Zhang aggregates as propositional formulas
JF  - Artificial intelligence
N2  - Answer Set Programming (ASP) has become a popular and widespread paradigm for practical Knowledge Representation thanks to its expressiveness and the available enhancements of its input language. One of such enhancements is the use of aggregates, for which different semantic proposals have been made. In this paper, we show that any ASP aggregate interpreted under Gelfond and Zhang's (GZ) semantics can be replaced (under strong equivalence) by a propositional formula. Restricted to the original GZ syntax, the resulting formula is reducible to a disjunction of conjunctions of literals but the formulation is still applicable even when the syntax is extended to allow for arbitrary formulas (including nested aggregates) in the condition. Once GZ-aggregates are represented as formulas, we establish a formal comparison (in terms of the logic of Here-and-There) to Ferraris' (F) aggregates, which are defined by a different formula translation involving nested implications. In particular, we prove that if we replace an F-aggregate by a GZ-aggregate in a rule head, we do not lose answer sets (although more can be gained). This extends the previously known result that the opposite happens in rule bodies, i.e., replacing a GZ-aggregate by an F-aggregate in the body may yield more answer sets. Finally, we characterize a class of aggregates for which GZ- and F-semantics coincide.
KW  - Aggregates
KW  - Answer Set Programming
Y1  - 2019
U6  - https://doi.org/10.1016/j.artint.2018.10.007
SN  - 0004-3702
SN  - 1872-7921
VL  - 274
SP  - 26
EP  - 43
PB  - Elsevier
CY  - Amsterdam
ER  - 
TY  - JOUR
A1  - Prasse, Paul
A1  - Knaebel, Rene
A1  - Machlica, Lukas
A1  - Pevny, Tomas
A1  - Scheffer, Tobias
T1  - Joint detection of malicious domains and infected clients
JF  - Machine learning
N2  - Detection of malware-infected computers and detection of malicious web domains based on their encrypted HTTPS traffic are challenging problems, because only addresses, timestamps, and data volumes are observable. The detection problems are coupled, because infected clients tend to interact with malicious domains. Traffic data can be collected at a large scale, and antivirus tools can be used to identify infected clients in retrospect. Domains, by contrast, have to be labeled individually after forensic analysis. We explore transfer learning based on sluice networks; this allows the detection models to bootstrap each other. In a large-scale experimental study, we find that the model outperforms known reference models and detects previously unknown malware, previously unknown malware families, and previously unknown malicious domains.
KW  - Machine learning
KW  - Neural networks
KW  - Computer security
KW  - Traffic data
KW  - Https traffic
Y1  - 2019
U6  - https://doi.org/10.1007/s10994-019-05789-z
SN  - 0885-6125
SN  - 1573-0565
VL  - 108
IS  - 8-9
SP  - 1353
EP  - 1368
PB  - Springer
CY  - Dordrecht
ER  - 
TY  - JOUR
A1  - Aguado, Felicidad
A1  - Cabalar, Pedro
A1  - Fandiño, Jorge
A1  - Pearce, David
A1  - Perez, Gilberto
A1  - Vidal-Peracho, Concepcion
T1  - Revisiting Explicit Negation in Answer Set Programming
JF  - Theory and practice of logic programming
KW  - Answer set programming
KW  - Non-monotonic reasoning
KW  - Equilibrium logic
KW  - Explicit negation
Y1  - 2019
U6  - https://doi.org/10.1017/S1471068419000267
SN  - 1471-0684
SN  - 1475-3081
VL  - 19
IS  - 5-6
SP  - 908
EP  - 924
PB  - Cambridge Univ. Press
CY  - New York
ER  - 
TY  - JOUR
A1  - Aguado, Felicidad
A1  - Cabalar, Pedro
A1  - Fandinno, Jorge
A1  - Pearce, David
A1  - Perez, Gilberto
A1  - Vidal, Concepcion
T1  - Forgetting auxiliary atoms in forks
JF  - Artificial intelligence
N2  - In this work we tackle the problem of checking strong equivalence of logic programs that may contain local auxiliary atoms, to be removed from their stable models and to be forbidden in any external context. We call this property projective strong equivalence (PSE). It has been recently proved that not any logic program containing auxiliary atoms can be reformulated, under PSE, as another logic program or formula without them – this is known as strongly persistent forgetting. In this paper, we introduce a conservative extension of Equilibrium Logic and its monotonic basis, the logic of Here-and-There, in which we deal with a new connective ‘|’ we call fork. We provide a semantic characterisation of PSE for forks and use it to show that, in this extension, it is always possible to forget auxiliary atoms under strong persistence. We further define when the obtained fork is representable as a regular formula.
KW  - Answer set programming
KW  - Non-monotonic reasoning
KW  - Equilibrium logic
KW  - Denotational semantics
KW  - Forgetting
KW  - Strong equivalence
Y1  - 2019
U6  - https://doi.org/10.1016/j.artint.2019.07.005
SN  - 0004-3702
SN  - 1872-7921
VL  - 275
SP  - 575
EP  - 601
PB  - Elsevier
CY  - Amsterdam
ER  - 
TY  - JOUR
A1  - Pousttchi, Key
A1  - Gleiß, Alexander
T1  - Surrounded by middlemen - how multi-sided platforms change the insurance industry
JF  - Electron Markets
N2  - Multi-sided platforms (MSP) strongly affect markets and play a crucial part within the digital and networked economy. Although empirical evidence indicates their occurrence in many industries, research has not investigated the game-changing impact of MSP on traditional markets to a sufficient extent. More specifically, we have little knowledge of how MSP affect value creation and customer interaction in entire markets, exploiting the potential of digital technologies to offer new value propositions. Our paper addresses this research gap and provides an initial systematic approach to analyze the impact of MSP on the insurance industry. For this purpose, we analyze the state of the art in research and practice in order to develop a reference model of the value network for the insurance industry. On this basis, we conduct a case-study analysis to discover and analyze roles which are occupied or even newly created by MSP. As a final step, we categorize MSP with regard to their relation to traditional insurance companies, resulting in a classification scheme with four MSP standard types: Competition, Coordination, Cooperation, Collaboration.
KW  - Multi-sided platforms
KW  - Insurance industry
KW  - Value network
KW  - Digitalization
KW  - Customer ownership
Y1  - 2019
U6  - https://doi.org/10.1007/s12525-019-00363-w
SN  - 1019-6781
SN  - 1422-8890
VL  - 29
IS  - 4
SP  - 609
EP  - 629
PB  - Springer
CY  - Heidelberg
ER  - 
TY  - JOUR
A1  - Strickroth, Sven
T1  - PLATON
BT  - Developing a Graphical Lesson Planning System for Prospective Teachers
JF  - Education Sciences
N2  - Lesson planning is both an important and demanding task—especially as part of teacher training. This paper presents the requirements for a lesson planning system and evaluates existing systems regarding these requirements. One major drawback of existing software tools is that most are limited to a text- or form-based representation of the lesson designs. In this article, a new approach with a graphical, time-based representation with (automatic) analyses methods is proposed and the system architecture and domain model are described in detail. The approach is implemented in an interactive, web-based prototype called PLATON, which additionally supports the management of lessons in units as well as the modelling of teacher and student-generated resources. The prototype was evaluated in a study with 61 prospective teachers (bachelor’s and master’s preservice teachers as well as teacher trainees in post-university teacher training) in Berlin, Germany, with a focus on usability. The results show that this approach proofed usable for lesson planning and offers positive effects for the perception of time and self-reflection.
KW  - lesson planning
KW  - lesson preparation
KW  - support system
KW  - automatic feedback
Y1  - 2019
U6  - https://doi.org/10.3390/educsci9040254
SN  - 2227-7102
VL  - 9
IS  - 4
PB  - MDPI
CY  - Basel
ER  - 
TY  - THES
A1  - Tiwari, Abhishek
T1  - Enhancing Users’ Privacy: Static Resolution of the Dynamic Properties of Android
N2  - The usage of mobile devices is rapidly growing with Android being the most prevalent mobile operating system. Thanks to the vast variety of mobile applications, users are preferring smartphones over desktops for day to day tasks like Internet surfing. Consequently, smartphones store a plenitude of sensitive data. This data together with the high values of smartphones make them an attractive target for device/data theft (thieves/malicious applications).

Unfortunately, state-of-the-art anti-theft solutions do not work if they do not have an active network connection, e.g., if the SIM card was removed from the device. In the majority of these cases, device owners permanently lose their smartphone together with their personal data, which is even worse. 

Apart from that malevolent applications perform malicious activities to steal sensitive information from smartphones. Recent research considered static program analysis to detect dangerous data leaks. These analyses work well for data leaks due to inter-component communication, but suffer from shortcomings for inter-app communication with respect to precision, soundness, and scalability. 

This thesis focuses on enhancing users' privacy on Android against physical device loss/theft and (un)intentional data leaks. It presents three novel frameworks: (1) ThiefTrap, an anti-theft framework for Android, (2) IIFA, a modular inter-app intent information flow analysis of Android applications, and (3) PIAnalyzer, a precise approach for PendingIntent vulnerability analysis. 

ThiefTrap is based on a novel concept of an anti-theft honeypot account that protects the owner's data while preventing a thief from resetting the device. 
We implemented the proposed scheme and evaluated it through an empirical user study with 35 participants. In this study, the owner's data could be protected, recovered, and anti-theft functionality could be performed unnoticed from the thief in all cases.

IIFA proposes a novel approach for Android's inter-component/inter-app communication (ICC/IAC) analysis. Our main contribution is the first fully automatic, sound, and precise ICC/IAC information flow analysis that is scalable for realistic apps due to modularity, avoiding combinatorial explosion: Our approach determines communicating apps using short summaries rather than inlining intent calls between components and apps, which requires simultaneously analyzing all apps installed on a device.
We evaluate IIFA in terms of precision, recall, and demonstrate its scalability to a large corpus of real-world apps. IIFA reports 62 problematic ICC-/IAC-related information flows via two or more apps/components.

PIAnalyzer proposes a novel approach to analyze PendingIntent related vulnerabilities. PendingIntents are a powerful and universal feature of Android for inter-component communication. We empirically evaluate PIAnalyzer on a set of 1000 randomly selected applications and find 1358 insecure usages of PendingIntents, including 70 severe vulnerabilities.
N2  - Die Nutzung von mobilen Geräten nimmt rasant zu, wobei Android das häufigste mobile Betriebssystem ist. Dank der Vielzahl an mobilen Anwendungen bevorzugen Benutzer Smartphones gegenüber Desktops für alltägliche Aufgaben wie das Surfen im Internet. Folglich speichern Smartphones eine Vielzahl sensibler Daten. Diese Daten zusammen mit den hohen Werten von Smartphones machen sie zu einem attraktiven Ziel für Geräte/Datendiebstahl (Diebe/bösartige Anwendungen). 

Leider funktionieren moderne Diebstahlsicherungslösungen nicht, wenn sie keine aktive Netzwerkverbindung haben, z. B. wenn die SIM-Karte aus dem Gerät entnommen wurde. In den meisten Fällen verlieren Gerätebesitzer ihr Smartphone dauerhaft zusammen mit ihren persönlichen Daten, was noch schlimmer ist.

Abgesehen davon gibt es bösartige Anwendungen, die schädliche Aktivitäten ausführen, um vertrauliche Informationen von Smartphones zu stehlen. Kürzlich durchgeführte Untersuchungen berücksichtigten die statische Programmanalyse zur Erkennung gefährlicher Datenlecks. Diese Analysen eignen sich gut für Datenlecks aufgrund der Kommunikation zwischen Komponenten, weisen jedoch hinsichtlich der Präzision, Zuverlässigkeit und Skalierbarkeit Nachteile für die Kommunikation zwischen Apps auf. 
Diese Dissertation konzentriert sich auf die Verbesserung der Privatsphäre der Benutzer auf Android gegen Verlust/Diebstahl von physischen Geräten und (un)vorsätzlichen Datenverlust. Es werden drei neuartige Frameworks vorgestellt: (1) ThiefTrap, ein Anti-Diebstahl-Framework für Android, (2) IIFA, eine modulare Inter-App Analyse des Informationsflusses von Android Anwendungen, und (3) PIAnalyzer, ein präziser Ansatz für PendingIntent Schwachstellenanalyse.

ThiefTrap basiert auf einem neuartigen Konzept eines Diebstahlschutzkontos, das die Daten des Besitzers schützt und verhindert, dass ein Dieb das Gerät zurücksetzt. Wir haben das vorgeschlagene Schema implementiert und durch eine empirische Anwenderstudie mit 35 Teilnehmern ausgewertet. In dieser Studie könnten die Daten des Besitzers geschützt und wiederhergestellt werden, und die Diebstahlsicherungsfunktion konnte in jedem Fall unbemerkt vom Dieb ausgeführt werden.

IIFA schlägt einen neuen Ansatz für die Analyse von Komponenten zwischen Komponenten/ Inter-App Kommunikation (ICC/IAC) von Android vor. Unser Hauptbeitrag ist die erste vollautomatische, solide und präzise ICC/IAC Informationsflussanalyse, die aufgrund ihrer Modularität für realistische Apps skalierbar ist und eine kombinatorische Explosion vermeidet: Unser Ansatz bestimmt, dass Apps über kurze Zusammenfassungen kommuniziert werden, anstatt Absichtsaufrufe zwischen Komponenten zu verwenden und Apps, bei denen gleichzeitig alle auf einem Gerät installierten Apps analysiert werden müssen. Wir bewerten IIFA in Bezug auf Präzision, Rückruf und demonstrieren seine Skalierbarkeit für einen großen Korpus realer Apps. IIFA meldet 62 problematische ICC- / IAC-bezogene Informationsflüsse über zwei oder mehr Apps / Komponenten.

PIAnalyzer schlägt einen neuen Ansatz vor, um Schwachstellen im Zusammenhang mit PendingIntent zu analysieren. PendingIntents nutzen eine leistungsstarke und universelle Funktion von Android für die Kommunikation zwischen Komponenten. Wir evaluieren PIAnalyzer empirisch an einem Satz von 1000 zufällig ausgewählten Anwendungen und finden 1358 unsichere Verwendungen von PendingIntents, einschließlich 70 schwerwiegender Schwachstellen.
KW  - Android Security
KW  - Static Analysis
KW  - Privacy Protection
Y1  - 2019
ER  -