8. SAS 2001: Paris, France

@proceedings{DBLP:conf/sas/2001,
  editor    = {Patrick Cousot},
  title     = {Static Analysis, 8th International Symposium, SAS 2001, Paris,
               France, July 16-18, 2001, Proceedings},
  booktitle = {SAS},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {2126},
  year      = {2001},
  isbn      = {3-540-42314-1},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Paper

• Martin C. Rinard:
  Analysis of Multithreaded Programs. 1-19
  

Program Transformation

• Miquel Bertran, Francesc-Xavier Babot, August Climent, Miquel Nicolau:
  Communication and Parallelism Introduction and Elimination in Imperative Concurrent Programs. 20-39
  
• Raghavan Komondoor, Susan Horwitz:
  Using Slicing to Identify Duplication in Source Code. 40-56
  
• Richard Sharp, Alan Mycroft:
  Soft Scheduling for Hardware. 57-72
  

Strictness and Termination

• Kevin Glynn, Peter J. Stuckey, Martin Sulzmann:
  Effective Strictness Analysis with HORN Constraints. 73-92
  
• Frédéric Mesnard, Ulrich Neumerkel:
  Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs. 93-110
  
• David Monniaux:
  An Abstract Analysis of the Probabilistic Termination of Programs. 111-126
  

Sematics Abstraction

• Fausto Spoto:
  Watchpoint Semantics: A Tool for Compositional and Focussed Static Analyses. 127-145
  

Logic and Constraint Programming

• Lunjin Lu:
  Parameterizing a Groundness Analysis of Logic Programs. 146-164
  
• Roberto Bagnara, Roberta Gori, Patricia M. Hill, Enea Zaffanella:
  Finite-Tree Analysis for Constraint Logic-Based Languages. 165-184
  

Invited Paper

• K. Rustan M. Leino:
  Applications of Extended Static Checking. 185-193
  

Data Structures

• Nurit Dor, Michael Rodeh, Shmuel Sagiv:
  Cleanness Checking of String Manipulations in C Programs via Integer Analysis. 194-212
  
• Yanhong A. Liu, Ning Li, Scott D. Stoller:
  Solving Regular Tree Grammar Based Constraints. 213-233
  
• Eric Goubault:
  Static Analyses of the Precision of Floating-Point Operations. 234-259
  

Pointer Analysis

• Manuvir Das, Ben Liblit, Manuel Fähndrich, Jakob Rehof:
  Estimating the Impact of Scalable Pointer Analysis on Optimization. 260-278
  
• Donglin Liang, Mary Jean Harrold:
  Efficient Computation of Parameterized Pointer Information for Interprocedural Analyses. 279-298
  

Model Checking

• Farn Wang, Hsu-Chun Yen:
  Parametric Optimization of Open Real-Time Systems. 299-318
  
• Natalia Sidorova, Martin Steffen:
  Embedding Chaos. 319-334
  

Abstract Model Checking

• Ahmed Bouajjani, Aurore Collomb-Annichini, Yassine Lakhnech, Mihaela Sighireanu:
  Analyzing Fair Parametric Extended Automata. 335-355
  
• Roberto Giacobazzi, Elisa Quintarelli:
  Incompleteness, Counterexamples, and Refinements in Abstract Model-Checking. 356-373
  

Invited Talk

• Fred B. Schneider:
  Language-Based Security: What's Needed and Why. 374
  

Mobility

• Sriram K. Rajamani, Jakob Rehof:
  A Behavioral Module System for the Pi-Calculus. 375-394
  
• Francesca Levi, Sergio Maffeis:
  An Abstract Interpretation Framework for Analysing Mobile Ambients. 395-411
  
• Jérôme Feret:
  Abstract Interpretation-Based Static Analysis of Mobile Ambients. 412-430
  

Invited Session on Security

• David Wagner:
  Static Analysis and Software Assurance. 431
  
• Andrew D. Gordon, Alan Jeffrey:
  A Type and Effect Analysis of Security Protocols. 432-432
  
• Bruno Blanchet:
  Abstracting Cryptographic Protocols by Prolog Rules. 433-436
  
• Andrew C. Myers:
  Security-Typed Languages and Distributed Computation. 437-438