9. SAS 2002: Madrid, Spain

@proceedings{DBLP:conf/sas/2002,
  editor    = {Manuel V. Hermenegildo and
               Germ{\'a}n Puebla},
  title     = {Static Analysis, 9th International Symposium, SAS 2002, Madrid,
               Spain, September 17-20, 2002, Proceedings},
  booktitle = {SAS},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {2477},
  year      = {2002},
  isbn      = {3-540-44235-9},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Thomas W. Reps:
  Static Program Analysis via 3-Valued Logic. 1
  
• Robert J. Hall:
  Open Modeling in Multi-stakeholder Distributed Systems: Research and Tool Challenges. 2
  
• Javier Esparza:
  An Algebraic Approach to the Static Analysis of Concurrent Software. 3
  
• Markus Müller-Olm, Helmut Seidl:
  Polynomial Constants Are Decidable. 4-19
  
• Flemming Nielson, Hanne Riis Nielson, Helmut Seidl:
  Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi. 20-35
  
• Arnaud Venet:
  Nonuniform Alias Analysis of Recursive Data Structures and Arrays. 36-51
  
• Bertrand Jeannet:
  Representing and Approximating Transfer Functions in Abstract Interpretation of Hetereogeneous Datatypes. 52-68
  
• Tuba Yavuz-Kahveci, Tevfik Bultan:
  Automated Verification of Concurrent Linked Lists with Counters. 69-84
  
• Lunjin Lu, Andy King:
  Backward Type Inference Generalises Type Checking. 85-101
  
• Claudio Vaucheret, Francisco Bueno:
  More Precise Yet Efficient Type Inference for Logic Programs. 102-116
  
• Antoine Miné:
  A Few Graph-Based Relational Numerical Abstract Domains. 117-132
  
• Matthieu Martel:
  Static Analysis of the Numerical Stability of Loops. 133-150
  
• Alexander Serebrenik, Danny De Schreye:
  On Termination of Logic Programs with Floating Point Computations. 151-164
  
• Christian W. Probst:
  Modular Control Flow Analysis for Libraries. 165-179
  
• John Whaley, Monica S. Lam:
  An Efficient Inclusion-Based Points-To Analysis for Strictly-Typed Languages. 180-195
  
• Roman Manevich, G. Ramalingam, John Field, Deepak Goyal, Shmuel Sagiv:
  Compactly Representing First-Order Structures for Static Analysis. 196-212
  
• Roberto Bagnara, Elisa Ricci, Enea Zaffanella, Patricia M. Hill:
  Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library. 213-229
  
• Stephen Adams, Thomas Ball, Manuvir Das, Sorin Lerner, Sriram K. Rajamani, Mark Seigle, Westley Weimer:
  Speeding Up Dataflow Analysis Using Flow-Insensitive Pointer Analysis. 230-246
  
• Erik Ruf:
  Improving the Precision of Equality-Based Dataflow Analyses. 247-262
  
• Todd L. Veldhuizen, Andrew Lumsdaine:
  Guaranteed Optimization: Proving Nullspace Properties of Compilers. 263-277
  
• Karl-Filip Faxén:
  Representation Analysis for Coercion Placement. 278-293
  
• Marc Langenbach, Stephan Thesing, Reinhold Heckmann:
  Pipeline Modeling for Timing Analysis. 294-309
  
• Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky:
  Analysing Approximate Confinement under Uniform Attacks. 310-325
  
• Ricardo Corin, Sandro Etalle:
  An Improved Constraint-Based System for the Verification of Security Protocols. 326-341
  
• Bruno Blanchet:
  From Secrecy to Authenticity in Security Protocols. 342-359
  
• Mirko Zanotti:
  Security Typings by Abstract Interpretation. 360-375
  
• Andrei Sabelfeld, Heiko Mantel:
  Securing Communication in a Concurrent Language. 376-394
  
• María-del-Mar Gallardo, Pedro Merino, Ernesto Pimentel:
  Refinement of LTL Formulas for Abstract Model Checking. 395-410
  
• Francesco Ranzato, Francesco Tapparo:
  Making Abstract Model Checking Strongly Preserving. 411-427
  
• Damien Massé:
  Semantics for Abstract Interpretation-Based Static Analyzes of Temporal Properties. 428-443
  
• Charles Hymans:
  Checking Safety Properties of Behavioral VHDL Descriptions by Abstract Interpretation. 444-460
  
• Roberto Giacobazzi, Francesco Ranzato:
  States vs. Traces in Model Checking by Abstract Interpretation. 461-476
  
• Maurice Bruynooghe, Michael Codish, Samir Genaim, Wim Vanhoof:
  Reuse of Results in Termination Analysis of Typed Logic Programs. 477-492
  
• Chin Soon Lee:
  Finiteness Analysis in Polynomial Time. 493-508
  
• Frédéric Mesnard, Étienne Payet, Ulrich Neumerkel:
  Detecting Optimal Termination Conditions of Logic Programs. 509-526