Sökning: "Graph transformation"

Visar resultat 1 - 5 av 20 avhandlingar innehållade orden Graph transformation.

  1. 1. Code Optimisation Techniques for Lazy Functional Languages

    Författare :Urban Boquist; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; graph reduction; garbage collection; lazy functional languages; program transformation; interprocedural register allocation; graph colouring; intermediate code; code optimisation; compiler back-end;

    Sammanfattning : This thesis describes a complete compiler back-end for lazy functional languages, which uses various interprocedural optimisations to produce highly optimised code. The most important contributions of this work are the following. LÄS MER

  3. 2. Understanding Certificate Revocation

    Författare :Åsa Hagström; Robert Forchheimer; Ingemar Ingemarsson; Håkan Kvarnström; Linköpings universitet; []
    Nyckelord :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. 3. Verifying Absence of ∞ Loops in Parameterized Protocols

    Författare :Mayank Saksena; Bengt Jonsson; Ahmed Bouajjani; Uppsala universitet; []
    Nyckelord :formal methods; verification; model checking; infinite-state systems; regular model checking; liveness; graph transformation;

    Sammanfattning : The complex behavior of computer systems offers many challenges for formal verification. The analysis quickly becomes difficult as the number of participating processes increases. A parameterized system is a family of systems parameterized on a number n, typically representing the number of participating processes. LÄS MER

  5. 4. Creating Correct Network Protocols

    Författare :Oskar Wibling; Joachim Parrow; Parosh Abdulla; Ansgar Fehnker; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; network protocols; formal methods; verification; testing; routing protocols; wireless ad hoc networks; model checking; graph transformation; infinite-state systems; Computer science; Datavetenskap;

    Sammanfattning : Network protocol construction is a complex and error prone task. The challenges originate both from the inherent complexity of developing correct program code and from the distributed nature of networked systems. Protocol errors can have devastating consequences. LÄS MER

  7. 5. Reliability Evaluation of Packet Switched HF Networks

    Författare :Jiang Lou; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; HF communication; packet switching; reliability analysis; graph transformation; Information technology; Informationsteknik; SRA - ICT; SRA - Informations- och kommunikationsteknik;

    Sammanfattning : .... LÄS MER