Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.
You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.
After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.
Presents the refereed proceedings from the 14th International Symposium on Static Analysis
Addresses all aspects of static analysis, including abstract domains, abstract interpretation, abstract testing, and compiler optimizations
Features twenty-two full papers and two important invited lectures
The 14th International Symposium on Static Analysis was held in Kongens Lyngby, Denmark, in August 2007. Experts in the field of static analysis gathered at this symposium to present their latest findings and discuss new developments. This volume presents the refereed proceedings from the symposium.
Twenty-two full papers are presented alongside two invited lectures. Each paper was carefully reviewed by the editors to ensure that each one is accurate and makes an important contribution towards advancing the field.
The papers address all aspects of static analysis, including abstract domains, abstract interpretation, abstract testing, compiler optimizations, control flow analysis, data flow analysis, model checking, program specialization, security analysis, theoretical analysis frameworks, type-based analysis, and verification systems.
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.