Skip to main content
SpringerLink
Log in

Static Analysis

6th International Symposium, SAS'99, Venice, Italy, September 22-24, 1999, Proceedings

  • Conference proceedings
  • © 1999

Overview

Editors:
  1. Agostino Cortesi

    1. Dipartimento di Informatica, Università Ca’Foscari di Venezia, Mestre-Venezia, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Gilberto Filé

    1. Dipartimento di Matematica Pura ed Applicata, Università di Padova, Padova, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1694)

Included in the following conference series:

Conference proceedings info: SAS 1999.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (23 papers)

  1. Front Matter

    Pages I-VIII
    Download chapter PDF

  2. Synchronization in JAVA Programs

    1. A Formal Study of Slicing for Multi-threaded Programs with JVM Concurrency Primitives

      • John Hatcliff, James Corbett, Matthew Dwyer, Stefan Sokolowski, Hongjun Zheng
      Pages 1-18

    2. Static Analyses for Eliminating Unnecessary Synchronization from Java Programs

      • Jonathan Aldrich, Craig Chambers, Emin Gun Sirer, Susan Eggers
      Pages 19-38

  3. Synchronous Languages

    1. Dynamic Partitioning in Analyses of Numerical Properties

      • Bertrand Jeannet, Nicolas Halbwachs, Pascal Raymond
      Pages 39-50

    2. Polyhedral Analysis for Synchronous Languages

      • Frédéric Besson, Thomas Jensen, Jean-Pierre Talpin
      Pages 51-68

  4. Abstract Domains

    1. Decomposing Non-redundant Sharing by Complementation

      • Enea Zaffanella, Patricia M. Hill, Roberto Bagnara
      Pages 69-84

    2. Freeness Analysis Through Linear Refinement

      • Patricia Hill, Fausto Spoto
      Pages 85-100

    3. Binary Decision Graphs

      • Laurent Mauborgne
      Pages 101-116

    4. Binding-Time Analysis for Both Static and Dynamic Expressions

      • Kenichi Asai
      Pages 117-133

  5. Concurrency

    1. Abstract Interpretation of Mobile Ambients

      • René Rydhof Hansen, Jacob Grydholt Jensen, Flemming Nielson, Hanne Riis Nielson
      Pages 134-148

    2. Abstracting Cryptographic Protocols with Tree Automata

      • David Monniaux
      Pages 149-163

    3. State Space Reduction Based on Live Variables Analysis

      • Marius Bozga, Jean-Claude Fernandez, Lucian Ghirvu
      Pages 164-178

  6. Static Single Assignment

    1. Partial Dead Code Elimination Using Extended Value Graph

      • Munehiro Takimoto, Kenichi Harada
      Pages 179-193

    2. Translating Out of Static Single Assignment Form

      • Vugranam C. Sreedhar, Roy Dz-Ching Ju, David M. Gillies, Vatsa Santhanam
      Pages 194-210

  7. Optimizations

    1. Eliminating Dead Code on Recursive Data

      • Yanhong A. Liu, Scott D. Stoller
      Pages 211-231

    2. Detecting Equalities of Variables: Combining Efficiency with Precision

      • Oliver Rüthing, Jens Knoop, Bernhard Steffen
      Pages 232-247

  8. Foundations

    1. A New Class of Functions for Abstract Interpretation

      • Jörg Köller, Markus Mohnen
      Pages 248-263

    2. Equational Semantics

      • Loîc Correnson, Etienne Duris, Didier Parigot, Gilles Roussel
      Pages 264-283

    3. Abstract Animator for Temporal Specifications: Application to TLA

      • Dominique Cansell, Dominique Méry
      Pages 284-299

  9. Invited Talks and Tutorials

    1. Static Analysis of Mega-Programs

      • Daniel Weise
      Pages 300-302
Back to top

Other volumes

  1. Static Analysis

Keywords

About this book

Static analysis is increasingly recognized as a fundamental reasearch area aimed at studying and developing tools for high performance implementations and v- i cation systems for all programming language paradigms. The last two decades have witnessed substantial developments in this eld, ranging from theoretical frameworks to design, implementation, and application of analyzers in optim- ing compilers. Since 1994, SAS has been the annual conference and forum for researchers in all aspects of static analysis. This volume contains the proceedings of the 6th International Symposium on Static Analysis (SAS’99) which was held in Venice, Italy, on 22{24 September 1999. The previous SAS conferences were held in Namur (Belgium), Glasgow (UK), Aachen (Germany), Paris (France), and Pisa (Italy). The program committee selected 18 papers out of 42 submissions on the basis of at least three reviews. The resulting volume o ers to the reader a complete landscape of the research in this area. The papers contribute to the following topics: foundations of static analysis, abstract domain design, and applications of static analysis to di erent programming paradigms (concurrent, synchronous, imperative, object oriented, logical, and functional). In particular, several papers use static analysis for obtaining state space reduction in concurrent systems. New application elds are also addressed, such as the problems of security and secrecy.

Editors and Affiliations

  • Dipartimento di Informatica, Università Ca’Foscari di Venezia, Mestre-Venezia, Italy

    Agostino Cortesi

  • Dipartimento di Matematica Pura ed Applicata, Università di Padova, Padova, Italy

    Gilberto Filé

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation