Static Analysis

1. Front Matter

   PDF

2. Invited Papers

   1. Refactoring Using Type Constraints

      • Frank Tip

      Pages 1-17

   2. Programming Language Design and Analysis Motivated by Hardware Evolution

      • Alan Mycroft

      Pages 18-33

3. Contributed Papers

   1. A Compilation Model for Aspect-Oriented Polymorphically Typed Functional Languages

      • Kung Chen, Shu-Chun Weng, Meng Wang, Siau-Cheng Khoo, Chung-Hsin Chen

      Pages 34-51

   2. Lattice Automata: A Representation for Languages on Infinite Alphabets, and Some Applications to Verification

      • Tristan Le Gall, Bertrand Jeannet

      Pages 52-68

   3. Compositional Verification and 3-Valued Abstractions Join Forces

      • Sharon Shoham, Orna Grumberg

      Pages 69-86

   4. Formalised Inductive Reasoning in the Logic of Bunched Implications

      • James Brotherston

      Pages 87-103

   5. Optimal Abstraction on Real-Valued Programs

      • David Monniaux

      Pages 104-120

   6. Taming the Wrapping of Integer Arithmetic

      • Axel Simon, Andy King

      Pages 121-136

   7. Under-Approximations of Computations in Real Numbers Based on Generalized Affine Arithmetic

      • Eric Goubault, Sylvie Putot

      Pages 137-152

   8. A Framework for End-to-End Verification and Evaluation of Register Allocators

      • V. Krishna Nandivada, Fernando Magno Quintão Pereira, Jens Palsberg

      Pages 153-169

   9. A New Algorithm for Identifying Loops in Decompilation

      • Tao Wei, Jian Mao, Wei Zou, Yu Chen

      Pages 170-183

   10. Accelerated Data-Flow Analysis

       • Jérôme Leroux, Grégoire Sutre

       Pages 184-199

   11. Abstract Error Projection

       • Akash Lal, Nicholas Kidd, Thomas Reps, Tayssir Touili

       Pages 200-217

   12. Precise Thread-Modular Verification

       • Alexander Malkis, Andreas Podelski, Andrey Rybalchenko

       Pages 218-232

   13. Modular Safety Checking for Fine-Grained Concurrency

       • Cristiano Calcagno, Matthew Parkinson, Viktor Vafeiadis

       Pages 233-248

   14. Static Analysis of Dynamic Communication Systems by Partner Abstraction

       • Jörg Bauer, Reinhard Wilhelm

       Pages 249-264

   15. Exploiting Pointer and Location Equivalence to Optimize Pointer Analysis

       • Ben Hardekopf, Calvin Lin

       Pages 265-280

   16. Hierarchical Pointer Analysis for Distributed Programs

       • Amir Kamil, Katherine Yelick

       Pages 281-297

   17. Semantics-Based Transformation of Arithmetic Expressions

       • Matthieu Martel

       Pages 298-314

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 symposia has served as the primary venue for presentation and discussion of theoretical, practical and innovative advances in the area. This volume contains the papers accepted for presentation at the 14th Int- national Static Analysis Symposium (SAS 2007). The meeting was held August, 22–24, 2007, at the Technical University of Denmark (DTU) in Kongens L- gby, Denmark. In response to the call for papers, 85 submissions were received. Each submission was reviewed by at least 3 experts and, based on these reports, 26 papers were selected after a week of intense electronic discussion using the EasyChair conference system. In addition to these 26 papers, this volume also containscontributionsbythetwoinvitedspeakers:FrankTip(IBMT.J.Watson Research Center, USA) and Alan Mycroft (Cambridge University, UK). On the behalf of the Program Committee, the Program Chairs would like to thank all the authors who submitted their work to the conference and also all the external referees who have been indispensable for the selection process. Special thanks go to TerkelTolstrup and J¨ org Bauer,who helped in handing the submitted papers and in organizing the structure of this volume. We would also like to thank the members of the Organizing Committee at DTU for their great work. Finally we want to thank the PhD school ITMAN at DTU for ?nancial support.

• Compiler
• Java
• abstract domains
• automata
• flow analysis
• formal methods
• formal verification
• inductive definitions
• logic
• logic programming
• optimization
• program analysis
• program manipulation
• programming
• semantics

Policies and ethics