Static Analysis: 9th International Symposium, SAS 2002, Madrid, Spain, September 17-20, 2002. Proceedings

by Manuel Hermenegildo (Editor), German Puebla (Editor)

Overview

Staticanalysisisaresearchareaaimedatdevelopingprinciplesandtoolsfor- ri?cation and semantics-based manipulation of programs and high-performance implementation of programming languages. The series of Static Analysis S- posia is a forum for the presentation and discussion of advances in the area. This volume contains the papers accepted for presentation at the Ninth - ternational Static Analysis Symposium (SAS 2002), which was held Sept- ber 17-20, 2002 in Madrid, Spain. Previous SAS symposia were held in - ris, France (LNCS 2126), Santa Barbara, CA, USA (LNCS 1824), Venice, Italy (LNCS1694), Pisa, Italy(LNCS1503), Paris, France(LNCS1302), Aachen, G- many (LNCS 1145), Glasgow, UK (LNCS 983), Namur, Belgium (LNCS 864), followingtheinternationalworkshopWSAinPadova, Italy(LNCS724), Bor- aux, France(BigreVol.81-82)andJTASPEFL/WSA, Bordeaux, France(Bigre Vol. 74). In response to the call for papers, 86 contributions were submitted from 12 di?erent countries. Following on-line discussions, the Program Committee met in Madrid on June 22, 2002, and selected 32 papers, basing this choice on their scienti?cqualityandrelevancetothesymposium.Eachpaperwasreviewedbyat leastthreeProgramCommitteemembersorexternalreferees.Inadditiontothe contributed papers, this volume includes abstracts of invited talks by Thomas Reps(UniversityofWisconsin, USA), RobertHall(AT&TLabsResearch, USA), and Javier Esparza (University of Edinburgh, United Kingdom). On behalf of the Program Committee, the Program Chairs would like to thank all the authors who submitted papers and all the external referees for their careful work in the reviewing process. The support of the several funding agencies, listed later in the volume, which provided part of the funds for the organization of the conference is also gratefully acknowledged.

Product Details

ISBN-13:	9783540442356
Publisher:	Springer Berlin Heidelberg
Publication date:	10/28/2002
Series:	Lecture Notes in Computer Science , #2477
Edition description:	2002
Pages:	536
Product dimensions:	6.10(w) x 9.25(h) x 0.04(d)

Table of Contents

Static Program Analysis via 3-Valued Logic.- Open Modeling in Multi-stakeholder Distributed Systems: Research and Tool Challenges.- An Algebraic Approach to the Static Analysis of Concurrent Software.- Polynomial Constants Are Decidable.- Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi.- Nonuniform Alias Analysis of Recursive Data Structures and Arrays.- Representing and Approximating Transfer Functions in Abstract Interpretation of Hetereogeneous Datatypes.- Automated Verification of Concurrent Linked Lists with Counters.- Backward Type Inference Generalises Type Checking.- More Precise Yet Efficient Type Inference for Logic Programs.- A Few Graph-Based Relational Numerical Abstract Domains.- Static Analysis of the Numerical Stability of Loops.- On Termination of Logic Programs with Floating Point Computations.- Modular Control Flow Analysis for Libraries.- An Efficient Inclusion-Based Points-To Analysis for Strictly-Typed Languages.- Compactly Representing First-Order Structures for Static Analysis.- Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library.- Speeding Up Dataflow Analysis Using Flow-Insensitive Pointer Analysis.- Improving the Precision of Equality-Based Dataflow Analyses.- Guaranteed Optimization: Proving Nullspace Properties of Compilers.- Representation Analysis for Coercion Placement.- Pipeline Modeling for Timing Analysis.- Analysing Approximate Confinement under Uniform Attacks.- An Improved Constraint-Based System for the Verification of Security Prools.- From Secrecy to Authenticity in Security Prools.- Security Typings by Abstract Interpretation.- Static Confidentiality Enforcement for Distributed Programs.- Refinement of LTL Formulas for Abstract Model Checking.- Making Abstract Model Checking Strongly Preserving.- Semantics for Abstract Interpretation-Based Static Analyzes of Temporal Properties.- Checking Safety Properties of Behavioral VHDL Descriptions by Abstract Interpretation.- States vs. Traces in Model Checking by Abstract Interpretation.- Reuse of Results in Termination Analysis of Typed Logic Programs.- Finiteness Analysis in Polynomial Time.- Detecting Optimal Termination Conditions of Logic Programs.