Abstract is missing.
- Precise Analysis of String ExpressionsAske Simon Christensen, Anders Møller, Michael I. Schwartzbach. 1-18 [doi]
- Modular Class Analysis with DATALOGFrédéric Besson, Thomas P. Jensen. 19-36 [doi]
- Class-Level Modular Analysis for Object Oriented LanguagesFrancesco Logozzo. 37-54 [doi]
- Checking Interference with Fractional PermissionsJohn Boyland. 55-72 [doi]
- Message Analysis for Concurrent LanguagesRichard Carlsson, Konstantinos F. Sagonas, Jesper Wilhelmsson. 73-90 [doi]
- Instantaneous Termination in Pure EsterelOlivier Tardieu, Robert de Simone. 91-108 [doi]
- Stack Size Analysis for Interrupt-Driven ProgramsKrishnendu Chatterjee, Di Ma, Rupak Majumdar, Tian Zhao, Thomas A. Henzinger, Jens Palsberg. 109-126 [doi]
- Program Development Using Abstract Interpretation (And The Ciao System Preprocessor)Manuel V. Hermenegildo, Germán Puebla, Francisco Bueno, Pedro López-García. 127-152 [doi]
- Selective Tail Call EliminationYasuhiko Minamide. 153-170 [doi]
- Inserting Safe Memory Reuse Commands into ML-Like ProgramsOukseh Lee, Hongseok Yang, Kwangkeun Yi. 171-188 [doi]
- Weighted Pushdown Systems and Their Application to Interprocedural Dataflow AnalysisThomas W. Reps, Stefan Schwoon, Somesh Jha. 189-213 [doi]
- Client-Driven Pointer AnalysisSamuel Z. Guyer, Calvin Lin. 214-236 [doi]
- Abstract Interpretation of Programs as Markov Decision ProcessesDavid Monniaux. 237-254 [doi]
- A Logic for Analyzing Abstractions of Graph Transformation SystemsPaolo Baldan, Barbara König, Bernhard König. 255-272 [doi]
- Type Systems for Distributed Data SharingBen Liblit, Alexander Aiken, Katherine A. Yelick. 273-294 [doi]
- Z-Ranking: Using Statistical Analysis to Counter the Impact of Static Analysis ApproximationsTed Kremenek, Dawson R. Engler. 295-315 [doi]
- Computer-Assisted Verification of a Protocol for Certified EmailMartín Abadi, Bruno Blanchet. 316-335 [doi]
- Craig Interpolation and Reachability AnalysisKenneth L. McMillan. 336 [doi]
- Precise Widening Operators for Convex PolyhedraRoberto Bagnara, Patricia M. Hill, Elisa Ricci 0002, Enea Zaffanella. 337-354 [doi]
- Cartesian Factoring of Polyhedra in Linear Relation AnalysisNicolas Halbwachs, David Merchat, Catherine Parent-Vigouroux. 355-365 [doi]
- Continuation-Based Partial Evaluation without ContinuationsPeter Thiemann. 366-382 [doi]
- Loop Transformations for Reducing Data Space Requirements of Resource-Constrained ApplicationsPriya Unnikrishnan, Guangyu Chen, Mahmut T. Kandemir, Mustafa Karaköy, Ibrahim Kolcu. 383-400 [doi]
- Code Compaction of Matching Single-Entry Multiple-Exit RegionsWen-Ke Chen, Bengu Li, Rajiv Gupta. 401-417 [doi]
- Existential Heap Abstraction Entailment Is UndecidableViktor Kuncak, Martin C. Rinard. 418-438 [doi]
- Typestate Verification: Abstraction Techniques and Complexity ResultsJohn Field, Deepak Goyal, Ganesan Ramalingam, Eran Yahav. 439-462 [doi]
- Static Analysis of Accessed Regions in Recursive Data StructuresStephen Chong, Radu Rugina. 463-482 [doi]
- Establishing Local Temporal Heap Safety Properties with Applications to Compile-Time Memory ManagementRan Shaham, Eran Yahav, Elliot K. Kolodner, Shmuel Sagiv. 483-503 [doi]