Sökning: "abstract data type"

Visar resultat 1 - 5 av 215 avhandlingar innehållade orden abstract data type.

  1. 1. Type Domains for Abstract Interpretation : A critical study

    Författare :Per Mildner; Jonas Barklund; Håkan Millroth; Roland Bol; Uppsala universitet; []

    Sammanfattning : Programming languages with dynamic typing such as Prolog do not require that the programmer declares the types of data or procedures. This flexibility, however, comes at a price. The lack of declarations makes it hard for a compiler to produce fast code since data must be assumed to be of any type. LÄS MER

  2. 2. Relations in Dependent Type Theory

    Författare :Carlos Gonzalía; Göteborgs universitet; Göteborgs universitet; Gothenburg University; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; formalized mathematics; relational systems; category theory; programming logics; constructive type theory; logical frameworks; relational database model;

    Sammanfattning : This thesis investigates how to express and reason about relational concepts and methods inside the constructive logical framework of Martin-Löf's monomorphic type theory. We cover several areas where the notion of relation is central, and show how to formalize the basic concepts of each area. LÄS MER

  3. 3. Understanding Certificate Revocation

    Författare :Åsa Hagström; Robert Forchheimer; Ingemar Ingemarsson; Håkan Kvarnström; Linköpings universitet; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Revocation; Public-key certificates; Graph transformation; Information science; Informationslära;

    Sammanfattning : Correct certificate revocation practices are essential to each public-key infrastructure. While there exist a number of protocols to achieve revocation in PKI systems, there has been very little work on the theory behind it: Which different types of revocation can be identified? What is the intended effect of a specific revocation type to the knowledge base of each entity?As a first step towards a methodology for the development of reliable models, we present a graph-based formalism for specification and reasoning about the distribution and revocation of public keys and certificates. LÄS MER

  4. 4. Expressivity and Complexity of the Grammatical Framework

    Författare :Peter Ljunglöf; Göteborgs universitet; Göteborgs universitet; Gothenburg University; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Grammatical Framework; generalized context-free grammar; multiple context-free grammar; context-free rewriting systems; type theory; expressive power; abstract syntax; linearization; parsing; context-free rewriting systems;

    Sammanfattning : This thesis investigates the expressive power and parsing complexity of the Grammatical Framework (GF), a formalism originally designed for displaying formal propositions and proofs in natural language. This is done by relating GF with two more well-known grammar formalisms; Generalized Context-Free Grammar (GCFG), best seen as a framework for describing various grammar formalisms; and Parallel Multiple Context-Free Grammar (PMCFG), an instance of GCFG. LÄS MER

  5. 5. Safety, Security, and Semantic Aspects of Equation-Based Object-Oriented Languages and Environments

    Författare :David Broman; Peter Fritzson; Henrik Nilsson; Linköpings universitet; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Modeling; Simulation; Equation-Based; Object-Oriented; Modelica; Type System; Semantics; Language Safety; Secure Simulation; Computer science; Datavetenskap;

    Sammanfattning : During the last two decades, the interest for computer aided modeling and simulation of complex physical systems has witnessed a significant growth. The recent possibility to create acausal models, using components from different domains (e.g., electrical, mechanical, and hydraulic) enables new opportunities. LÄS MER