Abstract is missing.
- On Sparse Evaluation RepresentationsGanesan Ramalingam. 1-15
- The Effects of the Presision of Pointer AnalysisMarc Shapiro 0002, Susan Horwitz. 16-34
- Fast and Effective Procedure InliningOscar Waddell, R. Kent Dybvig. 35-52
- Set-Sharing is Redundant for Pair-SharingRoberto Bagnara, Patricia M. Hill, Enea Zaffanella. 53-67
- An Algebraic Approach to Sharing Analysis of Logic ProgramsMichael Codish, Vitaly Lagoon, Francisco Bueno. 68-82
- Logical Optimality of Groundness AnalysisFrancesca Scozzari. 83-97
- Towards a Cost-Effective Estimation of Uncaught Exceptions in SML ProgramsKwangkeun Yi, Sukyoung Ryu. 98-113
- Program Analysis Using Mixed Term and Set ConstraintsManuel Fähndrich, Alexander Aiken. 114-126
- Set-Based Analysis for Logic Programming and Tree AutomataJean-Marc Talbot, Sophie Tison, Philippe Devienne. 127-140
- Denotational Abstract Interpretation of Functional Logic ProgramsFrank Zartmann. 141-159
- Termination Analysis for MercuryChris Speirs, Zoltan Somogyi, Harald Søndergaard. 160-171
- The Power of QDDs (Extended Abstract)Bernard Boigelot, Patrice Godefroid, Bernard Willems, Pierre Wolper. 172-186
- Type-Based Analysis of Communication for Concurrent Programming LanguagesAtsushi Igarashi, Naoki Kobayashi. 187-201
- True Concurrency via Abstract InterpretationChiara Bodei, Corrado Priami. 202-216
- Static Analysis of Interaction Nets for Distributed ImplementationsIan Mackie. 217-231
- Type-Directed Flow Analysis for Typed Intermediate LanguagesSuresh Jagannathan, Stephen Weeks, Andrew K. Wright. 232-249
- Exact Flow AnalysisChristian Mossin. 250-264
- Satisfying Subtype Inequalities in Polynomial SpaceAlexandre Frey. 265-277
- Static Analyses of Congruence Properties on Rational Numbers (Extended Abstract)Philippe Granger. 278-292
- Effective Specialization of Realistic Programs via Use SensitivityLuke Hornof, Charles Consel, Jacques Noyé. 293-314
- Coalescing Conditional Branches into Efficient Indirect JumpsGang-Ryung Uh, David B. Whalley. 315-329
- Automatic Termination Analysis for Partial Functions Using Polynomial OrderingsJürgen Brauburger. 330-344
- TEA: Automatically Proving Termination of Programs in a Non-strict Higher-Order Functional LanguageSven Eric Panitz, Manfred Schmidt-Schauß. 345-360
- Semantic Analyzer of Modula-ProgramsPavel G. Emelianov, Danil E. Baburin. 361-363
- Abstract Interpretation from Improving WAM CodeDante Baldan, Gilberto Filé. 364
- Attribute Grammars and Functional Programming DeforestationLoïc Correnson, Étienne Duris, Didier Parigot, Gilles Roussel. 365
- Data Dependence as Abstract InterpretationsStanislav Tzolovski. 366
- Abstract Interpretation: A Theory of Approximate ComputationKim Marriott. 367-378
- On the Desirable Link Between Theory and Practice in Abstract Interpretation (Extended Abstract)Baudouin Le Charlier, Pierre Flener. 379-387
- Abstract Interpretation Based Static Analysis Parameterized by SemanticsPatrick Cousot. 388-394
- Can Abstract Interpretation Become a Mainstream Compiler Technology? (Abstract)Luddy Harrison. 395
- Combining Abstract Interpretation and Partial Evaluation (Brief Overview)Neil D. Jones. 396-405
- Practical Compile-Time AnalysisBarbara G. Ryder. 406-412