Abstract is missing.
- Refactoring Using Type ConstraintsFrank Tip. 1-17 [doi]
- Programming Language Design and Analysis Motivated by Hardware EvolutionAlan Mycroft. 18-33 [doi]
- A Compilation Model for Aspect-Oriented Polymorphically Typed Functional LanguagesKung Chen, Shu-Chun Weng, Meng Wang, Siau-Cheng Khoo, Chung-Hsin Chen. 34-51 [doi]
- Lattice Automata: A Representation for Languages on Infinite Alphabets, and Some Applications to VerificationTristan Le Gall, Bertrand Jeannet. 52-68 [doi]
- Compositional Verification and 3-Valued Abstractions Join ForcesSharon Shoham, Orna Grumberg. 69-86 [doi]
- Formalised Inductive Reasoning in the Logic of Bunched ImplicationsJames Brotherston. 87-103 [doi]
- Optimal Abstraction on Real-Valued ProgramsDavid Monniaux. 104-120 [doi]
- Taming the Wrapping of Integer ArithmeticAxel Simon, Andy King. 121-136 [doi]
- Under-Approximations of Computations in Real Numbers Based on Generalized Affine ArithmeticEric Goubault, Sylvie Putot. 137-152 [doi]
- A Framework for End-to-End Verification and Evaluation of Register AllocatorsV. Krishna Nandivada, Fernando Magno Quintão Pereira, Jens Palsberg. 153-169 [doi]
- A New Algorithm for Identifying Loops in DecompilationTao Wei, Jian Mao, Wei Zou, Yu Chen. 170-183 [doi]
- Accelerated Data-Flow AnalysisJérôme Leroux, Grégoire Sutre. 184-199 [doi]
- Abstract Error ProjectionAkash Lal, Nicholas Kidd, Thomas W. Reps, Tayssir Touili. 200-217 [doi]
- Precise Thread-Modular VerificationAlexander Malkis, Andreas Podelski, Andrey Rybalchenko. 218-232 [doi]
- Modular Safety Checking for Fine-Grained ConcurrencyCristiano Calcagno, Matthew J. Parkinson, Viktor Vafeiadis. 233-248 [doi]
- Static Analysis of Dynamic Communication Systems by Partner AbstractionJörg Bauer, Reinhard Wilhelm. 249-264 [doi]
- Exploiting Pointer and Location Equivalence to Optimize Pointer AnalysisBen Hardekopf, Calvin Lin. 265-280 [doi]
- Hierarchical Pointer Analysis for Distributed ProgramsAmir Kamil, Katherine A. Yelick. 281-297 [doi]
- Semantics-Based Transformation of Arithmetic ExpressionsMatthieu Martel. 298-314 [doi]
- A Fast Implementation of the Octagon Abstract Domain on Graphics HardwareFrancesco Banterle, Roberto Giacobazzi. 315-332 [doi]
- Fixpoint-Guided Abstraction RefinementsPatrick Cousot, Pierre Ganty, Jean-François Raskin. 333-348 [doi]
- Guided Static AnalysisDenis Gopan, Thomas W. Reps. 349-365 [doi]
- Program Analysis Using Symbolic RangesSriram Sankaranarayanan, Franjo Ivancic, Aarti Gupta. 366-383 [doi]
- Shape Analysis with Structural Invariant CheckersBor-Yuh Evan Chang, Xavier Rival, George C. Necula. 384-401 [doi]
- Footprint Analysis: A Shape Analysis That Discovers PreconditionsCristiano Calcagno, Dino Distefano, Peter W. O Hearn, Hongseok Yang. 402-418 [doi]
- Arithmetic Strengthening for Shape AnalysisStephen Magill, Josh Berdine, Edmund M. Clarke, Byron Cook. 419-436 [doi]
- Astrée: From Research to IndustryDavid Delmas, Jean Souyris. 437-451 [doi]
- Magic-Sets Transformation for the Analysis of Java BytecodeÉtienne Payet, Fausto Spoto. 452-467 [doi]