4. SAS 1997: Paris, France

@proceedings{DBLP:conf/sas/1997,
  editor    = {Pascal Van Hentenryck},
  title     = {Static Analysis, 4th International Symposium, SAS '97, Paris,
               France, September 8-10, 1997, Proceedings},
  booktitle = {SAS},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1302},
  year      = {1997},
  isbn      = {3-540-63468-1},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Procedural Programming I

• G. Ramalingam: On Sparse Evaluation Representations. 1-15
• Marc Shapiro, Susan Horwitz: The Effects of the Presision of Pointer Analysis. 16-34
• Oscar Waddell, R. Kent Dybvig: Fast and Effective Procedure Inlining. 35-52

Logic Programming I

• Roberto Bagnara, Patricia M. Hill, Enea Zaffanella: Set-Sharing is Redundant for Pair-Sharing. 53-67
• Michael Codish, Vitaly Lagoon, Francisco Bueno: An Algebraic Approach to Sharing Analysis of Logic Programs. 68-82
• Francesca Scozzari: Logical Optimality of Groundness Analysis. 83-97

Functional Programming I

• Kwangkeun Yi, Sukyoung Ryu: Towards a Cost-Effective Estimation of Uncaught Exceptions in SML Programs. 98-113
• Manuel Fähndrich, Alexander Aiken: Program Analysis Using Mixed Term and Set Constraints. 114-126

Logic Programming II

• Jean-Marc Talbot, Sophie Tison, Philippe Devienne: Set-Based Analysis for Logic Programming and Tree Automata. 127-140
• Frank Zartmann: Denotational Abstract Interpretation of Functional Logic Programs. 141-159
• Chris Speirs, Zoltan Somogyi, Harald Søndergaard: Termination Analysis for Mercury. 160-171

Concurrency

• Bernard Boigelot, Patrice Godefroid, Bernard Willems, Pierre Wolper: The Power of QDDs (Extended Abstract). 172-186
• Atsushi Igarashi, Naoki Kobayashi: Type-Based Analysis of Communication for Concurrent Programming Languages. 187-201
• Chiara Bodei, Corrado Priami: True Concurrency via Abstract Interpretation. 202-216
• Ian Mackie: Static Analysis of Interaction Nets for Distributed Implementations. 217-231

Functional Programming II

• Suresh Jagannathan, Stephen Weeks, Andrew K. Wright: Type-Directed Flow Analysis for Typed Intermediate Languages. 232-249
• Christian Mossin: Exact Flow Analysis. 250-264
• Alexandre Frey: Satisfying Subtype Inequalities in Polynomial Space. 265-277

Procedural Programming II

• Philippe Granger: Static Analyses of Congruence Properties on Rational Numbers (Extended Abstract). 278-292
• Luke Hornof, Charles Consel, Jacques Noyé: Effective Specialization of Realistic Programs via Use Sensitivity. 293-314
• Gang-Ryung Uh, David B. Whalley: Coalescing Conditional Branches into Efficient Indirect Jumps. 315-329

Termination

• Jürgen Brauburger: Automatic Termination Analysis for Partial Functions Using Polynomial Orderings. 330-344
• Sven Eric Panitz, Manfred Schmidt-Schauß: TEA: Automatically Proving Termination of Programs in a Non-strict Higher-Order Functional Language. 345-360

System Demonstration

• Pavel G. Emelianov, Danil E. Baburin: Semantic Analyzer of Modula-Programs. 361-363

Posters

• Dante Baldan, Gilberto Filé: Abstract Interpretation from Improving WAM Code. 364
• Loïc Correnson, Étienne Duris, Didier Parigot, Gilles Roussel: Attribute Grammars and Functional Programming Deforestation. 365
• Stanislav Tzolovski: Data Dependence as Abstract Interpretations. 366

Invited Tutorials

• Kim Marriott: Abstract Interpretation: A Theory of Approximate Computation. 367-378
• Baudouin Le Charlier, Pierre Flener: On the Desirable Link Between Theory and Practice in Abstract Interpretation (Extended Abstract). 379-387

Invited Talks

• Patrick Cousot: Abstract Interpretation Based Static Analysis Parameterized by Semantics. 388-394
• Luddy Harrison: Can Abstract Interpretation Become a Mainstream Compiler Technology? (Abstract). 395
• Neil D. Jones: Combining Abstract Interpretation and Partial Evaluation (Brief Overview). 396-405
• Barbara G. Ryder: Practical Compile-Time Analysis. 406-412