Sökning: "Program Analysis"

Visar resultat 21 - 25 av 995 avhandlingar innehållade orden Program Analysis.

  1. 21. Towards a static cache analysis for whole program analysis

    Författare :Xavier Vera; Mälardalens högskola; []
    Nyckelord :;

    Sammanfattning : .... LÄS MER

  3. 22. A program manipulation system based on partial evaluation

    Författare :Anders Haraldsson; Erik Sandewall; Mats Nordström; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; program manipulation; partial evaluation; program optimization; LISP; beta-expansion; macro-expansion; Computer science; Datavetenskap;

    Sammanfattning : Program manipulation is the task to perform transformations on program code, and is normally done in order to optimize the code with respect of the utilization of some computer resource. Partial evaluation is the task when partial computations can be performed in a program before it is actually executed. LÄS MER

  4. 23. Automatic Extraction of Program Models for Formal Software Verification

    Författare :Pedro de Carvalho Gomes; Dilian Gurov; Einar Johnsen; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Software Verification; Static Analysis; Program Models; Petri Nets; Compositional Verification; Concurrency; Computer Science; Datalogi;

    Sammanfattning : In this thesis we present a study of the generation of abstract program models from programs in real-world programming languages that are employed in the formal verification of software. The thesis is divided into three parts, which cover distinct types of software systems, programming languages, verification scenarios, program models and properties. LÄS MER

  5. 24. Few is Just Enough! : Small Model Theorem for Parameterized Verification and Shape Analysis

    Författare :Frédéric Haziza; Parosh Aziz Abdulla; Tomáš Vojnar; Uppsala universitet; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; program verification; model checking; parameterized systems; infinite-state systems; reachability; approximation; safety; tree systems; shape analysis; small model properties; view abstraction; monotonic abstraction; Computer Science; Datavetenskap;

    Sammanfattning : This doctoral thesis considers the automatic verification of parameterized systems, i.e. systems with an arbitrary number of communicating components, such as mutual exclusion protocols, cache coherence protocols or heap manipulating programs. The components may be organized in various topologies such as words, multisets, rings, or trees. LÄS MER

  7. 25. A WCET Analysis Method for Pipelined Microprocessors with Cache Memories

    Författare :Thomas Lundqvist; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; real-time systems; data cache; infeasible paths; pipeline; instruction cache; dynamically scheduled processor; worst-case execution time; timing analysis; path analysis; timing anomaly;

    Sammanfattning : When constructing real-time systems, safe and tight estimations of the worst case execution time (WCET) of programs are needed. To obtain tight estimations, a common approach is to do path and timing analyses. LÄS MER