Abstract is missing.
- Natural-Semantics-Based Abstract Interpretation (Preliminary Version)David A. Schmidt. 1-18
- Region Inference for Higher-Order Functional LanguagesMads Tofte. 19-20
- An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract)Pierre Wolper, Bernard Boigelot. 21-32
- Generation of Efficient Interprocedural Analyzers with PAGMartin Alt, Florian Martin. 33-50
- Optimality in Abstractions of Model CheckingRance Cleaveland, S. Purushothaman Iyer, Daniel Yankelevich. 51-63
- Determining Storage Properties of Sequential and Concurrent Programs with Assignment and Structured DataChristopher Colby. 64-81
- Partitioning Non-strict Functional Languages for Multi-threaded Code GenerationSatyan R. Coorg. 82-99
- Complementation in Abstract InterpretationAgostino Cortesi, Gilberto Filé, Roberto Giacobazzi, Catuscia Palamidessi, Francesco Ranzato. 100-117
- Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial TimeDirk Dussart, Fritz Henglein, Christian Mossin. 118-135
- Optimizing Lazy Functional Programs Using Flow InferenceKarl-Filip Faxén. 136-153
- Termination Analysis for Functional Programs using Term OrderingsJürgen Giesl. 154-171
- A Type-based Analysis for Stack Allocation in Functional LanguagesJohn Hannan. 172-188
- Control-Flow Analysis and Type SystemsNevin Heintze. 189-206
- Effective Flow Analysis for Avoiding Run-Time ChecksSuresh Jagannathan, Andrew K. Wright. 207-224
- Static Analysis of Communication for Asynchronous Concurrent Programming LanguagesNaoki Kobayashi, Motoki Nakade, Akinori Yonezawa. 225-242
- Unification-Free Execution of Well-Moded and Well-Typed Prolog ProgramsM. R. K. Krishna Rao, R. K. Shyamasundar. 243-260
- Efficient Closure Utilisation by Higher-Order Inheritance AnalysisMarkus Mohnen. 261-278
- System F and Abstract InterpretationBruno Monsuez. 279-295
- Call-By-Name CPS-Translation as a Binding-Time ImprovementKristian Nielsen, Morten Heine Sørensen. 296-313
- Trust in the lambda-CalculusJens Palsberg, Peter Ørbæk. 314-329
- LSign ReorderedViswanath Ramachandran, Pascal Van Hentenryck. 330-347
- Abstract Reduction Using a Tableau CalculusManfred Schmidt-Schauß, Sven Eric Panitz, Marko Schütz. 348-365
- Bigloo: A Portable and Optimizing Compiler for Strict Functional LanguagesManuel Serrano, Pierre Weis. 366-381
- Beyond Prototype Implementations: Polymorphic Projection Analysis for Glasgow HaskellJulian Seward. 382-399
- Binding-Time Analysis and Strictness Analysis by Abstract InterpretationFranck Védrine. 400-417
- GENA - A Tool for Generating Prolog Analyzers from SpecificationsChristian Fecht. 418-419
- IGOR: A Tool for Developing Prolog Dataflow AnalyzersMagnus Nordin, Thomas Lindgren, Håkan Millroth. 420-421