liu.seSök publikationer i DiVA
Ändra sökning
Avgränsa sökresultatet
1234567 151 - 200 av 491
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Träffar per sida
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
Markera
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 151.
    Henziger, Eric
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik.
    The Cost of Confidentiality in Cloud Storage2018Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Cloud storage services allow users to store and access data in a secure and flexible manner. In recent years, cloud storage services have seen rapid growth in popularity as well as in technological progress and hundreds of millions of users use these services to store thousands of petabytes of data. Additionally, the synchronization of data that is essential for these types of services stands for a significant amount of the total internet traffic. In this thesis, seven cloud storage applications were tested under controlled experiments during the synchronization process to determine feature support and measure performance metrics. Special focus was put on comparing applications that perform client side encryption of user data to applicationsthat do not. The results show a great variation in feature support and performance between the different applications and that client side encryption introduces some limitations to other features but that it does not necessarily impact performance negatively. The results provide insights and enhances the understanding of the advantages and disadvantages that come with certain design choices of cloud storage applications. These insights will help future technological development of cloud storage services.

  • 152.
    Herzog, Almut
    et al.
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik.
    Shahmehri, Nahid
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    A usability study of security policy management2006Ingår i: Security and Privacy in Dynamic Environments. Proceedings of the 21st International Information Security Conference (IFIP TC-11) (SEC’06), 2006, s. 296-306Konferensbidrag (Övrigt vetenskapligt)
    Abstract [en]

    The Java Security Manager is one major security feature of the Java programming language. However, in many Java applications the Security Manager is not enabled because it slows execution time. This paper explores the performance of the Java Security Manager in depth, identifies the permissions with the worst performance and gives advice on how to use the Security Manager in a more efficient way.

    Our performance test shows that the CPU execution time penalty varies between 5% and 100% per resource access statement. This extreme range is due to the fact that some resource accesses are costly (such as file and socket access) and therefore hide the performance penalty for the access control check almost completely. The time penalty is much more noticeable with access to main memory resources (such as Java objects).

    In order to achieve reasonable response times, it is of utmost importance to tune garbage collection because the Java Security Manager creates short-lived objects during its permission check. Also, the order of permissions in the policy file can be important.

  • 153.
    Herzog, Almut
    et al.
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik.
    Shahmehri, Nahid
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Usability and security of personal firewalls2007Ingår i: International Information Security Conference IFIP TC-11,2007, New York, NY, USA: Springer Verlag , 2007, s. 37-Konferensbidrag (Refereegranskat)
  • 154.
    Herzog, Almut
    et al.
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik.
    Shahmehri, Nahid
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Usability and security of personal firewalls2007Ingår i: New Approaches for Security, Privacy and Trust in Complex Environments, Springer Berlin/Heidelberg, 2007, s. 37-48Kapitel i bok, del av antologi (Övrigt vetenskapligt)
    Abstract [en]

    Effective security of a personal firewall depends on (1) the rule granularity and the implementation of the rule enforcement and (2) the correctness and granularity of user decisions at the time of an alert. A misconfigured or loosely configured firewall may be more dangerous than no firewall at all because of the user’s false sense of security. This study assesses effective security of 13 personal firewalls by comparing possible granularity of rules as well as the usability of rule set-up and its influence on security.

    In order to evaluate usability, we have submitted each firewall to use cases that require user decisions and cause rule creation. In order to evaluate the firewalls’ security, we analysed the created rules. In addition, we ran a port scan and replaced a legitimate, network-enabled application with another program to assess the firewalls’ behaviour in misuse cases. We have conducted a cognitive walkthrough paying special attention to user guidance and user decision support.

    We conclude that a stronger emphasis on user guidance, on conveying the design of the personal firewall application, on the principle of least privilege and on implications of default settings would greatly enhance both usability and security of personal firewalls.

  • 155.
    Herzog, Almut
    et al.
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik.
    Shahmehri, Nahid
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Usable Set-up of Runtime Security Policies2007Ingår i: International Symposium on Human Aspects of Information Security and Assurance,2007, Emerald Group Publishing Limited, 2007, s. 394-407Konferensbidrag (Refereegranskat)
  • 156.
    Herzog, Almut
    et al.
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik.
    Shahmehri, Nahid
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Usable set-up of runtime security policies2007Ingår i: Information Management & Computer Security, ISSN 0968-5227, Vol. 15, nr 5, s. 394-407Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Purpose: This paper aims to present concrete and verified guidelines for enhancing the usability and security of software that delegates security decisions to lay users and captures these user decisions as a security policy.

    Design/methodology/approach: This work is an exploratory study. The authors hypothesised that existing tools for runtime set-up of security policies are not sufficient. As this proved true, as shown in earlier work, they apply usability engineering with user studies to advance the state-of-the-art.

    Findings: Little effort has been spent on how security policies can be set up by the lay users for whom they are intended. This work identifies what users want and need for a successful runtime set-up of security policies.

    Practical implications: Concrete and verified guidelines are provided for designers who are faced with the task of delegating security decisions to lay users.

    Originality/value: The devised guidelines focus specifically on the set-up of runtime security policies and therefore on the design of alert windows.

  • 157.
    Herzog, Almut
    et al.
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik.
    Shahmehri, Nahid
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    User help techniques for usable security2007Ingår i: Proceedings of the 1st Symposium on Computer Human Interaction for Management of Information Technology (CHIMIT’07) ACM Press, Boston, MA, USA, New York: ACM , 2007Kapitel i bok, del av antologi (Övrigt vetenskapligt)
    Abstract [en]

    There are a number of security-critical applications such as personal firewalls, web browsers and e-mail clients, whose users have little or no security knowledge and are easily confused, even frustrated by menus, messages or dialog boxes that deal with security issues.

    While there are evaluations of existing applications and proposals for new approaches or design guidelines for usable security applications, little effort has been invested in determining how applications can help users in security decisions and security tasks. The purpose of this work is to analyse conventional and security-specific user help techniques with regard to their usefulness in supporting lay users in security applications.

    We analyse the following help techniques: online documentation, context-sensitive help, wizards, assistants, safe staging and social navigation, and complement these with the tempting alternative of built-in, hidden security. Criteria for the analysis are derived from the type of user questions that can arise in applications and from definitions of when a security application can be called usable.

    Designers of security applications can use our analysis as general recommendations for when and how to use and combine user help techniques in security applications, but they can also use the analysis as a template. They can instantiate the template for their specific application to arrive at a concrete analysis of which user help techniques are most suitable in their specific case.

  • 158.
    Herzog, Almut
    et al.
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik.
    Shahmehri, Nahid
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Duma, Claudiu
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik.
    An ontology for information security2009Ingår i: Techniques and applications for advanced information privacy and security: emerging organizational, ethical and human issues / [ed] Nemadi H, Information Science Reference , 2009, 1, s. 278-301Kapitel i bok, del av antologi (Övrigt vetenskapligt)
    Abstract [en]

    Advances in technology are causing new privacy concerns as an increasing number of citizens are engaging in online activities.

    Techniques and Applications for Advanced Information Privacy and Security: Emerging Organizational, Ethical, and Human Issues provides a thorough understanding of issues and concerns in information technology security. An advanced reference source covering topics such as security management, privacy preservation, and authentication, this book outlines the field and provides a basic understanding of the most salient issues in privacy concerns for researchers and practitioners.

    Show more Show less

  • 159.
    Herzog, Almut
    et al.
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik.
    Shahmehri, Nahid
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Duma, Claudiu
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik.
    An ontology of information security2007Ingår i: International Journal of Information Security and Privacy, ISSN 1930-1650, Vol. 1, nr 4, s. 1-23Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We present a publicly available, OWL-based ontology of information security which models assets, threats, vulnerabilities, countermeasures and their relations. The ontology can be used as a general vocabulary, roadmap, and extensible dictionary of the domain of information security. With its help, users can agree on a common language and definition of terms and relationships. In addition to browsing for information, the ontology is also useful for reasoning about relationships between its entities, for example, threats and countermeasures. The ontology helps answer questions like: Which countermeasures detect or prevent the violation of integrity of data? Which assets are protected by SSH? Which countermeasures thwart buffer overflow attacks? At the moment, the ontology comprises 88 threat classes, 79 asset classes, 133 countermeasure classes and 34 relations between those classes. We provide the means for extending the ontology, and provide examples of the extendibility with the countermeasure classes ‘memory protection’ and ‘source code analysis’. This article describes the content of the ontology as well as its usages, potential for extension, technical implementation and tools for working with it.

  • 160.
    Hiran, Rahul
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Carlsson, Niklas
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Gill, Phillipa
    University of Toronto, Canada.
    Characterizing Large-scale Routing Anomalies: A Case Study of the China Telecom Incident2013Ingår i: Passive and Active Measurement / [ed] Matthew Roughan, Rocky Chang, Springer Berlin/Heidelberg, 2013, s. 229-238Konferensbidrag (Refereegranskat)
    Abstract [en]

    China Telecom’s hijack of approximately 50,000 IP prefixes in April 2010 highlights the potential for traffic interception on the Internet. Indeed, the sensitive nature of the hijacked prefixes, including US government agencies, garnered a great deal of attention and highlights the importance of being able to characterize such incidents after they occur. We use the China Telecom incident as a case study, to understand (1) what can be learned about large-scale routing anomalies using public data sets, and (2) what types of data should be collected to diagnose routing anomalies in the future. We develop a methodology for inferring which prefixes may be impacted by traffic interception using only control-plane data and validate our technique using data-plane traces. The key findings of our study of the China Telecom incident are: (1) The geographic distribution of announced prefixes is similar to the global distribution with a tendency towards prefixes registered in the Asia-Pacific region, (2) there is little evidence for subprefix hijacking which supports the hypothesis that this incident was likely a leak of existing routes, and (3) by preferring customer routes, providers inadvertently enabled interception of their customer’s traffic.

  • 161.
    Hiran, Rahul
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Carlsson, Niklas
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Shahmehri, Nahid
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Crowd-based Detection of Routing Anomalies on the Internet2015Ingår i: Proc. IEEE Conference on Communications and Network Security (IEEE CNS), Florence, Italy, Sept. 2015., IEEE Computer Society Digital Library, 2015, s. 388-396Konferensbidrag (Refereegranskat)
    Abstract [en]

    The Internet is highly susceptible to routing attacks and there is no universally deployed solution that ensures that traffic is not hijacked by third parties. Individuals or organizations wanting to protect themselves from sustained attacks must therefore typically rely on measurements and traffic monitoring to detect attacks. Motivated by the high overhead costs of continuous active measurements, we argue that passive monitoring combined with collaborative information sharing and statistics can be used to provide alerts about traffic anomalies that may require further investigation. In this paper we present and evaluate a user-centric crowd-based approach in which users passively monitor their network traffic, share information about potential anomalies, and apply combined collaborative statistics to identify potential routing anomalies. The approach uses only passively collected round-trip time (RTT) measurements, is shown to have low overhead, regardless if a central or distributed architecture is used, and provides an attractive tradeoff between attack detection rates (when there is an attack) and false alert rates (needing further investigation) under normal conditions. Our data-driven analysis using longitudinal and distributed RTT measurements also provides insights into detector selection and the relative weight that should be given to candidate detectors at different distances from the potential victim node.

  • 162.
    Hiran, Rahul
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Carlsson, Niklas
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Shahmehri, Nahid
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Does Scale, Size, and Locality Matter?: Evaluation of Collaborative BGP Security Mechanisms2016Ingår i: 2016 IFIP NETWORKING CONFERENCE (IFIP NETWORKING) AND WORKSHOPS, IEEE , 2016, s. 261-269Konferensbidrag (Refereegranskat)
    Abstract [en]

    The Border Gateway Protocol (BGP) was not designed with security in mind and is vulnerable to many attacks, including prefix/subprefix hijacks, interception attacks, and imposture attacks. Despite many protocols having been proposed to detect or prevent such attacks, no solution has been widely deployed. Yet, the effectiveness of most proposals relies on largescale adoption and cooperation between many large Autonomous Systems (AS). In this paper we use measurement data to evaluate some promising, previously proposed techniques in cases where they are implemented by different subsets of ASes, and answer questions regarding which ASes need to collaborate, the importance of the locality and size of the participating ASes, and how many ASes are needed to achieve good efficiency when different subsets of ASes collaborate. For our evaluation we use topologies and routing information derived from real measurement data. We consider collaborative detection and prevention techniques that use (i) prefix origin information, (ii) route path updates, or (iii) passively collected round-trip time (RTT) information. Our results and answers to the above questions help determine the effectiveness of potential incremental rollouts, incentivized or required by regional legislation, for example. While there are differences between the techniques and two of the three classes see the biggest benefits when detection/prevention is performed close to the source of an attack, the results show that significant gains can be achieved even with only regional collaboration.

  • 163.
    Hiran, Rahul
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Carlsson, Niklas
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Shahmehri, Nahid
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    PrefiSec: A Distributed Alliance Framework for Collaborative BGP Monitoring and Prefix-based Security2014Ingår i: Proc. ACM CCS Workshop on Information Sharing and Collaborative Security (ACM WISCS @CCS), ACM Digital Library, 2014, s. 3-12Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper presents the design and data-driven overhead analysis of PrefiSec, a distributed framework that helps collaborating organizations to effectively maintain and share network information in the fight against miscreants. PrefiSec is a novel distributed IP-prefix-based solution, which maintains information about the activities associated with IP prefixes (blocks of IP addresses) and autonomous systems (AS). Within PrefiSec, we design and evaluate simple and scalable mechanisms and policies that allow participating entities to effectively share network information, which helps to protect against prefix/subprefix attacks, interception attacks, and a wide range of edge-based attacks, such as spamming, scanning, and botnet activities. Timely reporting of such information helps participants improve their security, keep their security footprints clean, and incentivizes participation. Public wide-area BGP-announcements, traceroutes, and simulations are used to estimate the overhead, scalability, and alert rates. Our results show that PrefiSec helps improve system security, and can scale to large systems.

  • 164.
    Hiran, Rahul Gokulchand
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Collaborative Network Security: Targeting Wide-area Routing and Edge-network Attacks2016Doktorsavhandling, monografi (Övrigt vetenskapligt)
    Abstract [en]

    To ensure that services can be delivered reliably and continuously over theInternet, it is important that both Internet routes and edge networks aresecured. However, the sophistication and distributed nature of many at-tacks that target wide-area routing and edge networks make it difficult foran individual network, user, or router to detect these attacks. Thereforecollaboration is important. Although the benefits of collaboration betweendifferent network entities have been demonstrated, many open questionsstill remain, including how to best design distributed scalable mechanismsto mitigate attacks on the network infrastructure. This thesis makes severalcontributions that aim to secure the network infrastructure against attackstargeting wide-area routing and edge networks.

    First, we present a characterization of a controversial large-scale routinganomaly, in which a large Telecom operator hijacked a very large numberof Internet routes belonging to other networks. We use publicly availabledata from the time of the incident to understand what can be learned aboutlarge-scale routing anomalies and what type of data should be collected inthe future to diagnose and detect such anomalies.

    Second, we present multiple distributed mechanisms that enable col-laboration and information sharing between different network entities thatare affected by such attacks. The proposed mechanisms are applied in thecontexts of collaborating Autonomous Systems (ASes), users, and servers,and are shown to help raise alerts for various attacks. Using a combina-tion of data-driven analysis and simulations, based on publicly availablereal network data (including traceroutes, BGP announcements, and net-work relationship data), we show that our solutions are scalable, incur lowcommunication and processing overhead, and provide attractive tradeoffsbetween attack detection and false alert rates.

    Finally, for a set of previously proposed routing security mechanisms,we consider the impact of regional deployment restrictions, the scale of thecollaboration, and the size of the participants deploying the solutions. Al-though regional deployment can be seen as a restriction and the participationof large networks is often desirable, we find interesting cases where regionaldeployment can yield better results compared to random global deployment,and where smaller networks can play an important role in achieving bettersecurity gains. This study offers new insights towards incremental deploy-ment of different classes of routing security mechanisms.

  • 165.
    Hiran, Rahul
    et al.
    Linköpings universitet, Institutionen för datavetenskap. Linköpings universitet, Tekniska fakulteten.
    Carlsson, Niklas
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Shahmehri, Nahid
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Collaborative framework for protection against attacks targeting BGP and edge networks2017Ingår i: Computer Networks, ISSN 1389-1286, E-ISSN 1872-7069, Vol. 122, s. 120-137Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    This paper presents the design and data-driven overhead analysis of PrefiSec, a distributed framework that helps collaborating organizations to effectively maintain and share network information in the fight against miscreants. PrefiSec is a novel distributed IP-prefix-based solution, which maintains information about the activities associated with IP prefixes (blocks of IP addresses) and autonomous systems (AS) and enables efficient sharing of this information between participants. Within PrefiSec, we design and evaluate simple and scalable mechanisms that help to protect against prefixisubprefix attacks and interception attacks, and enable sharing of prefix related information related to a wide range of edge-based attacks, such as spamming and scanning. We also include an evaluation of which ASes need to collaborate, to what extent the size and locality of ASes matter, and how many ASes are needed to achieve good efficiency in detecting anomalous route announcements. Public wide-area BGP-announcements, traceroutes, and simulations are used to estimate the overhead, scalability, and alert rates. Our results show that PrefiSec helps improve system security, and can scale to large systems. (C) 2017 Elsevier B.V. All rights reserved.

  • 166.
    Holm, Jacob
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Opera.
    Proxy-based prefetching and pushing of web resources2016Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    The use of WWW is more prevalent now than ever. Latency has a significant impact on the WWW, with higher latencies causing longer loading time of webpages. On the other hand, if we can lower the latency, we will lower the loading time of a webpage. Latencies are often caused by data traveling long distances or through gateways that add additional processing delays to the forwarded packets. In this thesis we evaluate the latency benefits of different algorithms for prefetching and pushing of web resources, from a proxy when the client cache is known. We found that the most beneficial algorithm is a two sequence data mining technique. This algorithm is evaluated on a live system where we improve loading time by approximately 246 ms with only a 27% traffic increase on average. The results were measured by evaluating a large set of clients on Opera Turbo 2, a distributed proxy with knowledge of the client’s cache. We also concluded that by using a more conservative strategy we can push prefetched resources to the client, reducing the client requests by approximately 9.3% without any significant traffic increase between proxy and client.

  • 167.
    Hägle, Jakob
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Utvärdering av metod för applikationsgranskning2015Självständigt arbete på grundnivå (kandidatexamen), 10,5 poäng / 16 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Enligt Myndigheten för samhällsskydd och beredskap så är information ”mycket värdefull, ibland till och med livsviktig” (1). Informationssäkerhetsarbete syftar i korthet till att skydda information och för att möjliggöra det krävs det att utifrån de förutsättningar som finns att anpassade skydds- och säkerhetsåtgärder införs för att informationen ska få ett välavvägt, anpassat och kostnadseffektivt skydd i förhållande till dess värde för en organisation eller individ (1).

    I detta examensarbete har Försvarsmaktens metod för applikationsgranskning utvärderats i syfte att utifrån ett informationssäkerhetsperspektiv se om den är tillämpbar som en säkerhetsåtgärd för andra svenska myndigheter samt ta fram en uppdaterad version av metodiken.

    Kvantitativa och kvalitativa data har samlats in via enkätundersökning, litteraturstudie samt intervjuer och resultatet visar att applikationsgranskning passar väl in i det övriga informationssäkerhetsarbetet.

    Denna studie visar att svenska myndigheter har brister i sitt informationssäkerhetsarbete och efterlyser konkreta exempel och metodstöd för att det ska bli bättre. I den här studien visar sig Försvarsmaktens metod för applikationsgranskning vara en lämplig och flexibel grund som kan bidra med detta då den är anpassningsbar utifrån miljö och förutsättningar och en billig säkerhetsåtgärd som går fort att genomföra och klarar sig med små resurser. Metoden ger en god grund till ett fortsatt informationssäkerhetsarbete genom att den metodiskt steg för steg går igenom och granskar en applikation. Den består av två delar, en teoretisk granskning genomförs inledningsvis för att därefter genomföra om det bedöms nödvändigt en teknisk granskning.

  • 168.
    Islam, Hasan M. A.
    et al.
    Aalto Univ, Finland.
    Lagutin, Dmitrij
    Aalto Univ, Finland.
    Lukyanenko, Andrey
    Aalto Univ, Finland.
    Gurtov, Andrei
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Yla-Jaaski, Antti
    Aalto Univ, Finland.
    CIDOR: Content Distribution and Retrieval in Disaster Networks for Public Protection2017Ingår i: 2017 IEEE 13TH INTERNATIONAL CONFERENCE ON WIRELESS AND MOBILE COMPUTING, NETWORKING AND COMMUNICATIONS (WIMOB), IEEE , 2017, s. 324-333Konferensbidrag (Refereegranskat)
    Abstract [en]

    Information-Centric Networking (ICN) introduces a paradigm shift from a host centric communication model for Future Internet architectures. It supports the retrieval of a particular content regardless of the physical location of the content. Emergency network in a disaster scenario or disruptive network presents a significant challenge to the ICN deployment. In this paper, we present a Content dIstribution and retrieval framework in disaster netwOrks for public pRotection (CIDOR) which exploits the design principle of the native CCN architecture in the native Delay Tolerant Networking (DTN) architecture. We prove the feasibility and investigate the performance of our proposed solution using extensive simulation with different classes of the DTN routing strategies in different mobility scenarios. The simulation result shows that CIDOR can reduce the content retrieval time up to 50% while the response ratio is close to 100%.

  • 169.
    Islam, Hasan Mahmood Aminul
    et al.
    Aalto Univ, Finland.
    Lagutin, Dmitrij
    Aalto Univ, Finland.
    Yla-Jaaski, Antti
    Aalto Univ, Finland.
    Fotiou, Nikos
    Athens Univ Econ and Business, Greece.
    Gurtov, Andrei
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Transparent CoAP Services to IoT Endpoints through ICN Operator Networks2019Ingår i: Sensors, ISSN 1424-8220, E-ISSN 1424-8220, Vol. 19, nr 6, artikel-id 1339Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    The Constrained Application Protocol (CoAP) is a specialized web transfer protocol which is intended to be used for constrained networks and devices. CoAP and its extensions (e.g., CoAP observe and group communication) provide the potential for developing novel applications in the Internet-of-Things (IoT). However, a full-fledged CoAP-based application may require significant computing capability, power, and storage capacity in IoT devices. To address these challenges, we present the design, implementation, and experimentation with the CoAP handler which provides transparent CoAP services through the ICN core network. In addition, we demonstrate how the CoAP traffic over an ICN network can unleash the full potential of the CoAP, shifting both overhead and complexity from the (constrained) endpoints to the ICN network. The experiments prove that the CoAP Handler helps to decrease the required computation complexity, communication overhead, and state management of the CoAP server.

  • 170.
    Islam, M. Aminul
    et al.
    University of Saskatchewan, Canada.
    Eager, Derek
    University of Saskatchewan, Canada.
    Carlsson, Niklas
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Mahanti, Anirban
    NICTA, Alexandria, NSW, Australia.
    Revisiting Popularity Characterization and Modeling for User-generated Videos2013Ingår i: Modeling, Analysis & Simulation of Computer and Telecommunication Systems (MASCOTS), 2013 IEEE 21st International Symposium, Institute of Electrical and Electronics Engineers (IEEE), 2013, s. 350-354Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper presents new results on characterization and modeling of user-generated video popularity evolution, based on a recent complementary data collection for videos that were previously the subject of an eight month data collection campaign during 2008/09. In particular, during 2011, we collected two contiguous months of weekly view counts for videos in two separate 2008/09 datasets, namely the ``recently-uploaded'' and the ``keyword-search'' datasets. These datasets contain statistics for videos that were uploaded within 7 days of the start of data collection in 2008 and videos that were discovered using a keyword search algorithm in 2008, respectively. Our analysis shows that the average weekly view count for the recently-uploaded videos had not decreased by the time of the second measurement period, in comparison to the middle and later portions of the first measurement period. The new data is used to evaluate the accuracy of a previously proposed model for synthetic view count generation for time periods that are substantially longer than previously considered. We find that the model yielded distributions of total (lifetime) video view counts that match the empirical distributions, however, significant differences between the model and empirical data were observed with respect to other metrics. These differences appear to arise because of particular popularity characteristics that change over time rather than being week-invariant as assumed in the model.

  • 171.
    Ivanova, Valentina
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Applications of Large Displays: Advancing User Support in Large Scale Ontology Alignment2016Ingår i: Proceedings of the Doctoral Consortium at the 15th International Semantic Web Conference (ISWC 2016) Kobe, Japan, October 18, 2016 / [ed] Philippe Cudre-Mauroux, Natasha Noy and Riichiro Mizoguchi, Aachen, Germany: CEUR Workshop Proceedings , 2016, s. 50-57Konferensbidrag (Refereegranskat)
    Abstract [en]

    Producing alignments of the highest quality requires ‘humans in the loop’, however, user involvement is currently one of the challenges for the ontology alignment community. Ontology alignment is a cognitively intensive task and could be efficiently supported by user interfaces encompassing well-designed visualizations and interaction techniques. This work investigates the applicationof large, high-resolution displays to improve users’ cognitive support and identifies several promising directions for their application - improving ontologies’ and alignments’ navigation, supporting users’ thinking process and collaboration.

  • 172.
    Ivanova, Valentina
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Fostering User Involvement in Ontology Alignment and Alignment Evaluation2017Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    The abundance of data at our disposal empowers data-driven applications and decision making. The knowledge captured in the data, however, has not been utilized to full potential, as it is only accessible to human interpretation and data are distributed in heterogeneous repositories.

    Ontologies are a key technology unlocking the knowledge in the data by providing means to model the world around us and infer knowledge implicitly captured in the data. As data are hosted by independent organizations we often need to use several ontologies and discover the relationships between them in order to support data and knowledge transfer. Broadly speaking, while ontologies provide formal representations and thus the basis, ontology alignment supplies integration techniques and thus the means to turn the data kept in distributed, heterogeneous repositories into valuable knowledge.

    While many automatic approaches for creating alignments have already been developed, user input is still required for obtaining the highest-quality alignments. This thesis focuses on supporting users during the cognitively intensive alignment process and makes several contributions.

    We have identified front- and back-end system features that foster user involvement during the alignment process and have investigated their support in existing systems by user interface evaluations and literature studies. We have further narrowed down our investigation to features in connection to the, arguably, most cognitively demanding task from the users’ perspective—manual validation—and have also considered the level of user expertise by assessing the impact of user errors on alignments’ quality. As developing and aligning ontologies is an error-prone task, we have focused on the benefits of the integration of ontology alignment and debugging.

    We have enabled interactive comparative exploration and evaluation of multiple alignments at different levels of detail by developing a dedicated visual environment—Alignment Cubes—which allows for alignments’ evaluation even in the absence of reference alignments.

    Inspired by the latest technological advances we have investigated and identified three promising directions for the application of large, high-resolution displays in the field: improving the navigation in the ontologies and their alignments, supporting reasoning and collaboration between users.

    Delarbeten
    1. Requirements for and Evaluation of User Support for Large-Scale Ontology Alignment
    Öppna denna publikation i ny flik eller fönster >>Requirements for and Evaluation of User Support for Large-Scale Ontology Alignment
    2015 (Engelska)Ingår i: The Semantic Web. Latest Advances and New Domains: 12th European Semantic Web Conference, ESWC 2015, Portoroz, Slovenia, May 31 -- June 4, 2015. Proceedings, Springer Science+Business Media B.V., 2015, s. 3-20Konferensbidrag, Publicerat paper (Refereegranskat)
    Abstract [en]

    Currently one of the challenges for the ontology alignment community is the user involvement in the alignment process. At the same time, the focus of the community has shifted towards large-scale matching which introduces an additional dimension to this issue. This paper aims to provide a set of requirements that foster the user involvement for large-scale ontology alignment tasks.Further, we present and discuss the results of a literature study for 7 ontology alignments systems as well as a heuristic evaluation and an observational user study for 3 ontology alignment systems to reveal the coverage of the requirements in the systems and the support for the requirements in the user interfaces.

    Ort, förlag, år, upplaga, sidor
    Springer Science+Business Media B.V., 2015
    Serie
    Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 9088
    Nyckelord
    knowledge representation, ontologies, ontology alignment, user interfaces
    Nationell ämneskategori
    Datavetenskap (datalogi) Människa-datorinteraktion (interaktionsdesign)
    Identifikatorer
    urn:nbn:se:liu:diva-118273 (URN)10.1007/978-3-319-18818-8_1 (DOI)000362439200001 ()978-3-319-18817-1 (ISBN)978-3-319-18818-8 (ISBN)
    Konferens
    European Semantic Web Conference
    Forskningsfinansiär
    CUGS (National Graduate School in Computer Science)Swedish e‐Science Research Center
    Tillgänglig från: 2015-05-25 Skapad: 2015-05-25 Senast uppdaterad: 2018-07-17Bibliografiskt granskad
    2. User validation in ontology alignment
    Öppna denna publikation i ny flik eller fönster >>User validation in ontology alignment
    Visa övriga...
    2016 (Engelska)Ingår i: The Semantic Web - ISWC 2016: 15th International Semantic Web Conference, Kobe, Japan, October 17–21, 2016, Proceedings, Part I / [ed] Paul Groth, Elena Simperl, Alasdair Gray, Marta Sabou, Markus Krötzsch, Freddy Lecue, Fabian Flöck and Yolanda Gil, Cham, Switzerland: Springer Publishing Company, 2016, s. 200-217Konferensbidrag, Publicerat paper (Refereegranskat)
    Abstract [en]

    User validation is one of the challenges facing the ontology alignment community, as there are limits to the quality of automated alignment algorithms. In this paper we present a broad study on user validation of ontology alignments that encompasses three distinct but interrelated aspects: the profile of the user, the services of the alignment system, and its user interface. We discuss key issues pertaining to the alignment validation process under each of these aspects, and provide an overview of how current systems address them. Finally, we use experiments from the Interactive Matching track of the Ontology Alignment Evaluation Initiative (OAEI) 2015 to assess the impact of errors in alignment validation, and how systems cope with them as function of their services.

    Ort, förlag, år, upplaga, sidor
    Cham, Switzerland: Springer Publishing Company, 2016
    Serie
    Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 9981
    Nyckelord
    knowledge representation, user interfaces, ontology engineering, ontology alignment
    Nationell ämneskategori
    Datavetenskap (datalogi)
    Identifikatorer
    urn:nbn:se:liu:diva-131806 (URN)10.1007/978-3-319-46523-4_13 (DOI)000389086500013 ()9783319465227 (ISBN)9783319465234 (ISBN)
    Konferens
    International Semantic Web Conference
    Forskningsfinansiär
    Swedish e‐Science Research CenterCUGS (National Graduate School in Computer Science)EU, FP7, Sjunde ramprogrammet, FP7-IP-608142
    Tillgänglig från: 2016-10-07 Skapad: 2016-10-07 Senast uppdaterad: 2018-07-17Bibliografiskt granskad
    3. A unified approach for aligning taxonomies and debugging taxonomies and their alignments
    Öppna denna publikation i ny flik eller fönster >>A unified approach for aligning taxonomies and debugging taxonomies and their alignments
    2013 (Engelska)Ingår i: The Semantic Web: Semantics and Big Data: 10th International Conference, ESWC 2013, Montpellier, France, May 26-30, 2013. Proceedings / [ed] Philipp Cimiano, Oscar Corcho, Valentina Presutti, Laura Hollink, Sebastian Rudolph, Springer Berlin/Heidelberg, 2013, s. 1-15Konferensbidrag, Publicerat paper (Refereegranskat)
    Abstract [en]

    With the increased use of ontologies in semantically-enabled applications, the issues of debugging and aligning ontologies have become increasingly important. The quality of the results of such applications is directly dependent on the quality of the ontologies and mappings between the ontologies they employ. A key step towards achieving high quality ontologies and mappings is discovering and resolving modeling defects, e.g., wrong or missing relations and mappings. In this paper we present a unified framework for aligning taxonomies, the most used kind of ontologies, and debugging taxonomies and their alignments, where ontology alignment is treated as a special kind of debugging. Our framework supports the detection and repairing of missing and wrong is-a structure in taxonomies, as well as the detection and repairing of missing (alignment) and wrong mappings between ontologies. Further, we implemented a system based on this framework and demonstrate its benefits through experiments with ontologies from the Ontology Alignment Evaluation Initiative.

    Ort, förlag, år, upplaga, sidor
    Springer Berlin/Heidelberg, 2013
    Serie
    Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 7882
    Nyckelord
    Computer science, Database management, Information storage and retrieval systems, Artificial intelligence, Database Management, Database Management, Computer Science, general
    Nationell ämneskategori
    Datavetenskap (datalogi)
    Identifikatorer
    urn:nbn:se:liu:diva-93643 (URN)10.1007/978-3-642-38288-8_1 (DOI)978-3-642-38287-1 (ISBN)978-3-642-38288-8 (ISBN)
    Konferens
    Extended Semantic Web Conference
    Forskningsfinansiär
    Swedish e‐Science Research CenterVetenskapsrådet, 2010-4759CUGS (National Graduate School in Computer Science)
    Tillgänglig från: 2013-06-04 Skapad: 2013-06-04 Senast uppdaterad: 2018-07-17Bibliografiskt granskad
    4. Applications of Large Displays: Advancing User Support in Large Scale Ontology Alignment
    Öppna denna publikation i ny flik eller fönster >>Applications of Large Displays: Advancing User Support in Large Scale Ontology Alignment
    2016 (Engelska)Ingår i: Proceedings of the Doctoral Consortium at the 15th International Semantic Web Conference (ISWC 2016) Kobe, Japan, October 18, 2016 / [ed] Philippe Cudre-Mauroux, Natasha Noy and Riichiro Mizoguchi, Aachen, Germany: CEUR Workshop Proceedings , 2016, s. 50-57Konferensbidrag, Publicerat paper (Refereegranskat)
    Abstract [en]

    Producing alignments of the highest quality requires ‘humans in the loop’, however, user involvement is currently one of the challenges for the ontology alignment community. Ontology alignment is a cognitively intensive task and could be efficiently supported by user interfaces encompassing well-designed visualizations and interaction techniques. This work investigates the applicationof large, high-resolution displays to improve users’ cognitive support and identifies several promising directions for their application - improving ontologies’ and alignments’ navigation, supporting users’ thinking process and collaboration.

    Ort, förlag, år, upplaga, sidor
    Aachen, Germany: CEUR Workshop Proceedings, 2016
    Serie
    CEUR Workshop Proceedings, ISSN 1613-0073 ; 1733
    Nationell ämneskategori
    Datavetenskap (datalogi)
    Identifikatorer
    urn:nbn:se:liu:diva-134161 (URN)
    Konferens
    Doctoral Consortium at the 15th International Semantic Web Conference, October 18, Kobe, Japan
    Forskningsfinansiär
    CUGS (National Graduate School in Computer Science)Swedish e‐Science Research CenterEU, FP7, Sjunde ramprogrammet, FP7-IP-608142
    Tillgänglig från: 2017-01-26 Skapad: 2017-01-26 Senast uppdaterad: 2018-01-13
    5. Experiences from the Anatomy track in the Ontology Alignment Evaluation Initiative
    Öppna denna publikation i ny flik eller fönster >>Experiences from the Anatomy track in the Ontology Alignment Evaluation Initiative
    2017 (Engelska)Ingår i: Journal of Biomedical Semantics, ISSN 2041-1480, E-ISSN 2041-1480, Vol. 8, artikel-id 56Artikel, forskningsöversikt (Refereegranskat) Published
    Abstract [en]

    Background: One of the longest running tracks in the Ontology Alignment Evaluation Initiative is the Anatomy track which focuses on aligning two anatomy ontologies. The Anatomy track was started in 2005. In 2005 and 2006 the task in this track was to align the Foundational Model of Anatomy and the OpenGalen Anatomy Model. Since 2007 the ontologies used in the track are the Adult Mouse Anatomy and a part of the NCI Thesaurus. Since 2015 the data in the Anatomy track is also used in the Interactive track of the Ontology Alignment Evaluation Initiative.

    Results: In this paper we focus on the Anatomy track in the years 2007-2016 and the Anatomy part of the Interactive track in 2015-2016. We describe the data set and the changes it went through during the years. Further, we give an overview of all systems that participated in the track and the techniques they have used. We discuss the performance results of the systems and summarize the general trends.

    Conclusions: About 50 systems have participated in the Anatomy track. Many different techniques were used. The most popular matching techniques are string-based strategies and structure-based techniques. Many systems also use auxiliary information. The quality of the alignment has increased for the best performing systems since the beginning of the track and more and more systems check the coherence of the proposed alignment and implement a repair strategy.Further, interacting with an oracle is beneficial.

    Ort, förlag, år, upplaga, sidor
    BioMed Central, 2017
    Nyckelord
    ontologies, ontology matching, OAEI, anatomy
    Nationell ämneskategori
    Datavetenskap (datalogi)
    Identifikatorer
    urn:nbn:se:liu:diva-139775 (URN)10.1186/s13326-017-0166-5 (DOI)000416915300001 ()29202830 (PubMedID)
    Forskningsfinansiär
    Swedish e‐Science Research CenterCUGS (National Graduate School in Computer Science)EU, FP7, Sjunde ramprogrammet, FP7-IP-608142
    Anmärkning

    Funding agencies: Swedish e-Science Research Centre (SeRC); Swedish national graduate school in computer science (CUGS); EU project VALCRI [FP7-IP-608142]

    Tillgänglig från: 2017-08-21 Skapad: 2017-08-21 Senast uppdaterad: 2018-01-13
    6. Alignment Cubes: Towards Interactive Visual Exploration and Evaluation of Multiple Ontology Alignments
    Öppna denna publikation i ny flik eller fönster >>Alignment Cubes: Towards Interactive Visual Exploration and Evaluation of Multiple Ontology Alignments
    2017 (Engelska)Ingår i: The Semantic Web – ISWC 2017 16th International Semantic Web Conference, Vienna, Austria, October 21–25, 2017, Proceedings, Part I / [ed] Claudia d'Amato, Miriam Fernandez, Valentina Tamma, Freddy Lecue, Philippe Cudré-Mauroux, Juan Sequeda, Christoph Lange and Jeff Heflin, Cham, Switzerland: Springer Publishing Company, 2017, Vol. 10587, s. 400-417Konferensbidrag, Publicerat paper (Refereegranskat)
    Abstract [en]

    Ontology alignment is an area of active research where many algorithms and approaches are being developed. Their performance is usually evaluated by comparing the produced alignments to a reference alignment in terms of precision, recall and F-measure. These measures, however, only provide an overall assessment of the quality of the alignments, but do not reveal differences and commonalities between alignments at a finer-grained level such as, e.g., regions or individual mappings. Furthermore, reference alignments are often unavailable, which makes the comparative exploration of alignments at different levels of granularity even more important. Making such comparisons efficient calls for a “human-in-the-loop” approach, best supported through interactive visual representations of alignments. Our approach extends a recent tool, Matrix Cubes, used for visualizing dense dynamic networks. We first identify use cases for ontology alignment evaluation that can benefit from interactive visualization, and then detail how our Alignment Cubes support interactive exploration of multiple ontology alignments. We demonstrate the usefulness of Alignment Cubes by describing visual exploration scenarios, showing how Alignment Cubes support common tasks identified in the use cases.

    Ort, förlag, år, upplaga, sidor
    Cham, Switzerland: Springer Publishing Company, 2017
    Serie
    Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 10587
    Serie
    Information Systems and Applications, incl. Internet/Web, and HCI ; 10587
    Nyckelord
    Ontology alignment evaluation, Visual exploration, Multiple alignment comparison
    Nationell ämneskategori
    Datavetenskap (datalogi) Människa-datorinteraktion (interaktionsdesign)
    Identifikatorer
    urn:nbn:se:liu:diva-141986 (URN)10.1007/978-3-319-68288-4_24 (DOI)9783319682877 (ISBN)9783319682884 (ISBN)9783319682884 (ISBN)
    Konferens
    The Semantic Web – ISWC 2017 16th International Semantic Web Conference, Vienna, Austria, October 21–25, 2017
    Forskningsfinansiär
    Swedish e‐Science Research CenterCUGS (National Graduate School in Computer Science)EU, FP7, Sjunde ramprogrammet, P7-IP-608142
    Tillgänglig från: 2017-10-16 Skapad: 2017-10-16 Senast uppdaterad: 2018-11-27Bibliografiskt granskad
  • 173.
    Ivanova, Valentina
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Integration of Ontology Alignment and Ontology Debugging for Taxonomy Networks2014Licentiatavhandling, monografi (Övrigt vetenskapligt)
    Abstract [en]

    Semantically-enabled applications, such as ontology-based search and data integration, take into account the semantics of the input data in their algorithms. Such applications often use ontologies, which model the application domains in question, as well as alignments, which provide information about the relationships between the terms in the different ontologies.

    The quality and reliability of the results of such applications depend directly on the correctness and completeness of the ontologies and alignments they utilize. Traditionally, ontology debugging discovers defects in ontologies and alignments and provides means for improving their correctness and completeness, while ontology alignment establishes the relationships between the terms in the different ontologies, thus addressing completeness of alignments.

    This thesis focuses on the integration of ontology alignment and debugging for taxonomy networks which are formed by taxonomies, the most widely used kind of ontologies, connected through alignments.

    The contributions of this thesis include the following. To the best of our knowledge, we have developed the first approach and framework that integrate ontology alignment and debugging, and allow debugging of modelling defects both in the structure of the taxonomies as well as in their alignments. As debugging modelling defects requires domain knowledge, we have developed algorithms that employ the domain knowledge intrinsic to the network to detect and repair modelling defects.

    Further, a system has been implemented and several experiments with real-world ontologies have been performed in order to demonstrate the advantages of our integrated ontology alignment and debugging approach. For instance, in one of the experiments with the well-known ontologies and alignment from the Anatomy track in Ontology Alignment Evaluation Initiative 2010, 203 modelling defects (concerning incomplete and incorrect information) were discovered and repaired.

  • 174.
    Ivanova, Valentina
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Bach, Benjamin
    University of Edinburgh, United Kingdom.
    Pietriga, Emmanuel
    INRIA, LRI (Univ Paris-Sud & CNRS), Universit ́ e Paris-Saclay, France.
    Lambrix, Patrick
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Alignment Cubes: Interactive Visual Exploration and Evaluation of Multiple Ontology Alignments2017Ingår i: Proceedings of the ISWC 2017 Posters & Demonstrations and Industry Tracks co-located with 16th International Semantic Web Conference (ISWC 2017) / [ed] Nadeschda Nikitina, Dezhao Song, Achille Fokoue, Peter Haase, Aachen, Germany: CEUR Workshop Proceedings , 2017Konferensbidrag (Refereegranskat)
  • 175.
    Ivanova, Valentina
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Bach, Benjamin
    University of Edinburgh, United Kingdom.
    Pietriga, Emmanuel
    INRIA, France.
    Lambrix, Patrick
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Alignment Cubes: Towards Interactive Visual Exploration and Evaluation of Multiple Ontology Alignments2017Ingår i: The Semantic Web – ISWC 2017 16th International Semantic Web Conference, Vienna, Austria, October 21–25, 2017, Proceedings, Part I / [ed] Claudia d'Amato, Miriam Fernandez, Valentina Tamma, Freddy Lecue, Philippe Cudré-Mauroux, Juan Sequeda, Christoph Lange and Jeff Heflin, Cham, Switzerland: Springer Publishing Company, 2017, Vol. 10587, s. 400-417Konferensbidrag (Refereegranskat)
    Abstract [en]

    Ontology alignment is an area of active research where many algorithms and approaches are being developed. Their performance is usually evaluated by comparing the produced alignments to a reference alignment in terms of precision, recall and F-measure. These measures, however, only provide an overall assessment of the quality of the alignments, but do not reveal differences and commonalities between alignments at a finer-grained level such as, e.g., regions or individual mappings. Furthermore, reference alignments are often unavailable, which makes the comparative exploration of alignments at different levels of granularity even more important. Making such comparisons efficient calls for a “human-in-the-loop” approach, best supported through interactive visual representations of alignments. Our approach extends a recent tool, Matrix Cubes, used for visualizing dense dynamic networks. We first identify use cases for ontology alignment evaluation that can benefit from interactive visualization, and then detail how our Alignment Cubes support interactive exploration of multiple ontology alignments. We demonstrate the usefulness of Alignment Cubes by describing visual exploration scenarios, showing how Alignment Cubes support common tasks identified in the use cases.

  • 176.
    Ivanova, Valentina
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Kauppinen, Tomi
    Aalto University, Finland.
    Lohmann, Steffen
    University of Stuttgart, Germany.
    Mazumdar, Suvodeep
    University of Sheffield, UK.
    Pesquita, Catia
    University of Lisbon, Portugal.
    Xu, Kai
    Middlesex University, UK.
    Introduction to VISUAL 2014 - Workshop on Visualizations and User Interfaces for Knowledge Engineering and Linked Data Analytics2015Ingår i: Knowledge Engineering and Knowledge Management: EKAW 2014 Satellite Events, VISUAL, EKM1, and ARCOE-Logic. Revised Selected Papers. / [ed] Lambrix, Hyvönen, Blomqvist, Presutti, Qi, Sattler, Ding, Ghidini, Switzerland: Springer Science+Business Media B.V., 2015, s. 80-82Konferensbidrag (Refereegranskat)
  • 177.
    Ivanova, Valentina
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Kauppinen, TomiAalto University, Finland and University of Bremen, Germany.Lohmann, SteffenUniversity of Stuttgart, Germany.Mazumdar, SuvodeepUniversity of Sheffield, UK.Pesquita, CatiaUniversity of Lisbon, Portuga.Xu, KaiMiddlesex University, UK.
    Proceedings of the International Workshop on Visualizations and User Interfaces for Knowledge Engineering and Linked Data Analytics2014Proceedings (redaktörskap) (Refereegranskat)
  • 178.
    Ivanova, Valentina
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Lambrix, Patrick
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    A system for aligning taxonomies and debugging taxonomies and their alignments2013Ingår i: The Semantic Web: ESWC 2013 Satellite Events, Montpellier, France, May 26-30, 2013, Revised Selected Papers / [ed] Philipp Cimiano, Miriam Fernández, Vanessa Lopez, Stefan Schlobach, Johanna Völker, Springer Berlin/Heidelberg, 2013, s. 152-156Konferensbidrag (Refereegranskat)
    Abstract [en]

    With the increased use of ontologies in semantically-enabled applications,the issues of debugging and aligning ontologies have become increasinglyimportant. The quality of the results of such applications is directly dependent onthe quality of the ontologies and mappings between the ontologies they employ. Akey step towards achieving high quality ontologies and mappings is discoveringand resolving modeling defects, e.g., wrong or missing relations and mappings.In this demonstration paper we present a system for aligning taxonomies, the mostused kind of ontologies, and debugging taxonomies and their alignments, whereontology alignment is treated as a special kind of debugging.

  • 179.
    Ivanova, Valentina
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Lambrix, Patrick
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    A System for Debugging Taxonomies and their Alignments2012Ingår i: Proceedings of First International Workshop on Debugging Ontologies and Ontology Mappings / [ed] Patrick Lambrix, Guilin Qi, Matthew Horridge, Linköping: Linköping University Electronic Press, 2012, s. 37-42Konferensbidrag (Refereegranskat)
    Abstract [en]

    Neither developing ontologies nor aligning ontologies are easy tasks, and often the resulting ontologies and alignments are not consistent or complete. Such ontologies and alignments, although often useful, also lead to problems when used in semantically-enabled applications. In this paper we briefly introduce a system that supports domain experts in detecting and repairing wrong and missing is-a relations and mappings.

  • 180.
    Ivanova, Valentina
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Lambrix, Patrick
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    A unified approach for aligning taxonomies and debugging taxonomies and their alignments2013Ingår i: The Semantic Web: Semantics and Big Data: 10th International Conference, ESWC 2013, Montpellier, France, May 26-30, 2013. Proceedings / [ed] Philipp Cimiano, Oscar Corcho, Valentina Presutti, Laura Hollink, Sebastian Rudolph, Springer Berlin/Heidelberg, 2013, s. 1-15Konferensbidrag (Refereegranskat)
    Abstract [en]

    With the increased use of ontologies in semantically-enabled applications, the issues of debugging and aligning ontologies have become increasingly important. The quality of the results of such applications is directly dependent on the quality of the ontologies and mappings between the ontologies they employ. A key step towards achieving high quality ontologies and mappings is discovering and resolving modeling defects, e.g., wrong or missing relations and mappings. In this paper we present a unified framework for aligning taxonomies, the most used kind of ontologies, and debugging taxonomies and their alignments, where ontology alignment is treated as a special kind of debugging. Our framework supports the detection and repairing of missing and wrong is-a structure in taxonomies, as well as the detection and repairing of missing (alignment) and wrong mappings between ontologies. Further, we implemented a system based on this framework and demonstrate its benefits through experiments with ontologies from the Ontology Alignment Evaluation Initiative.

  • 181.
    Ivanova, Valentina
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Lambrix, Patrick
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    User Involvement for Large-Scale Ontology Alignment2014Ingår i: International Workshop on Visualizations and User Interfaces for Knowledge Engineering and Linked Data Analytics / [ed] Valentina Ivanova, Tomi Kauppinen, Steffen Lohmann, Suvodeep Mazumdar, Catia Pesquita, Kai Xu, 2014, s. 34-47Konferensbidrag (Refereegranskat)
  • 182.
    Ivanova, Valentina
    et al.
    RISE Research Institutes of Sweden.
    Lambrix, Patrick
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Lohmann, Steffen
    Fraunhofer IAIS, Germany.
    Pesquita, Catia
    University of Lisbon, Portugal.
    Visualization and interaction for ontologies and linked data - Editorial2019Ingår i: Journal of Web Semantics, ISSN 1570-8268, E-ISSN 1873-7749, Vol. 55, s. 145-149Artikel i tidskrift (Övrigt vetenskapligt)
    Publikationen är tillgänglig i fulltext från 2020-10-20 08:26
  • 183.
    Ivanova, Valentina
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Lambrix, PatrickLinköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.Lohmann, SteffenUniversity of Stuttgart, Germany.Pesquita, CatiaUniversity of Lisbon, Portugal.
    VOILA 2015 Visualizations and User Interfaces for Ontologies and Linked Data: Proceedings of the International Workshop on Visualizations and User Interfaces for Ontologies and Linked Data2015Proceedings (redaktörskap) (Refereegranskat)
    Abstract [en]

    A picture is worth a thousand words, we often say, yet many areas are in demand of sophisticated visualization techniques, and the Semantic Web is not an exception. The size and complexity of ontologies and Linked Data in the Semantic Web constantly grow and the diverse backgrounds of the users and application areas multiply at the same time. Providing users with visual representations and intuitive user interfaces can significantly aid the understanding of the domains and knowledge represented by ontologies and Linked Data. There is noone size fits all solution but different use cases demand different visualization and interaction techniques. Ultimately, providing better user interfaces and visual representations will foster user engagement and likely lead to higher quality results in different applications employing ontologies and to the proliferation of Linked Data usage.

    User interfaces are essential to easily provide access to the increasing diversity of knowledge modeled in ontologies. As ontologies grow in size and complexity, the demand for comprehensive visualization and sophisticated interaction also rises. In particular, user interfaces are an integral part of ontology engineering, to help bridge the gap between domain experts and ontology engineers. Ontology visualization is not a new topic and a number of approaches have become available in recent years, with some being already well-established, particularly in the field of ontology modeling. In other areas of ontology engineering, such as ontology alignment and debugging, although several tools have recently been  developed, few provide a graphical user interface, not to mention navigational aids or comprehensive visualization techniques.

    While ontology users usually possess domain and/or knowledge representation expertise, this is not necessarily the case with potential Linked Data consumers who can come from very different backgrounds and have varying levels of expertise. Currently, the main Linked Data consumers are technology experienced users, one of the reasons being the lack of appropriate user interfaces and visualizations to support other user groups. Visual approaches are needed to assist various kinds of users, who pursue diverse goals and pose individual requirements.

    In the presence of a huge network of interconnected resources, one of the challenges faced by the Linked Data community is the visualization of the multidimensional datasets to provide for efficient overview, exploration and querying tasks, to mention just a few. With the focus shifting from a Web of Documents to a Web of Data, changes in the interaction paradigms are in demand as well. Novel approaches also need to take into consideration the technological challenges and opportunities given by new interaction contexts, ranging from mobile and touch interaction to visualizations on large displays, and encompassing highly responsive web applications.

    The VOILA! workshop addressed these and related issues in its call for papers and attracted 18 submissions in different paper categories. Three reviewers were assigned to each submission. Based on their reviews we selected 12 contributions for presentation at the workshop in the following categories: full research papers (5), position papers (2) and short papers (5).

    The first edition of VOILA! is co-located with the 14th International Semantic Web Conference (ISWC 2015) and will take place as a full day event on October 11, 2015 in Bethlehem, Pennsylvania, USA. It will be organized around paper presentations and discussions and will be accompanied by interactive software demonstrations, giving developers a chance to gather feedback from the community.

    We thank all authors for their submissions and all members of the VOILA! program committee for their useful reviews and comments. We are grateful to Miriam Fernandez and Krzysztof Janowicz, the ISWC workshop chairs, for their continuous support during theworkshop organization. The workshop would not be possible without all of you!

    September 2015

    Valentina Ivanova, Patrick Lambrix, Steffen Lohmann, Catia Pesquita

  • 184.
    Ivanova, Valentina
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Lambrix, PatrickLinköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.Lohmann, SteffenFraunhofer IAIS, Germany.Pesquita, CatiaUniversity of Lisbon, Portugal .
    VOILA! 2016: Proceedings of the 2nd International Workshop on Visualization and Interaction for Ontologies and Linked Data, Co-located with ISWC 2016, Kobe, Japan, October 17, 20162016Proceedings (redaktörskap) (Refereegranskat)
    Abstract [en]

    A picture is worth a thousand words, we often say, yet many areas are in demand of sophisticated visualization techniques, and the Semantic Web is not an exception. The size and complexity of ontologies and Linked Data in the Semantic Web constantly grows and the diverse backgrounds of the users and application areas multiply at the same time. Providing users with visual representations and intuitive interaction techniques can significantly aid the exploration and understanding of the domains and knowledge represented by ontologies and Linked Data.

    Ontology visualization is not a new topic and a number of approaches have become available in recent years, with some being already well-established, particularly in the field of ontology modeling. In other areas of ontology engineering, such as ontology alignment and debugging, although several tools have recently been developed, few provide a graphical user interface, not to mention navigational aids or comprehensive visualization and interaction techniques.

    In the presence of a huge network of interconnected resources, one of the challenges faced by the Linked Data community is the visualization of multidimensional datasets to provide for efficient overview, exploration and querying tasks, to mention just a few. With the focus shifting from a Web of Documents to a Web of Data, changes in the interaction paradigms are in demand as well. Novel approaches also need to take into consideration the technological challenges and opportunities given by new interaction contexts, ranging from mobile, touch, and gesture interaction to visualizations on large displays, and encompassing highly responsive web applications.

    There is no one-size-fits-all solution but different use cases demand different visualization and interaction techniques. Ultimately, providing better user interfaces, visual representations and interaction techniques will foster user engagement and likely lead to higher quality results in different applications employing ontologies and proliferate the consumption of Linked Data.

    These and related issues are addressed by the VOILA! workshop series concerned with Visualization and Interaction for Ontologies and Linked Data. The second edition of VOILA! is co-located with the 15th International Semantic Web Conference (ISWC 2016) and will take place as a full day event on October 17, 2016 in Kobe, Japan. It will be organized around scientific paper presentations and discussions, and will be accompanied by interactive software demonstrations, giving developers a chance to gather feedback from the community.

    The call for papers for VOILA! 2016 attracted 22 submissions in different paper categories. Three reviewers were assigned to each submission. Based on the reviews, we selected 15 contributions for presentation at the workshop in the following categories: full papers (7), system papers (2), short papers (2), demo papers (4).

    We thank all authors for their submissions and all members of the VOILA! program committee for their useful reviews and comments. We are also grateful to Chiara Ghidini and Heiner Stuckenschmidt, the workshop chairs of ISWC 2016, for their continuous support during the workshop organization.

    October 2016

    Valentina Ivanova, Patrick Lambrix, Steffen Lohmann, Catia Pesquita

  • 185.
    Ivanova, Valentina
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Lambrix, PatrickLinköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.Lohmann, SteffenFraunhofer IAIS, Germany .Pesquita, CatiaUniversity of Lisbon, Portugal .
    VOILA! 2017: Proceedings of the Third International Workshop on Visualization and Interaction for Ontologies and Linked Data: co-located with the 16th International Semantic Web Conference, Vienna, Austria, October 22, 2017.2017Proceedings (redaktörskap) (Refereegranskat)
    Abstract [en]

    A picture is worth a thousand words, we often say, yet many areas are in demand of sophisticated visualization techniques, and the Semantic Web is not an exception. The size and complexity of ontologies and Linked Data in the Semantic Web constantly grows and the diverse backgrounds of the users and application areas multiply at the same time. Providing users with visual representations and intuitive interaction techniques can significantly aid the exploration and understanding of the domains and knowledge representedby ontologies and Linked Data.

    Ontology visualization is not a new topic and a number of approaches have become available in recent years, with some being already well-established, particularly in the field of ontology modeling. In other areas of ontology engineering, such as ontology alignment and debugging, although several tools have recently been developed, few provide a graphical user interface, not to mention navigational aids or comprehensive visualization and interaction techniques.

    In the presence of a huge network of interconnected resources, one of the challenges facedby the Linked Data community is the visualization of multidimensional datasets to provide for efficient overview, exploration and querying tasks, to mention just a few. With the focus shifting from a Web of Documents to a Web of Data, changes in the interaction paradigms are in demand as well. Novel approaches also need to take into consideration the technological challenges and opportunities given by new interaction contexts, ranging from mobile, touch, and gesture interaction to visualizations on large displays, and encompassing highly responsive web applications.

    There is no one-size-fits-all solution but different use cases demand different visualizationand interaction techniques. Ultimately, providing better user interfaces, visual representations and interaction techniques will foster user engagement and likely lead to higher quality results in different applications employing ontologies and proliferate the consumption of Linked Data.

    These and related issues are addressed by the VOILA! workshop series concerned with Vi-sualization and Interaction for Ontologies and Linked Data. The third edition of VOILA! is co-located with the 16th International Semantic Web Conference (ISWC 2017) and will take place as a full day event on October 22, 2017 in Vienna, Austria. It will be organized around scientific paper presentations and discussions, and will be accompanied by interactive software demonstrations, giving developers a chance to gather feedback from the community.

    The call for papers for VOILA! 2017 attracted 20 submissions in different paper categories. At least three reviewers were assigned to each submission. Based on the reviews, we selected 13 contributions for presentation at the workshop in the following categories: full papers (10), position papers (2) and experience papers (1).

    We thank all authors for their submissions and all members of the VOILA! program committee for their useful reviews and comments. We are also grateful to Aidan Hogan and Valentina Presutti, the workshop chairs of ISWC 2017, for their continuous support during the workshop organization.

    September 2017

    Valentina Ivanova, Patrick Lambrix, Steffen Lohmann, Catia Pesquita

  • 186.
    Ivanova, Valentina
    et al.
    RISE Research Institutes of Sweden.
    Lambrix, PatrickLinköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.Lohmann, SteffenFraunhofer IAIS, Germany .Pesquita, CatiaUniversity of Lisbon, Portugal .
    VOILA 2018 Visualization and Interaction for Ontologies and Linked Data: Proceedings of the Fourth International Workshop on Visualization and Interaction for Ontologies and Linked Data co-located with the 17th International Semantic Web Conference (ISWC 2018)2018Proceedings (redaktörskap) (Refereegranskat)
    Abstract [en]

    A picture is worth a thousand words, we often say, yet many areas are in demand of sophisticated visualization techniques, and the Semantic Web is not an exception. The size and complexity of ontologies and Linked Data in the Semantic Web constantly grows and the diverse backgrounds of the users and application areas multiply at the same time. Providing users with visual representations and intuitive interaction techniques can significantly aid the exploration and understanding of the domains and knowledge represented by ontologies and Linked Data.

    Ontology visualization is not a new topic and a number of approaches have become available in recent years, with some being already well-established, particularly in the field of ontology modeling. In other areas of ontology engineering, such as ontology alignment and debugging, although several tools have been developed, few provide a graphical user interface, not to mention navigational aids or comprehensive visualization and interaction techniques.

    In the presence of a huge network of interconnected resources, one of the challenges faced by the Linked Data community is the visualization of multidimensional datasets to provide for efficient overview, exploration and querying tasks, to mention just a few. With the focus shifting from a Web of Documents to a Web of Data, changes in the interaction paradigms are in demand as well. Novel approaches also need to take into consideration the technological challenges and opportunities given by new interaction contexts, ranging from mobile, touch, and gesture interaction to visualizations on large displays, and encompassing highly responsive web applications.

    There is no one-size-fits-all solution but different use cases demand different visualization and interaction techniques. Ultimately, providing better user interfaces, visual representations and interaction techniques will foster user engagement and likely lead to higher quality results in different applications employing ontologies and proliferate the consumption of Linked Data.

    Special Theme & Topics of Interest

    This year, we plan to have a dedicated look on empirical evidence on the benefits and limitations of visualizations and interactions in the context of the Semantic Web. We are particularly interested in success and failure stories, in learning which visualization and interaction approaches work and which do not - to which extent and in which contexts. We would like to hear about novel research findings and insights, backed with empirical data from user studies and use cases. Submissions addressing this special theme could include one or more of the following:

    • success stories
    • failure stories
    • empirical studies

    We also welcome other research contributions providing empirical evidence that advances the field.

    Apart from that - and as in the last years -, we are looking for submissions addressing one or more of the following topics, subjects, and contexts (or related ones):

    • Topics:
      • visualizations
      • user interfaces
      • visual analytics
      • requirements analysis
      • case studies
      • user evaluations
      • cognitive aspects
    • Subjects:
      • ontologies
      • linked data
      • ontology engineering (development, collaboration, ontology design patterns, alignment, debugging, evolution, provenance, etc.)
    • Contexts:
      • classical interaction contexts (desktop, keyboard, mouse, etc.)
      • novel interaction contexts (mobile, touch, gesture, etc.)
      • special settings (large, high-resolution, and multiple displays, etc.)
      • specific user groups and needs (people with disabilities, domain experts, etc.)
  • 187.
    Ivanova, Valentina
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Lambrix, Patrick
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Åberg, Johan
    Linköpings universitet, Institutionen för datavetenskap, Interaktiva och kognitiva system. Linköpings universitet, Tekniska fakulteten.
    Requirements for and Evaluation of User Support for Large-Scale Ontology Alignment2015Ingår i: The Semantic Web. Latest Advances and New Domains: 12th European Semantic Web Conference, ESWC 2015, Portoroz, Slovenia, May 31 -- June 4, 2015. Proceedings, Springer Science+Business Media B.V., 2015, s. 3-20Konferensbidrag (Refereegranskat)
    Abstract [en]

    Currently one of the challenges for the ontology alignment community is the user involvement in the alignment process. At the same time, the focus of the community has shifted towards large-scale matching which introduces an additional dimension to this issue. This paper aims to provide a set of requirements that foster the user involvement for large-scale ontology alignment tasks.Further, we present and discuss the results of a literature study for 7 ontology alignments systems as well as a heuristic evaluation and an observational user study for 3 ontology alignment systems to reveal the coverage of the requirements in the systems and the support for the requirements in the user interfaces.

  • 188.
    Ivanova, Valentina
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Laurila Bergman, Jonas
    Division of Information Technology, National Food Agency, Uppsala, Sweden.
    Hammerling, Ulf
    Department of Risk Benefit Assessment, National Food Agency, Uppsala, Sweden.
    Lambrix, Patrick
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Debugging Taxonomies and their Alignments: the ToxOntology - MeSH Use Case2012Ingår i: Proceedings of the First International Workshop on Debugging Ontologies and Ontology Mappings / [ed] Patrick Lambrix, Guilin Qi, Matthew Horridge, Linköping University Electronic Press, 2012, s. 25-36Konferensbidrag (Refereegranskat)
    Abstract [en]

    As part of an initiative to facilitate adequate identification and display of substance-associated health effects a toxicological ontology - ToxOntology - was created. Further, an alignent with MeSH was accomplished to obtain an indirect index to the scientific literature.

    To arrive at satisfactory results in the semantically-enabled applications, high-quality ontologies and alignments are both necessary. A key step towards high quality in this area is debugging the ontologies and their alignments. In this paper we present an experience report on the debugging of ToxOntology and MeSH as well as an alignment.

  • 189.
    Ivanova, Valentina
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Strömbäck, Lena
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Creating Infrastructure for Tool-Independent Querying and Exploration of Scientific Workflows2011Ingår i: 7th IEEE International Conference on e-Science, IEEE , 2011, s. 287-294Konferensbidrag (Refereegranskat)
    Abstract [en]

    Many scientific experiments produce an enormous amount of data that needs to be explored. Scientific workflows and tools for managing workflows have been designed to streamline the computational processes that manipulate this data, from acquisition to analysis. However, the fact that each system has its own workflow format has greatly hampered efficient sharing and re-use. To address this problem, we propose a general model for workflows, based on OPM, which combines features from popular scientific workflow systems. We use this model to build infrastructure that supports system-agnostic workflow repositories. We describe the implementation of the infrastructure and present an experimental evaluation of its performance. We show that the proposed model and its implementation provide efficient support for queries over large repositories.

  • 190.
    Jakoniené, Vaida
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Lambrix, Patrick
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    A tool for evaluating strategies for grouping of biological data2006Ingår i: Seventh Swedish Bioinformatics Workshop for PhD students and PostDocs,2006, 2006, s. 23-24Konferensbidrag (Övrigt vetenskapligt)
  • 191.
    Jakoniené, Vaida
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Lambrix, Patrick
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Information integration systems for biological data source requirements and opportunities2006Rapport (Övrig (populärvetenskap, debatt, mm))
  • 192.
    Jakoniené, Vaida
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Lambrix, Patrick
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Ontology-based integration for bioinformatics2005Ingår i: Proceedings of the VLDB Workshop on Ontologies-bases techniques for DataBases and Information Systems - ODBIS, 2005, s. 55-58Konferensbidrag (Refereegranskat)
    Abstract [en]

    Information integration systems support researchers in bioinformatics to retrieve data from multiple biological data sources. In this paper we argue that the current approaches should be enhanced by ontological knowledge. We identify the dierent types of ontological knowledge that are available on the Web and propose an approach to use this knowledge to support integrated access to multiple biological data sources. We also show that current ontology-based integration approaches only cover parts of our approach.

     

  • 193.
    Jakoniené, Vaida
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Lambrix, Patrick
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Tool for Evaluating Strategies for Grouping of Biological Data2007Ingår i: Journal of Integrative Bioinformatics, ISSN 1613-4516, Vol. 4, nr 3Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    During the last decade an enormous amount of biological data has been generated and techniques and tools to analyze this data have been developed. Many of these tools use some form of grouping and are used in, for instance, data integration, data cleaning, prediction of protein functionality, and correlation of genes based on microarray data. A number of aspects influence the quality of the grouping results: the data sources, the grouping attributes and the algorithms implementing the grouping procedure. Many methods exist, but it is often not clear which methods perform best for which grouping tasks. The study of the properties, and the evaluation and the comparison of the different aspects that influence the quality of the grouping results, would give us valuable insight in how the grouping procedures could be used in the best way. It would also lead to recommendations on how to improve the current procedures and develop new procedures. To be able to perform such studies and evaluations we need environments that allow us to compare and evaluate different grouping strategies. In this paper we present a framework, KitEGA, for such an environment, and present its current prototype implementation. We illustrate its use by comparing grouping strategies for classifying proteins regarding biological function and isozymes.

  • 194.
    Jakoniené, Vaida
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Rundqvist, David
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik.
    Lambrix, Patrick
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    A Method for Similarity-Based Grouping of Biological Data2006Ingår i: DILS: International Workshop on Data Integration in the Life Sciences Data Integration in the Life Sciences Third International Workshop, DILS 2006, Hinxton, UK, July 20-22, 2006. Proceedings / [ed] Ulf Leser, Felix Naumann, Barbara Eckman, Springer Berlin/Heidelberg, 2006, s. 136-151Konferensbidrag (Refereegranskat)
    Abstract [en]

    Similarity-based grouping of data entries in one or more data sources is a task underlying many different data management tasks, such as, structuring search results, removal of redundancy in databases and data integration. Similarity-based grouping of data entries is not a trivial task in the context of life science data sources as the stored data is complex, highly correlated and represented at different levels of granularity. The contribution of this paper is two-fold. 1) We propose a method for similarity-based grouping and 2) we show results from test cases. As the main steps the method contains specification of grouping rules, pairwise grouping between entries, actual grouping of similar entries, and evaluation and analysis of the results. Often, different strategies can be used in the different steps. The method enables exploration of the influence of the choices and supports evaluation of the results with respect to given classifications. The grouping method is illustrated by test cases based on different strategies and classifications. The results show the complexity of the similarity-based grouping tasks and give deeper insights in the selected grouping tasks, the analyzed data source, and the influence of different strategies on the results.

  • 195.
    James, Cyriac
    et al.
    University of Calgary.
    Carlsson, NIklas
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Green Domino Incentives: Impact of Energy-aware Adaptive Link Rate Policies in Routers2015Ingår i: Proc. ACM/SPEC International Conference on Performance Engineering (ACM/SPEC ICPE), Association for Computing Machinery (ACM), 2015, s. 211-221Konferensbidrag (Refereegranskat)
    Abstract [en]

    To reduce energy consumption of lightly loaded routers, operators are increasingly incentivized to use Adaptive Link Rate (ALR) policies and techniques. These techniques typically save energy by adapting link service rates or by identifying opportune times to put interfaces into low-power sleep/idle modes. In this paper, we present a trace-based analysis of the impact that a router implementing these techniques has on the neighboring routers. We show that policies adapting the service rate at larger time scales, either by changing the service rate of the link interface itself or by changing which redundant heterogeneous link is active, typically have large positive effects on neighboring routers, with the downstream routers being able to achieve up-to 30% additional energy savings due to the upstream routers implementing ALR policies. Policies that save energy by temporarily placing the interface in a low-power sleep/idle mode, typically has smaller, but positive, impact on neighboring routers. Best are hybrid policies that use a combination of these two techniques. The hybrid policies consistently achieve the biggest energy savings, and have positive cascading effects on surrounding routers. Our results show that implementation of ALR policies can contribute to large-scale positive domino incentive effects, as they further increase the potential energy savings seen by those neighboring routers that consider implementing ALR techniques, while satisfying performance guarantees on the routers themselves.

  • 196.
    Janowicz, Krzysztof
    et al.
    University of California, USA.
    Schlobach, StefanVrije Universiteit Amsterdam, The Netherlands.Lambrix, PatrickLinköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.Hyvönen, EeroAalto University, Finland.
    Knowledge Engineering and Knowledge Management: 19th International Conference, EKAW 2014, Linköping, Sweden, November 24-28, 2014, Proceedings2014Proceedings (redaktörskap) (Refereegranskat)
  • 197.
    Jimenez-Ruiz, Ernesto
    et al.
    The Alan Turing Institute, London, United Kingdom; University of Oslo, Norway.
    Saveta, Tzanina
    Institute of Computer Science - FORTH, Greece.
    Zamazal, Ondrej
    University of Economics, Prague, Czech Republic.
    Hertling, Sven
    University of Mannheim, Germany.
    Röder, Michael
    Paderborn University, Germany.
    Fundulaki, Irini
    Institute of Computer Science - FORTH, Greece.
    Ngonga Ngomo, Axel-Cyrille
    Paderborn University, Germany.
    Sherif, Mohamed Ahmed
    Paderborn University, Germany.
    Annane, Amina
    Ecole nationale Superieure d’Informatique, Alger, Algerie; Université de Montpellier, France.
    Bellahsene, Zohra
    Université de Montpellier, France.
    Ben Yahia, Sadok
    Université de Tunis El Manar. Tunisia.
    Diallo, Gayo
    University of Bordeaux, France.
    Faria, Daniel
    Instituto Gulbenkian de Ciˆencia, Portugal.
    Kachroudi, Marouen
    University of Bordeaux, France.
    Khiat, Abderrahmane
    Freie Universitat Berlin, Germany.
    Lambrix, Patrick
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Li, Huanyu
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Mackeprang, Maximilian
    Freie Universitat Berlin, Germany.
    Mohammadi, Majid
    Delft University of Technology, The Netherlands.
    Rybinski, Maciej
    University of Malaga, Spain.
    Sowkarthiga Balasubramani, Booma
    University of Illinois at Chicago, USA.
    Trojahn, Cassia
    Institut de Recherche en Informatique de Toulouse, France.
    Introducing the HOBBIT platform into the Ontology Alignment Evaluation Campaign2018Ingår i: Proceedings of the 13th International Workshop on Ontology Matching: co-located with the 17th International Semantic Web Conference (ISWC 2018) / [ed] Pavel Shvaiko, Jérôme Euzenat, Ernesto Jiménez-Ruiz, Michelle Cheatham, Oktie Hassanzadeh, Aachen, Germany: CEUR Workshop Proceedings , 2018, Vol. 2288, s. 49-60Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper describes the Ontology Alignment Evaluation Initiative 2017.5 pre-campaign. Like in 2012, when we transitioned the evaluation to the SEALS platform, we have also conducted a pre-campaign to assess the feasibility of moving to the HOBBIT platform. We report the experiences of this pre-campaign and discuss the future steps for the OAEI.

  • 198.
    Johansson, Philip
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik.
    Blomqvist, Niklas
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik.
    An Approach to Achieve DBMS Vendor Independence for Ides AB's Platform2017Självständigt arbete på grundnivå (högskoleexamen), 10,5 poäng / 16 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Software that is developed with few integration capabilities to different user interfaces or database vendors might lose market share in the long run. To stay competitive, companies that find themselves in situations like these might need to look at options to increase their alternatives. This thesis aims to present and evaluate how Ides AB could achieve vendor independence as it relates to database integration.The proposed solution is based on pre-existing code from an existing product and thus includes theory about the methods and details how one can read, understand and analyse code. The outcome is presented with code examples to give the reader a clear and concise understanding. In the evaluation phase, we take other related work into consideration as it relates to our thesis focus. The proposed approach presented consists of a class to represent different database vendors. It also consists of abstract functions handling the interaction between different databases. Which database the class interacts with is determined by the connection established. The approach also includes what is possible to make database agnostic verified by an evaluation.

  • 199.
    Jägenstedt, Gabriel
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Analysis and Simulation of Threats in an Open, Decentralized, Distributed Spam Filtering System2012Självständigt arbete på grundnivå (kandidatexamen), 10,5 poäng / 16 hpStudentuppsats (Examensarbete)
    Abstract [en]

    The existance of spam email has gone from a fairly small amounts of afew hundred in the late 1970’s to several billions per day in 2010. Thiscontinually growing problem is of great concern to both businesses andusers alike.One attempt to combat this problem comes with a spam filtering toolcalled TRAP. The primary design goal of TRAP is to enable tracking ofthe reputation of mail senders in a decentralized and distributed fashion.In order for the tool to be useful, it is important that it does not haveany security issues that will let a spammer bypass the protocol or gain areputation that it should not have.As a piece of this puzzle, this thesis makes an analysis of TRAP’s protocoland design in order to find threats and vulnerabilies capable of bypassingthe protocol safeguards. Based on these threats we also evaluate possiblemitigations both by analysis and simulation. We have found that althoughthe protocol was not designed with regards to certain attacks on the systemitself most of the attacks can be fairly easily stopped.The analysis shows that by adding cryptographic defenses to the protocola lot of the threats would be mitigated. In those cases where cryptographywould not suffice it is generally down to sane design choices in the implementationas well as not always trusting that a node is being truthful andfollowing protocol.

  • 200.
    Kargén, Ulf
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Scalable Dynamic Analysis of Binary Code2019Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    In recent years, binary code analysis, i.e., applying program analysis directly at the machine code level, has become an increasingly important topic of study. This is driven to a large extent by the information security community, where security auditing of closed-source software and analysis of malware are important applications. Since most of the high-level semantics of the original source code are lost upon compilation to executable code, static analysis is intractable for, e.g., fine-grained information flow analysis of binary code. Dynamic analysis, however, does not suffer in the same way from reduced accuracy in the absence of high-level semantics, and is therefore also more readily applicable to binary code. Since fine-grained dynamic analysis often requires recording detailed information about every instruction execution, scalability can become a significant challenge. In this thesis, we address the scalability challenges of two powerful dynamic analysis methods whose widespread use has, so far, been impeded by their lack of scalability: dynamic slicing and instruction trace alignment. Dynamic slicing provides fine-grained information about dependencies between individual instructions, and can be used both as a powerful debugging aid and as a foundation for other dynamic analysis techniques. Instruction trace alignment provides a means for comparing executions of two similar programs and has important applications in, e.g., malware analysis, security auditing, and plagiarism detection. We also apply our work on scalable dynamic analysis in two novel approaches to improve fuzzing — a popular random testing technique that is widely used in industry to discover security vulnerabilities.

    To use dynamic slicing, detailed information about a program execution must first be recorded. Since the amount of information is often too large to fit in main memory, existing dynamic slicing methods apply various time-versus-space trade-offs to reduce memory requirements. However, these trade-offs result in very high time overheads, limiting the usefulness of dynamic slicing in practice. In this thesis, we show that the speed of dynamic slicing can be greatly improved by carefully designing data structures and algorithms to exploit temporal locality of programs. This allows avoidance of the expensive trade-offs used in earlier methods by accessing recorded runtime information directly from secondary storage without significant random-access overhead. In addition to being a standalone contribution, scalable dynamic slicing also forms integral parts of our contributions to fuzzing. Our first contribution uses dynamic slicing and binary code mutation to automatically turn an existing executable into a test generator. In our experiments, this new approach to fuzzing achieved about an order of magnitude better code coverage than traditional mutational fuzzing and found several bugs in popular Linux software. The second work on fuzzing presented in this thesis uses dynamic slicing to accelerate the state-of-the-art fuzzer AFL by focusing the fuzzing effort on previously unexplored parts of the input space.

    For the second dynamic analysis technique whose scalability we sought to improve — instruction trace alignment — we employed techniques used in speech recognition and information retrieval to design what is, to the best of our knowledge, the first general approach to aligning realistically long program traces. We show in our experiments that this method is capable of producing meaningful alignments even in the presence of significant syntactic differences stemming from, for example, the use of different compilers or optimization levels.

    Delarbeten
    1. Efficient Utilization of Secondary Storage for Scalable Dynamic Slicing
    Öppna denna publikation i ny flik eller fönster >>Efficient Utilization of Secondary Storage for Scalable Dynamic Slicing
    2014 (Engelska)Ingår i: Proceedings of the 2014 IEEE 14th International Working Conference on Source Code Analysis and Manipulation / [ed] Randall Bilof, IEEE , 2014, s. 155-164Konferensbidrag, Publicerat paper (Refereegranskat)
    Abstract [en]

    Dynamic program slicing is widely recognized as a powerful aid for e.g. Program comprehension during debugging. However, its widespread use has been impeded in part by scalability issues that occur when constructing the dynamic dependence graph necessary to compute dynamic slices. A few seconds of execution time on a modern CPU can easily yield dynamic dependence graphs on the order of tens of gigabytes in size. Existing methods either produce imprecise slices, incur large time overheads during slice computation, or run out of memory for long program executions. By carefully designing our method to take advantage of locality, we are able to efficiently use secondary storage for dynamic dependence graphs, thus allowing our method to scale to long program executions. Our prototype implementation runs directly on x86 executables, eliminating problems with e.g. Binary-only libraries. We show in our experiments that graphs can be constructed for program runs with billions of executed instructions, at slowdowns ranging from 62x to 173x. Our optimized format also allows graphs to be traversed at speeds of several million dependence edges per second.

    Ort, förlag, år, upplaga, sidor
    IEEE, 2014
    Nyckelord
    binary analysis, debugging, dynamic dependence graph, dynamic slicing, x86
    Nationell ämneskategori
    Datavetenskap (datalogi)
    Identifikatorer
    urn:nbn:se:liu:diva-117289 (URN)10.1109/SCAM.2014.24 (DOI)000358876700020 ()978-0-7695-5304-7 (ISBN)
    Konferens
    14th IEEE International Working Conference on Source Code Analysis and Manipulation, Victoria, British Columbia, Canada, September 28-29, 2014
    Tillgänglig från: 2015-04-22 Skapad: 2015-04-22 Senast uppdaterad: 2019-08-16
    2. Towards Robust Instruction-Level Trace Alignment of Binary Code
    Öppna denna publikation i ny flik eller fönster >>Towards Robust Instruction-Level Trace Alignment of Binary Code
    2017 (Engelska)Ingår i: PROCEEDINGS OF THE 2017 32ND IEEE/ACM INTERNATIONAL CONFERENCE ON AUTOMATED SOFTWARE ENGINEERING (ASE17), IEEE , 2017, s. 342-352Konferensbidrag, Publicerat paper (Refereegranskat)
    Abstract [en]

    Program trace alignment is the process of establishing a correspondence between dynamic instruction instances in executions of two semantically similar but syntactically different programs. In this paper we present what is, to the best of our knowledge, the first method capable of aligning realistically long execution traces of real programs. To maximize generality, our method works entirely on the machine code level, i.e. it does not require access to source code. Moreover, the method is based entirely on dynamic analysis, which avoids the many challenges associated with static analysis of binary code, and which additionally makes our approach inherently resilient to e.g. static code obfuscation. Therefore, we believe that our trace alignment method could prove to be a useful aid in many program analysis tasks, such as debugging, reverse-engineering, investigating plagiarism, and malware analysis. We empirically evaluate our method on 11 popular Linux programs, and show that it is capable of producing meaningful alignments in the presence of various code transformations such as optimization or obfuscation, and that it easily scales to traces with tens of millions of instructions.

    Ort, förlag, år, upplaga, sidor
    IEEE, 2017
    Serie
    IEEE ACM International Conference on Automated Software Engineering, ISSN 1527-1366
    Nationell ämneskategori
    Datavetenskap (datalogi)
    Identifikatorer
    urn:nbn:se:liu:diva-143959 (URN)10.1109/ASE.2017.8115647 (DOI)000417469700038 ()978-1-5386-2684-9 (ISBN)978-1-5386-3976-4 (ISBN)
    Konferens
    32nd IEEE/ACM International Conference on Automated Software Engineering (ASE)
    Tillgänglig från: 2017-12-29 Skapad: 2017-12-29 Senast uppdaterad: 2019-08-16
    3. Turning programs against each other: high coverage fuzz-testing using binary-code mutation and dynamic slicing
    Öppna denna publikation i ny flik eller fönster >>Turning programs against each other: high coverage fuzz-testing using binary-code mutation and dynamic slicing
    2015 (Engelska)Ingår i: 2015 10TH JOINT MEETING OF THE EUROPEAN SOFTWARE ENGINEERING CONFERENCE AND THE ACM SIGSOFT SYMPOSIUM ON THE FOUNDATIONS OF SOFTWARE ENGINEERING (ESEC/FSE 2015) PROCEEDINGS, New York, NY, USA: Association for Computing Machinery (ACM), 2015, s. 782-792Konferensbidrag, Publicerat paper (Refereegranskat)
    Abstract [en]

    Mutation-based fuzzing is a popular and widely employed black-box testing technique for finding security and robustness bugs in software. It owes much of its success to its simplicity; a well-formed seed input is mutated, e.g. through random bit-flipping, to produce test inputs. While reducing the need for human effort, and enabling security testing even of closed-source programs with undocumented input formats, the simplicity of mutation-based fuzzing comes at the cost of poor code coverage. Often millions of iterations are needed, and the results are highly dependent on configuration parameters and the choice of seed inputs. In this paper we propose a novel method for automated generation of high-coverage test cases for robustness testing. Our method is based on the observation that, even for closed-source programs with proprietary input formats, an implementation that can generate well-formed inputs to the program is typically available. By systematically mutating the program code of such generating programs, we leverage information about the input format encoded in the generating program to produce high-coverage test inputs, capable of reaching deep states in the program under test. Our method works entirely at the machine-code level, enabling use-cases similar to traditional black-box fuzzing. We have implemented the method in our tool MutaGen, and evaluated it on 7 popular Linux programs. We found that, for most programs, our method improves code coverage by one order of magnitude or more, compared to two well-known mutation-based fuzzers. We also found a total of 8 unique bugs.

    Ort, förlag, år, upplaga, sidor
    New York, NY, USA: Association for Computing Machinery (ACM), 2015
    Nyckelord
    Fuzz testing, fuzzing, black-box, dynamic slicing, program mutation
    Nationell ämneskategori
    Datavetenskap (datalogi)
    Identifikatorer
    urn:nbn:se:liu:diva-128810 (URN)10.1145/2786805.2786844 (DOI)000382568700067 ()978-1-4503-3675-8 (ISBN)
    Konferens
    10th Joint Meeting on Foundations of Software Engineering
    Tillgänglig från: 2016-05-31 Skapad: 2016-05-31 Senast uppdaterad: 2019-08-16
    4. Speeding Up Bug Finding using Focused Fuzzing
    Öppna denna publikation i ny flik eller fönster >>Speeding Up Bug Finding using Focused Fuzzing
    2019 (Engelska)Ingår i: Proceedings of the 13th International Conference on Availability, Reliability and Security, ACM Digital Library, 2019, artikel-id 7Konferensbidrag, Publicerat paper (Refereegranskat)
    Abstract [en]

    Greybox fuzzing has recently emerged as a scalable and practical approach to finding security bugs in software. For example, AFL — the current state-of-the-art greybox fuzzer — has found hundreds of vulnerabilities in popular software since its release in 2013. The combination of lightweight coverage instrumentation and a simple evolutionary algorithm allows AFL to quickly generate inputs that exercise new code. AFL also obviates the need to manually set ad-hoc fuzzing ratios, which has been a major limitation of classical black-box fuzzers. Instead, AFL's first fuzzing pass exhaustively applies a set of mutations to every byte of a program input. While this approach allows for more thorough exploration of the input space, and therefore improves the chances of finding complex bugs, it also drastically slows down the fuzzing progress for "heavyweight" programs, or programs that take large inputs. This makes AFL less suitable for fuzzing input formats with large size overhead, such as various document formats. In this paper, we propose focused fuzzing as a practical trade-off between thoroughness and speed, for fuzzers that employ input mutation. We extend the notion of code coverage to individual bytes of input, and show how forward dynamic slicing can be used to efficiently determine the set of program instructions that are affected by a particular input byte. This information can then be used to restrict expensive mutations to a small subset of input bytes. We implement focused fuzzing on top of AFL, and evaluate it on four "real-life" Linux programs. Our evaluation shows that focused fuzzing noticeably improves bug discovery, compared to vanilla AFL.

    Ort, förlag, år, upplaga, sidor
    ACM Digital Library, 2019
    Nyckelord
    fuzzing, AFL, dynamic slicing, focused fuzzing
    Nationell ämneskategori
    Datavetenskap (datalogi)
    Identifikatorer
    urn:nbn:se:liu:diva-152737 (URN)10.1145/3230833.3230867 (DOI)000477981800013 ()978-1-4503-6448-5 (ISBN)
    Konferens
    13th International Conference on Availability, Reliability and Security, Hamburg, Germany, August 27 - 30, 2018
    Tillgänglig från: 2018-11-19 Skapad: 2018-11-19 Senast uppdaterad: 2019-08-19
1234567 151 - 200 av 491
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf