2. WSA 1992: Bordeaux, France

Session 1

• Olivier Danvy, John Hatcliff: Thunks (Continued). 3-11 BibTeX
• Chris Hankin, Daniel Le Métayer, David Sands: Transformation of Gamma Programs. 12-19 BibTeX
• Christian Queinnec: Value Transforming Style. 20-28 BibTeX

Session 2

• Frédéric Mesnard, Marianne Morillon: Automatic Generation of Valid Linear Measures for CLP(Q) Programs. 29-34 BibTeX
• Michael Codish, Moreno Falaschi, Kim Marriott, William H. Winsborough: Efficient Analysis of Reactive Properties of Concurrent Constraint Logic Programs. 35-42 BibTeX
• Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi: Static Analysis of CLP Programs over Numeric Domains. 43-50 BibTeX
• Marc-Michel Corsini, Kaninda Musumbu, Antoine Rauzy: The Mu-Calculus over Finite Domains as an Abstract Semantics of Prolog. 51-59 BibTeX

Session 3

• Alan Mycroft, Mads Rosendahl: Minimal Function Graphs are not Instrumented. 60-67 BibTeX
• Geoff W. Hamilton: Sharing Analysis of Lazy First-Order Functional Programs. 68-78 BibTeX
• Bernard P. Serpette: Approximations d'évaluateurs fonctionnels. 79-90 BibTeX
• Young Gil Park, Benjamin Goldberg: Order-of-Demand Analysis for Lazy Languages. 91-101 BibTeX

Session 4

• E. Saint-James: Partial Evaluation in an Industrial Context: Compiling for Endomorphic Machines. 102-108 BibTeX
• Christian Queinnec, P. Geffroy: Partial Evaluation applied to Symbolic Pattern Matching with Intelligent Backtrack. 109-117 BibTeX
• Maria J. García de la Banda, Manuel V. Hermenegildo: A Practical Application of Sharing and Freeness Inference. 118-125 BibTeX

Session 5

• A. E. Ayers: Efficient Closure Analysis with Reachability. 126-134 BibTeX
• Tadashi Araragi: Program Transformation in a Nonmonotonic Reasoning System. 135-143 BibTeX
• Thomas P. Jensen: Axiomatising Uniform Properties of Recursive Data Structures. 144-151 BibTeX

Session 6

• Matthijs F. Kuiper: Speeding Up Parallelism Detection for Attribute Grammars. 152-162 BibTeX
• Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier: Weighted Systems Revisited. 163-173 BibTeX

Session 7

• Giuseppe Amato, Fosca Giannotti, Gianni Mainetto: Analysis of Concurrent Transactions in a Functional Database Programming Language. 174-184 BibTeX
• Jean-Louis Giavitto, Jean-Paul Sansonnet, Olivier Michel: Inférer rapidement la géométrie des collections. 185-193 BibTeX
• Fosca Giannotti, Diego Latella: Using Abstract Interpretation for Gate splitting in LOTOS Specifications. 194-204 BibTeX
• Yamine Aït Ameur, Patrice Cros, J.-J. Falcon, A. Gomez: An Application of Abstract Interpretation to Floating Point Arithmetic. 205-212 BibTeX

Session 8

• Paul Y. Gloess, Y.-N. Huang, Chu Min Li, M.-A. Hernandez: On Boolean Feature Types. 213-220 BibTeX
• Clement A. Baker-Finch: Relevant Logic and Strictness Analysis. 221-228 BibTeX
• Baudouin Le Charlier, Pascal Van Hentenryck: On the Design of Generic Abstract Interpretation Frameworks. 229-246 BibTeX

Session 9

• Kirsten Lackner Solberg, Hanne Riis Nielson, Flemming Nielson: Inference Systems for Binding Time Analysis. 247-254 BibTeX
• Peter T. Breuer, Jonathan P. Bowen: Decompilation is the Efficient Enumeration of Types. 255-273 BibTeX
• Bruno Monsuez: Fractional Types. 274-284 BibTeX

Session 10

• John P. Gallagher: Static Analysis for Logic Program Specification. 285-294 BibTeX
• Anne Parrain, Philippe Devienne, Patrick Lebègue: Towards Optimization of Full Prolog Programs guided by Abstract Interpretation. 295-303 BibTeX
• Michael Hanus: An Abstract Interpretation Algorithm for Residuating Logic Programs. 304-312 BibTeX

Session 11

• Yan Mei Tang, Pierre Jouvelot: Control-Flow Effects for Escape Analysis. 313-321 BibTeX
• Marc Gengler, M. Rytz: A Polyvariant Binding Time Analysis Handling Partially Known Values. 322-330 BibTeX
• Denis Béchet: Partial Evaluation of Interaction Nets. 331-338 BibTeX