14. SAS 2007: Kongens Lyngby, Denmark

Invited Papers

• Frank Tip:
  Refactoring Using Type Constraints. 1-17
  
• Alan Mycroft:
  Programming Language Design and Analysis Motivated by Hardware Evolution. 18-33
  

Contributed Papers

• Kung Chen, Shu-Chun Weng, Meng Wang, Siau-Cheng Khoo, Chung-Hsin Chen:
  A Compilation Model for Aspect-Oriented Polymorphically Typed Functional Languages. 34-51
  
• Tristan Le Gall, Bertrand Jeannet:
  Lattice Automata: A Representation for Languages on Infinite Alphabets, and Some Applications to Verification. 52-68
  
• Sharon Shoham, Orna Grumberg:
  Compositional Verification and 3-Valued Abstractions Join Forces. 69-86
  
• James Brotherston:
  Formalised Inductive Reasoning in the Logic of Bunched Implications. 87-103
  
• David Monniaux:
  Optimal Abstraction on Real-Valued Programs. 104-120
  
• Axel Simon, Andy King:
  Taming the Wrapping of Integer Arithmetic. 121-136
  
• Eric Goubault, Sylvie Putot:
  Under-Approximations of Computations in Real Numbers Based on Generalized Affine Arithmetic. 137-152
  
• V. Krishna Nandivada, Fernando Magno Quintão Pereira, Jens Palsberg:
  A Framework for End-to-End Verification and Evaluation of Register Allocators. 153-169
  
• Tao Wei, Jian Mao, Wei Zou, Yu Chen:
  A New Algorithm for Identifying Loops in Decompilation. 170-183
  
• Jérôme Leroux, Grégoire Sutre:
  Accelerated Data-Flow Analysis. 184-199
  
• Akash Lal, Nicholas Kidd, Thomas W. Reps, Tayssir Touili:
  Abstract Error Projection. 200-217
  
• Alexander Malkis, Andreas Podelski, Andrey Rybalchenko:
  Precise Thread-Modular Verification. 218-232
  
• Cristiano Calcagno, Matthew J. Parkinson, Viktor Vafeiadis:
  Modular Safety Checking for Fine-Grained Concurrency. 233-248
  
• Jörg Bauer, Reinhard Wilhelm:
  Static Analysis of Dynamic Communication Systems by Partner Abstraction. 249-264
  
• Ben Hardekopf, Calvin Lin:
  Exploiting Pointer and Location Equivalence to Optimize Pointer Analysis. 265-280
  
• Amir Kamil, Katherine A. Yelick:
  Hierarchical Pointer Analysis for Distributed Programs. 281-297
  
• Matthieu Martel:
  Semantics-Based Transformation of Arithmetic Expressions. 298-314
  
• Francesco Banterle, Roberto Giacobazzi:
  A Fast Implementation of the Octagon Abstract Domain on Graphics Hardware. 315-332
  
• Patrick Cousot, Pierre Ganty, Jean-François Raskin:
  Fixpoint-Guided Abstraction Refinements. 333-348
  
• Denis Gopan, Thomas W. Reps:
  Guided Static Analysis. 349-365
  
• Sriram Sankaranarayanan, Franjo Ivancic, Aarti Gupta:
  Program Analysis Using Symbolic Ranges. 366-383
  
• Bor-Yuh Evan Chang, Xavier Rival, George C. Necula:
  Shape Analysis with Structural Invariant Checkers. 384-401
  
• Cristiano Calcagno, Dino Distefano, Peter W. O'Hearn, Hongseok Yang:
  Footprint Analysis: A Shape Analysis That Discovers Preconditions. 402-418
  
• Stephen Magill, Josh Berdine, Edmund M. Clarke, Byron Cook:
  Arithmetic Strengthening for Shape Analysis. 419-436
  
• David Delmas, Jean Souyris:
  Astrée: From Research to Industry. 437-451
  
• Étienne Payet, Fausto Spoto:
  Magic-Sets Transformation for the Analysis of Java Bytecode. 452-467