This book constitutes the refereed proceedings of the 9th International Static Analysis Symposium, SAS 2002, held in Madrid, Spain in September 2002.
The 32 revised full papers presented were carefully reviewed and selected from 86 submissions. The papers are organized in topical sections on theory, data structure analysis, type inference, analysis of numerical problems, implementation, data flow analysis, compiler optimizations, security analyses, abstract model checking, semantics and abstract verification, and termination analysis.
Author(s): Thomas Reps (auth.), Manuel V. Hermenegildo, Germán Puebla (eds.)
Series: Lecture Notes in Computer Science 2477
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2002
Language: English
Pages: 536
Tags: Programming Languages, Compilers, Interpreters; Logics and Meanings of Programs; Software Engineering; Mathematical Logic and Formal Languages; Programming Techniques
Static Program Analysis via 3-Valued Logic....Pages 1-1
Open Modeling in Multi-stakeholder Distributed Systems: Research and Tool Challenges....Pages 2-2
An Algebraic Approach to the Static Analysis of Concurrent Software....Pages 3-3
Polynomial Constants Are Decidable....Pages 4-19
Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi....Pages 20-35
Nonuniform Alias Analysis of Recursive Data Structures and Arrays....Pages 36-51
Representing and Approximating Transfer Functions in Abstract Interpretation of Hetereogeneous Datatypes....Pages 52-68
Automated Verification of Concurrent Linked Lists with Counters....Pages 69-84
Backward Type Inference Generalises Type Checking....Pages 85-101
More Precise Yet Efficient Type Inference for Logic Programs....Pages 102-116
A Few Graph-Based Relational Numerical Abstract Domains....Pages 117-132
Static Analysis of the Numerical Stability of Loops....Pages 133-150
On Termination of Logic Programs with Floating Point Computations....Pages 151-164
Modular Control Flow Analysis for Libraries....Pages 165-179
An Efficient Inclusion-Based Points-To Analysis for Strictly-Typed Languages....Pages 180-195
Compactly Representing First-Order Structures for Static Analysis....Pages 196-212
Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library....Pages 213-229
Speeding Up Dataflow Analysis Using Flow-Insensitive Pointer Analysis....Pages 230-246
Improving the Precision of Equality-Based Dataflow Analyses....Pages 247-262
Guaranteed Optimization: Proving Nullspace Properties of Compilers....Pages 263-277
Representation Analysis for Coercion Placement....Pages 278-293
Pipeline Modeling for Timing Analysis....Pages 294-309
Analysing Approximate Confinement under Uniform Attacks....Pages 310-325
An Improved Constraint-Based System for the Verification of Security Protocols....Pages 326-341
From Secrecy to Authenticity in Security Protocols....Pages 342-359
Security Typings by Abstract Interpretation....Pages 360-375
Static Confidentiality Enforcement for Distributed Programs....Pages 376-394
Refinement of LTL Formulas for Abstract Model Checking....Pages 395-410
Making Abstract Model Checking Strongly Preserving....Pages 411-427
Semantics for Abstract Interpretation-Based Static Analyzes of Temporal Properties....Pages 428-443
Checking Safety Properties of Behavioral VHDL Descriptions by Abstract Interpretation....Pages 444-460
States vs. Traces in Model Checking by Abstract Interpretation....Pages 461-476
Reuse of Results in Termination Analysis of Typed Logic Programs....Pages 477-492
Finiteness Analysis in Polynomial Time....Pages 493-508
Detecting Optimal Termination Conditions of Logic Programs....Pages 509-525
