Static Analysis is a research area aimed at developing principles and tools for high-performance implementation and veri?cation of programming languages. The seriesofStatic AnalysisSymposiais aforumforpresentationanddiscussion of advances in the area. ThisvolumecontainsthepaperspresentedattheSeventhInternationalStatic Analysis Symposium (SAS 2000) which was held on June 29 July 1, 2000 at the University of California, Santa Barbara. Previous symposia were held in Venice, Pisa, Paris, Aachen, Glasgow, and Namur. The program committee met at Purdue University in March 2000 and - lected 20 papers from 52 submissionson the basis of four reviewsper paper. The program committee members were not allowed to author or co-author a subm- sion. In addition to the 20 contributed papers, this volume contains two invited papers by Daniel Jackson and Andreas Podelski. At the symposium, there was also an invited talk by Matthias Felleisen and a tutorial by Roy Dz-ching Ju. Special thanks to Wanjun Wang for helping me from start to ?nish. April 2000 Jens Palsberg General Chair David Schmidt Kansas State University, USA Program Committee Patrick Cousot Ecole Normale Sup erieure, Paris Gilberto Fil e Padova University, Italy Roberto Giacobazzi Universit` a di Verona, Italy C. Barry Jay University of Technology, Sydney Thomas Jensen IRISA/CNRS, France Neil D.

Includes supplementary material: sn.pub/extras

Inhalt
Invited Papers.- Enforcing Design Constraints with Object Logic.- Model Checking as Constraint Solving.- Contributed Papers.- Abstract Interpretation Based Semantics of Sequent Calculi.- A Transformational Approach for Generating Non-linear Invariants.- Deriving Parallel Codes via Invariants.- Safety of Strictness Analysis via Term Graph Rewriting.- Checking Cleanness in Linked Lists.- Confidentiality Analysis of Mobile Systems.- Unified Analysis of Array and Object References in Strongly Typed Languages.- Polymorphic versus Monomorphic Flow-Insensitive Points-To Analysis for C.- Efficient Inference of Static Types for Java Bytecode.- Abstract Interpretation of Game Properties.- FULLDOC: A Full Reporting Debugger for Optimized Code.- Partial Redundancy Elimination on Predicated Code.- TVLA: A System for Implementing Static Analyses.- Tree Schemata and Fair Termination.- Abstract Interpretation of Probabilistic Semantics.- Code Specialization Based on Value Profiles.- Flattening Is an Improvement.- Model Checking Guided Abstraction and Analysis.- Abstract Domains for Sharing Analysis by Optimal Semantics.- Concurrency Analysis for Java.