Sökning: "Term rewriting."

Hittade 5 avhandlingar innehållade orden Term rewriting..

  1. 1. Type Theory with First-Order Data Types and Size-Change Termination

    Författare :David Wahlstedt; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Pattern-matching; Reducibility; Size-Change Termination; Logical Framework; Lambda-calculus; Term rewriting.; Type Theory; Dependent types; Normalization; Type system;

    Sammanfattning : We prove normalization for a dependently typed lambda-calculus extended with first-order data types and computation schemata for first-order size-change terminating recursive functions. Size-change termination, introduced by C.S. Lee, N. LÄS MER

  3. 2. Learning-based Software Testing using Symbolic Constraint Solving Methods

    Författare :Fei Niu; Karl Meinke; Reiner Hähnle; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Testing; Machine learning; Symbolic constraint solving; Model checking;

    Sammanfattning : Software testing remains one of the most important but expensive approaches to ensure high-quality software today. In order to reduce the cost of testing, over the last several decades, various techniques such as formal verification and inductive learning have been used for test automation in previous research. LÄS MER

  4. 3. Den välplanerade sexualiteten : frihet och kontroll i 1970-talets svenska sexualpolitik

    Författare :Birgitta Sandström; Anders Gustafsson; Stockholms universitet; []
    Nyckelord :SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; governmentality; sexual politics; biopolitics; gender; emancipation; scope of action; sexual education; public discourse; Gotland Project.; pedagogik; Education;

    Sammanfattning : The purpose of this dissertation is to give a perspective on the governmentality in official texts on Swedish sexual politics, focusing on the first half of the 1970s. The study also aims at understanding of the strategies of the sexual politics of the 1970s, with reference to earlier time periods, i.e. LÄS MER

  5. 4. Scalable Preservation, Reconstruction, and Querying of Databases in terms of Semantic Web Representations

    Författare :Silvia Stefanova; Tore Risch; Stefan Decker; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; RDF; RDFS; RDF view; SPARQL; SPARQL query processing; rewrite optimization; Topic Maps; querying of RDF views; archive relational databases; reconstruct archived databases; Datavetenskap med inriktning mot databasteknik; Computer Science with specialization in Database Technology;

    Sammanfattning : This Thesis addresses how Semantic Web representations, in particular RDF, can enable flexible and scalable preservation, recreation, and querying of databases.An approach has been developed for selective scalable long-term archival of relational databases (RDBs) as RDF, implemented in the SAQ (Semantic Archive and Query) system. LÄS MER

  7. 5. Performance Optimization Techniques and Tools for Data-Intensive Computation Platforms : An Overview of Performance Limitations in Big Data Systems and Proposed Optimizations

    Författare :Vasiliki Kalavri; Vladimir Vlassov; Alberto Montresor; KTH; []
    Nyckelord :performance optimization; data-intensive computing; big data; Informations- och kommunikationsteknik; Information and Communication Technology;

    Sammanfattning : Big data processing has recently gained a lot of attention both from academia and industry. The term refers to tools, methods, techniques and frameworks built to collect, store, process and analyze massive amounts of data. Big data can be structured, unstructured or semi-structured. LÄS MER