Static Analysis 14th International Symposium, SAS 2007, Kongens Lyngby, Denmark, August 22-24, 2007. Proceedings /

The aim of static analysis is to develop principles, techniques and tools for validatingpropertiesofprograms,fordesigningsemantics-basedtransformations of programs and for obtaining high-performance implementations of high-level programming languages. Over the years the series of static analysis sym...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Nielson, Hanne Riis (Επιμελητής έκδοσης), Filé, Gilberto (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007.
Σειρά:Lecture Notes in Computer Science, 4634
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
Πίνακας περιεχομένων:
  • Invited Papers
  • Refactoring Using Type Constraints
  • Programming Language Design and Analysis Motivated by Hardware Evolution
  • Contributed Papers
  • A Compilation Model for Aspect-Oriented Polymorphically Typed Functional Languages
  • Lattice Automata: A Representation for Languages on Infinite Alphabets, and Some Applications to Verification
  • Compositional Verification and 3-Valued Abstractions Join Forces
  • Formalised Inductive Reasoning in the Logic of Bunched Implications
  • Optimal Abstraction on Real-Valued Programs
  • Taming the Wrapping of Integer Arithmetic
  • Under-Approximations of Computations in Real Numbers Based on Generalized Affine Arithmetic
  • A Framework for End-to-End Verification and Evaluation of Register Allocators
  • A New Algorithm for Identifying Loops in Decompilation
  • Accelerated Data-Flow Analysis
  • Abstract Error Projection
  • Precise Thread-Modular Verification
  • Modular Safety Checking for Fine-Grained Concurrency
  • Static Analysis of Dynamic Communication Systems by Partner Abstraction
  • Exploiting Pointer and Location Equivalence to Optimize Pointer Analysis
  • Hierarchical Pointer Analysis for Distributed Programs
  • Semantics-Based Transformation of Arithmetic Expressions
  • A Fast Implementation of the Octagon Abstract Domain on Graphics Hardware
  • Fixpoint-Guided Abstraction Refinements
  • Guided Static Analysis
  • Program Analysis Using Symbolic Ranges
  • Shape Analysis with Structural Invariant Checkers
  • Footprint Analysis: A Shape Analysis That Discovers Preconditions
  • Arithmetic Strengthening for Shape Analysis
  • Astrée: From Research to Industry
  • Magic-Sets Transformation for the Analysis of Java Bytecode.