DOCSLIB.ORG

Semantic SPARQL Similarity Search Over RDF Knowledge Graphs

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Semantic SPARQL Similarity Search Over RDF Knowledge Graphs Semantic SPARQL Similarity Search Over RDF Knowledge Graphs Weiguo Zheng1, Lei Zou1, Wei Peng1, Xifeng Yan2, Shaoxu Song3, Dongyan Zhao1 1Peking University, Beijing, China, 100080; 2University of California at Santa Barbara, California, USA, 93106; 3Tsinghua University, Beijing, China, 100084. fzhengweiguo,zoulei,pengw,[email protected],[email protected],[email protected] ABSTRACT world fact. Thus, if we want to find more answers to a question, RDF knowledge graphs have attracted increasing attentions these complex SPARQL queries that contain multiple UNION operators years. However, due to the schema-free nature of RDF data, it is are required. Clearly, it is very difficult for users (even the profes- very difficult for users to have full knowledge of the underlying sional users) to conceive the complicated SPARQL queries that not schema. Furthermore, the same kind of information can be repre- only conform to the syntax but also consider the flexible underlying sented in diverse graph fragments. Hence, it is a huge challenge to schemas. We illustrate the challenges by the following motivating formulate complex SPARQL expressions by taking the union of all example. possible structures. 1.1 Motivating Example In this paper, we propose an effective framework to access the RDF repository even if users have no full knowledge of the un- Fig. 1 presents a piece of RDF graph extracted from DBpedia. derlying schema. Specifically, given a SPARQL query, the system Assume that we want to find the cars that are produced in Ger- could return as more answers that match the query based on the many. There are at least three different German car brands, such as semantic similarity as possible. Interestingly, we propose a sys- Porsche Cayenne, Mercedes Benz and BMWX6, which are stored tematic method to mine diverse semantically equivalent structure in three different schemas in Fig. 1. In order to enable the query, patterns. More importantly, incorporating both structural and se- we should issue the following SPARQL query, which is composed mantic similarities we are the first to propose a novel similarity of three subqueries corresponding to the query graphs q1, q2, and measure, semantic graph edit distance. In order to improve the q3 in Fig. 2(a). efficiency performance, we apply the semantic summary graph to SELECT ?x WHERE f summarize the knowledge graph, which supports both high-level f?x <type> Automobile. ?x <p r o d u c t i o n > Germany . g pruning and drill-down pruning. We also devise an effective lower UNION bound based on the TA-style access to each of the candidate sets. f?x <type> Automobile. ?x <assembly> Germany . g Extensive experiments over real datasets confirm the effectiveness UNION f?x <type> Automobile. ?x <manufacturer > ?y . and efficiency of our approach. ?y <l o c a t i o n > Germany .gg Since different structural patterns may express the same seman- 1. INTRODUCTION tic meanings, formulating a SPARQL query that considers all pos- An RDF repository, which consists of a set of triples hsubject, sible structures is not a trivial task. Although we can conceive the predicate, objecti, can be modeled as an RDF graph, where the complete SPARQL query for “the cars produced in Germany”, we vertices represent subjects and objects, and the labeled edges cor- cannot always use the same query pattern to answer other ques- respond to predicates. The rapidly growing RDF knowledge repos- tions. For instance, in order to find all cars produced in Aus- itories, such as DBpedia, Yago and Freebase, increase the demand tralia, we should add another SPARQL subquery “?x < type > for managing graph data effectively and efficiently. AutomobileO f Australia” to capture the complete answers. SPARQL, a structural query language proposed by W3C, is de- signed for querying RDF data. Since SPARQL queries can be rep- Benz manufacturer Mercedes_Benz type ty resented as query graphs [28], a SPARQL query can be answered p on BMW_X6 e by performing the graph pattern matching over RDF graphs [1]. locati Company p rodu Germany Due to the “schema-free” nature of RDF data, different data con- type ction tributors may adopt different schemas to describe the same real- Chery ly emb ype ass t assembly type Porsche_Cayenne type BYD Automobile p Statesman_V6 rodu ction pe China Actor This work is licensed under the Creative Commons Attribution- ty Japan t y on NonCommercial-NoDerivatives 4.0 International License. To view a copy p Toyota ucti e d pro ty e p p bornIn of this license, visit http://creativecommons.org/licenses/by-nc-nd/4.0/. For e e y p production t type any use beyond those covered by this license, obtain permission by emailing ty Automobile Andy Lau [email protected]. OfAustralia Proceedings of the VLDB Endowment, Vol. 9, No. 11 Honda AsianCoutry Copyright 2016 VLDB Endowment 2150-8097/16/07. Figure 1: An RDF knowledge graph. SELECT ?x WHERE { ?x ?x { ?x <type> Automobile. type production (q1) SELECT ?x WHERE type production ?x <production> Germany.} { ?x <type> Automobile. UNION Automobile Germany ?x <production> Germany.} Automobile Germany { ?x <type> Automobile. ?x <assembly> Germany. } ?x (q1) (q2) UNION type assembly { ?x <type> Automobile. ?x <manufacturer> ?y. Automobile Germany Query rewriting semantic graph patterns ?y <location> Germany.} } ?x (Exact) SPARQL SPARQL Similarity Search type manufacturer (q3) Query location VM Automobile ?y VM Porsche_Cayenne Germany Porsche_Cayenne Answers: Answers: Benz Benz BMW_X6 BMW_X6 (a) Traditional method (b) Our method Figure 2: Traditional method vs. our method To obtain more correct answers, the traditional method (as shown vertex labels by a similarity function. However, it requires that q in Fig. 2(a)) demands users to have the full knowledge about the and its match must share the same graph structure including the schema of an RDF graph. In other words, it requires that user- edge label constraints. Recently, SLQ [23] presents a query engine s should not only know all the predicates in the knowledge base that integrates a set of transformation functions, such as “synonym” clearly, but also be aware of different structural expressions for i- and “distance”. Although it can plug in the “distance” transfor- dentical semantic facts. It will be more difficult for open-domain mation (i.e., transforming an edge to a shortest path), more com- knowledge graphs, such as DBpedia. Every coin has two sides. plicated structures (e.g., graphs) are hard to deal with. Further- The “schema-free” nature of RDF facilitates the dataset construc- more, structural transformation (corresponding to “distance”) and tion, but it inevitably leads to the inherent difficulty of querying the semantic transformation (corresponding to “ontology”) are taken knowledge base. into consideration separately. The goal of this paper is to provide an effective way to access the 1.3 Challenges and Contributions RDF repository even if one has no full knowledge of the underlying Challenge 1: Mining Diverse Structure Patterns with Equiva- schema. To this end, we provide an effective query model. Given lent Semantic Meanings. It is a common case that many subgraph- an RDF graph G, a user just needs to write a SPARQL query fol- s of a knowledge graph convey the same semantic meaning even if lowing one possible schema to express his/her query intention. The they do not share the identical structure. For example, graphs g , system should return as many answers that semantically match the 1 g2, and g3 in Fig. 3, are three different subgraphs extracted from query as possible. Fig. 2(b) illustrates our framework of SPARQL the knowledge graph G in Fig. 1. Although they are different in similarity search. terms of graph structures, they share the same semantic meaning, For example, given the SPARQL query in Fig. 2(b) (it corre- i.e., the automobiles that are produced in Germany. Note that the sponds to q1), our system can find all cars that are produced in task of mining diverse structural patterns with equivalent seman- Germany. Graphs g1, g2, and g3 in Figs. 3(a), 3(b), and 3(c) are tic meanings is different from schema mapping [13] and ontology three of the matches based on the semantic similarity. alignment [16]. (1) Different inputs: Schema mapping and ontolo- 1.2 Limitations of Existing Approaches gy alignment take two schema/ontologies as inputs; but our input is Although lots of efforts have been devoted to the graph similarity a single knowledge graph. (2) Different outputs: Our task is to find search [25, 8, 2, 7, 22, 23], they suffer from various drawbacks. sets of graph patterns that describe the same semantic meanings. Resorting to Structure Similarity. Several approaches are pro- However, schema mapping and ontology alignment aim to find the posed for the approximate subgraph query, but most of them focus mapping between two elements from two schemas or two concepts on the structure similarity, such as SAPPER [25], kGPM [2] and from two ontologies. Ness [8]. SAPPER [25] investigates the problem of approximate In this paper, we propose an instance-driven approach to mine subgraph search allowing some edges unmatched. It does not sup- these semantically equivalent patterns. According to the mining port the vertex/edge label substitution. kGPM [2] proposes a graph results, we define three representative graph patterns of semantic e- pattern query, which allows a path to match an edge. However, quivalence, i.e., concept generation, edge redirection, and inductive it restricts that the vertex/edge labels specified in the query graph inference, over the RDF knowledge graph. q should be exactly matched. Exploiting the neighborhood-based Challenge 2: Measuring Semantic Similarity in a Uniform Man- similarity measure, Ness [8] and NeMa [7] try to identify the top-k ner.
Load more

Recommended publications
  • The Design & Implementation of an Abstract Semantic Graph For
    Clemson University TigerPrints All Dissertations Dissertations 12-2011 The esiD gn & Implementation of an Abstract Semantic Graph for Statement-Level Dynamic Analysis of C++ Applications Edward Duffy Clemson University, [email protected] Follow this and additional works at: https://tigerprints.clemson.edu/all_dissertations Part of the Computer Sciences Commons Recommended Citation Duffy, Edward, "The eD sign & Implementation of an Abstract Semantic Graph for Statement-Level Dynamic Analysis of C++ Applications" (2011). All Dissertations. 832. https://tigerprints.clemson.edu/all_dissertations/832 This Dissertation is brought to you for free and open access by the Dissertations at TigerPrints. It has been accepted for inclusion in All Dissertations by an authorized administrator of TigerPrints. For more information, please contact [email protected]. THE DESIGN &IMPLEMENTATION OF AN ABSTRACT SEMANTIC GRAPH FOR STATEMENT-LEVEL DYNAMIC ANALYSIS OF C++ APPLICATIONS A Dissertation Presented to the Graduate School of Clemson University In Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy Computer Science by Edward B. Duffy December 2011 Accepted by: Dr. Brian A. Malloy, Committee Chair Dr. James B. von Oehsen Dr. Jason P. Hallstrom Dr. Pradip K. Srimani In this thesis, we describe our system, Hylian, for statement-level analysis, both static and dynamic, of a C++ application. We begin by extending the GNU gcc parser to generate parse trees in XML format for each of the compilation units in a C++ application. We then provide verification that the generated parse trees are structurally equivalent to the code in the original C++ application. We use the generated parse trees, together with an augmented version of the gcc test suite, to recover a grammar for the C++ dialect that we parse.
    [Show full text]
  • Application of Graph Databases for Static Code Analysis of Web-Applications
    Application of Graph Databases for Static Code Analysis of Web-Applications Daniil Sadyrin [0000-0001-5002-3639], Andrey Dergachev [0000-0002-1754-7120], Ivan Loginov [0000-0002-6254-6098], Iurii Korenkov [0000-0002-8948-2776], and Aglaya Ilina [0000-0003-1866-7914] ITMO University, Kronverkskiy prospekt, 49, St. Petersburg, 197101, Russia [email protected], [email protected], [email protected], [email protected], [email protected] Abstract. Graph databases offer a very flexible data model. We present the approach of static code analysis using graph databases. The main stage of the analysis algorithm is the construction of ASG (Abstract Source Graph), which represents relationships between AST (Abstract Syntax Tree) nodes. The ASG is saved to a graph database (like Neo4j) and queries to the database are made to get code properties for analysis. The approach is applied to detect and exploit Object Injection vulnerability in PHP web-applications. This vulnerability occurs when unsanitized user data enters PHP unserialize function. Successful exploitation of this vulnerability means building of “object chain”: a nested object, in the process of deserializing of it, a sequence of methods is being called leading to dangerous function call. In time of deserializing, some “magic” PHP methods (__wakeup or __destruct) are called on the object. To create the “object chain”, it’s necessary to analyze methods of classes declared in web-application, and find sequence of methods called from “magic” methods. The main idea of author’s approach is to save relationships between methods and functions in graph database and use queries to the database on Cypher language to find appropriate method calls.
    [Show full text]
  • Dense Semantic Graph and Its Application in Single Document Summarisation
    Dense Semantic Graph and its Application in Single Document Summarisation Monika Joshi1, Hui Wang1 and Sally McClean2 1 University of Ulster, Co. Antrim, BT37 0QB, UK [email protected] , [email protected] 2 University of Ulster, Co. Londonderry, BT52 1SA, UK [email protected] Abstract Semantic graph representation of text is an important part of natural language processing applications such as text summarisation. We have studied two ways of constructing the semantic graph of a document from dependency parsing of its sentences. The first graph is derived from the subject-object-verb representation of sentence, and the second graph is derived from considering more dependency relations in the sentence by a shortest distance dependency path calculation, resulting in a dense semantic graph. We have shown through experiments that dense semantic graphs gives better performance in semantic graph based unsupervised extractive text summarisation. 1 Introduction Information can be categorized into many forms -- numerical, visual, text, and audio. Text is abundantly present in online resources. Online blogs, Wikipedia knowledge base, patent documents and customer reviews are potential information sources for different user requirements. One of these requirements is to present a short summary of the originally larger document. The summary is expected to include important in- formation from the original text documents. This is usually achieved by keeping the informative parts of the document and reducing repetitive information. There are two types of text summarization: multiple document summarisation and single document summarization. The former is aimed at removing repetitive content in a collection of documents.
    [Show full text]
  • Autowig: Automatic Generation of Python Bindings for C++ Libraries
    AutoWIG: automatic generation of python bindings for C++ libraries Pierre Fernique and Christophe Pradal EPI Virtual Plants, Inria, Montpellier, France AGAP, CIRAD, INRA, Montpellier SupAgro, Univ Montpellier, Montpellier, France ABSTRACT Most of Python and R scientific packages incorporate compiled scientific libraries to speed up the code and reuse legacy libraries. While several semi-automatic solutions exist to wrap these compiled libraries, the process of wrapping a large library is cumbersome and time consuming. In this paper, we introduce AutoWIG, a Python package that wraps automatically compiled libraries into high-level languages using LLVM/Clang technologies and the Mako templating engine. Our approach is auto- matic, extensible, and applies to complex C++ libraries, composed of thousands of classes or incorporating modern meta-programming constructs. Subjects Data Science, Scientific Computing and Simulation, Programming Languages, Software Engineering Keywords C++, Python, Automatic bindings generation INTRODUCTION Many scientific libraries are written in low-level programming languages such as C and C++. Such libraries entail the usage of the traditional edit/compile/execute cycle in order to produce high-performance programs. This leads to lower computer processing time at the cost of high scientist coding time. At the opposite end of the spectrum, scripting languages such as MATLAB, Octave (John, David Bateman & Wehbring, 2014, Submitted 6 July 2017 Accepted 26 February 2018 for numerical work) Sage (The Sage Developers, 2015, for symbolic mathematics), R (R Published 2 April 2018 Core Team, 2014, for statistical analyses) or Python (Oliphant, 2007, for general purposes) Corresponding author provide an interactive framework that allows data scientists to explore their data, test new Pierre Fernique, [email protected] ideas, combine algorithmic approaches and evaluate their results on the fly.
    [Show full text]
  • DART@AI*IA 2013 Proceedings
    Cristian Lai, Giovanni Semeraro, Alessandro Giuliani (Eds.) Proceedings of the 7th International Workshop on Information Filtering and Retrieval Workshop of the XIII AI*IA Conference December 6, 2013 Turin, Italy http://aixia2013.i-learn.unito.it/course/view.php?id=26 i Preface The series of DART workshops provides an interactive and focused platform for researchers and practitioners for presenting and discussing new and emerging ideas. Focusing on research and study on new challenges in intelligent information filtering and retrieval, DART aims to investigate novel systems and tools to web scenarios and semantic computing. Therefore, DART contributes to discuss and compare suitable novel solutions based on intelligent techniques and applied in real-world applications. Information Retrieval attempts to address similar filtering and ranking problems for pieces of information such as links, pages, and documents. Information Retrieval systems generally focus on the development of global retrieval techniques, often neglecting individual user needs and preferences. Information Filtering has drastically changed the way information seekers find what they are searching for. In fact, they effectively prune large information spaces and help users in selecting items that best meet their needs, interests, preferences, and tastes. These systems rely strongly on the use of various machine learning tools and algorithms for learning how to rank items and predict user evaluation. Submitted proposals received two or three review reports from Program Committee members. Based on the recommendations of the reviewers, 7 full papers have been selected for publication and presentation at DART 2013. When organizing a scientific conference, one always has to count on the efforts of many volunteers.
    [Show full text]
  • Graph-Based Source Code Analysis of Javascript Repositories
    Budapest University of Technology and Economics Faculty of Electrical Engineering and Informatics Department of Measurement and Information Systems Graph-Based Source Code Analysis of JavaScript Repositories Master’s Thesis Author: Dániel Stein Supervisors: Gábor Szárnyas Ádám Lippai Dávid Honfi 2016 ii Contents Contents ii Kivonat v Abstract vi 1 Introduction1 1.1 Context.......................................... 1 1.2 Problem Statement................................... 2 1.3 Objectives and Contributions............................. 2 1.4 Structure of the Thesis................................. 3 2 Preliminaries4 2.1 JavaScript......................................... 4 2.1.1 From Glue Language to a Full-Fledged Language............ 4 2.1.2 ECMAScript .................................. 4 2.2 Static Analysis...................................... 5 2.2.1 Use Cases.................................... 6 2.2.2 Advantages and Disadvantages....................... 6 2.2.3 Source Code Processing and Analysis................... 7 2.3 Handling Large Interconnected Data ........................ 12 2.3.1 On Graph Computing............................. 12 2.3.2 Evaluating Queries on a Data Structure.................. 14 2.3.3 Graph Databases ............................... 15 2.4 Integrated Development Environment (IDE).................... 17 2.4.1 Visual Studio Code .............................. 17 2.4.2 Alternative IDEs................................ 18 3 Related Work 20 3.1 Static Analysis Frameworks.............................. 20 3.1.1 Tern......................................
    [Show full text]
  • Domain Specific Languages and Their Type Systems
    Domain specific languages and their type systems Citation for published version (APA): Meer, van der, A. P. (2014). Domain specific languages and their type systems. Technische Universiteit Eindhoven. https://doi.org/10.6100/IR778421 DOI: 10.6100/IR778421 Document status and date: Published: 01/01/2014 Document Version: Publisher’s PDF, also known as Version of Record (includes final page, issue and volume numbers) Please check the document version of this publication: • A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal.
    [Show full text]
  • CODE REFACTORING UNDER CONSTRAINTS by YAN LIANG
    CODE REFACTORING UNDER CONSTRAINTS by YAN LIANG NICHOLAS A. KRAFT, CO-CHAIR RANDY K. SMITH, CO-CHAIR JEFFREY C. CARVER ALLEN S. PARRISH UZMA RAJA A DISSERTATION Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Department of Computer Science in the Graduate School of The University of Alabama TUSCALOOSA, ALABAMA 2011 Copyright Yan Liang 2011 ALL RIGHTS RESERVED ABSTRACT Code refactoring is the process of changing the internal structure of the program without changing its external behaviors. Most refactoring tools ensure behavior preservation by enforcing preconditions that must hold for the refactoring to be valid. However, their approaches have three drawbacks that make the refactoring results far from satisfactory and reduce the utilization of refactoring tools in practice. Firstly, programmers are not sure how code will be changed by those tools due to the invisible refactoring rules hidden behind the interfaces of tools. Secondly, current refactoring tools have limited extensibility to accommodate new refactorings. Lastly, most refactoring tools lack mechanisms to allow programmer to specify their own preconditions to indicate as to which properties of a program are of interest. We consider refactoring a code change activity that, as with other constraints imposed on code during software development and maintenance such as naming rules, should be visible, easily extensible, and adaptable. It should also combine the developers’ opinions, implementation styles of existing code and other good coding practice. We propose a model- based approach to precondition specification and checking in which preconditions can be declared explicitly and dynamically against the designated program metamodel, and verified against concrete program models.
    [Show full text]
  • Final Thesis Jugraj Singh Vfinal
    Computational Augmentation of Model Based System Engineering Supporting Mechatronic System Model Development with AI Technologies Mechatronics Research Centre Faculty of Technology De Montfort University, United Kingdom This thesis is submitted in partial fulfilment of the requirements of De Montfort University for the award of Doctor of Philosophy December, 2019 By: Jugraj Singh Table of Contents Introduction .......................................................................................................................... 11 1.1. Introduction ................................................................................................................................ 11 1.2. Motivation and Background....................................................................................................... 12 1.2.1. Research Gap ...................................................................................................................... 15 1.3. Research Scope .......................................................................................................................... 18 1.4. Research Aims and Objectives .................................................................................................. 20 1.5. Chapters Overview ..................................................................................................................... 21 Literature review .................................................................................................................. 22 2.1. System Engineering and MBSE
    [Show full text]
  • Code Structure Visualization
    Eindhoven University of Technology MASTER Code structure visualization Lommerse, G.L.P.M. Award date: 2005 Link to publication Disclaimer This document contains a student thesis (bachelor's or master's), as authored by a student at Eindhoven University of Technology. Student theses are made available in the TU/e repository upon obtaining the required degree. The grade received is not published on the document as presented in the repository. The required complexity or quality of research of student theses may vary by program, and the required minimum study period may vary in duration. General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain TECHNISCHE UNIVERSITEIT EINDHOVEN Department of Mathematics and Computer Science MASTER’S THESIS Code Structure Visualization by G.L.P.M. Lommerse Supervisor: Dr. Ir. A.C. Telea (TUE) Eindhoven, August 2005 Abstract This thesis describes a tool that helps programmers to get insight in software projects and also helps them to manage projects. The tool, called Code Structure Visualizer (CSV), visualizes the structure of source code by augmenting a textual representation of source code with a graphical representation of the structure.
    [Show full text]
  • Languages, Applications and Technologies
    IV Symposium on Languages, Applications and Technologies June 18th and 19th, 2015 Universidad Complutense de Madrid, Spain Editors: José-Luis Sierra-Rodríguez José Paulo Leal Alberto Simões ISBN: 978-84-606-8762-7 II Schedule and Table of Contents Thursday, 18th June Time Page 8h45 Registration 9h15 Opening Session 9h30 Keynote I chair: José Paulo Leal The role of ontologies in machine-machine communication. 1 Asunción Gómez 10h40 Coffee Break Session I: Document Processing chair: José João Almeida 11h00 Tree String Path Subsequences Automaton and Its Use for Indexing XML Documents ........................................................... 3 Eliška Šestáková and Jan Janousek 11h25 A structural approach to assess graph-based exercises ..................... 13 José Paulo Leal and Rúben Sousa 11h50 Automatic generation of CVs from Online Social Networks. 23 Sérgio Maia Dias, Alda Lopes Gançarski and Pedro Rangel Henriques 12h10 Knowledge Extraction from Requirements Specification................... 29 Eduardo Barra and Jorge Morato Session II: Domain-Specific Languages chair: Marjan Mernik 12h30 Domain Specific Languages for Data Mining: A Case Study for Educational Data Mining.......................................................... 35 Alfonso de la Vega, Diego García-Saiz, Marta Zorrilla and Pablo Sanchez 12h55 WSDLUD: A Metric to Measure the Understanding Degree of WSDL Descriptions.......................................................... 45 M. Berón, H. Bernardis, E. Miranda, D. Riesco, M. J. Varanda Pereira and P. Henriques 13h20 Towards the generation of graphical modelling environments aided by patterns 55 Antonio Garmendia, Ana Pescador, Esther Guerra and Juan De Lara 13h40 Lunch III Time Page Session III: Tools for Natural Language Speech and Text processing chair: Hugo Gonçalo Oliveira 15h00 Speech Features for Discriminating Stress Using Branch and Bound Wrapper Search...............................................................
    [Show full text]
  • Towards a Generic Framework for Trustworthy Program Refactoring∗
    Acta Cybernetica | online–first paper version | pages 1{27. Towards a Generic Framework for Trustworthy Program Refactoring∗ D´anielHorp´acsiab, Judit K}oszegi,b and D´avidJ. N´emethb Abstract Refactoring has to preserve the dynamics of the transformed program with respect to a particular definition of semantics and behavioural equivalence. In general, it is rather challenging to relate executable refactoring implemen- tations with the formal semantics of the transformed language. However, in order to make refactoring tools trustworthy, we may need to provide formal guarantees on correctness. In this paper, we propose high-level abstractions for refactoring definition and we outline a generic framework which is capable of verifying and executing refactoring specifications. By separating the var- ious concerns in the transformation process, our approach enables modular and language-parametric implementation. Keywords: refactoring, domain-specific language, refactoring methodology, formal verification 1 Introduction The idea of refactoring is as old as high-level programming. A program refac- toring [7] is typically meant to improve non-functional properties, such as the in- ternal structure or the appearance, of a program without changing its observable behaviour. Tool support is necessary for refactoring in large-scale: it has to be en- sured that program changes are complete and sound, the behaviour is intact and no bugs are introduced or eliminated by the transformations. Refactoring tools may carry out extensive modifications in large projects, which are hard to be performed or comprehended by humans. ∗The research has been supported by the European Union, co-financed by the European Social Fund (EFOP-3.6.2-16-2017-00013, Thematic Fundamental Research Collaborations Grounding Innovation in Informatics and Infocommunications).
    [Show full text]