Skip to main content
SpringerLink
Log in

Static Analysis

8th International Symposium, SAS 2001, Paris, France, July 16-18, 2001. Proceedings

  • Conference proceedings
  • © 2001

Overview

Editors:
  1. Patrick Cousot

    1. Département d’Informatique, École Normale Supérieure, Paris Cedex 05, France

    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 2126)

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 (28 papers)

  1. Front Matter

    Pages I-XI
    Download chapter PDF

  2. Invited Paper

    1. Analysis of Multithreaded Programs

      • Martin Rinard
      Pages 1-19

  3. Program Transformation

    1. Communication and Parallelism Introduction and Elimination in Imperative Concurrent Programs

      • Miquel Bertran, Francesc Babot, August Climent, Miquel Nicolau
      Pages 20-39

    2. Using Slicing to Identify Duplication in Source Code

      • Raghavan Komondoor, Susan Horwitz
      Pages 40-56

    3. Soft Scheduling for Hardware

      • Richard Sharp, Alan Mycroft
      Pages 57-72

  4. Strictness and Termination

    1. Effective Strictness Analysis with HORN Constraints

      • Kevin Glynn, Peter J. Stuckey, Martin Sulzmann
      Pages 73-92

    2. Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs

      • Fred Mesnard, Ulrich Neumerkel
      Pages 93-110

    3. An Abstract Analysis of the Probabilistic Termination of Programs

      • David Monniaux
      Pages 111-126

  5. Semantics Abstraction

    1. Watchpoint Semantics: A Tool for Compositional and Focussed Static Analyses

      • Fausto Spoto
      Pages 127-145

  6. Logic and Constraint Programming

    1. Parameterizing a Groundness Analysis of Logic Programs

      • Lunjin Lu
      Pages 146-164

    2. Finite-Tree Analysis for Constraint Logic-Based Languages

      • Roberto Bagnara, Roberta Gori, Patricia M. Hill, Enea Zaffanella
      Pages 165-184

  7. Invited Paper

    1. Applications of Extended Static Checking

      • K. Rustan, M. Leino
      Pages 185-193

  8. Data Structures

    1. Cleanness Checking of String Manipulations in C Programs via Integer Analysis

      • Nurit Dor, Michael Rodeh, Mooly Sagiv
      Pages 194-212

    2. Solving Regular Tree Grammar Based Constraints

      • Yanhong A. Liu, Ning Li, Scott D. Stoller
      Pages 213-233

    3. Static Analyses of the Precision of Floating-Point Operations

      • Eric Goubault
      Pages 234-259

  9. Pointer Analysis

    1. Estimating the Impact of Scalable Pointer Analysis on Optimization

      • Manuvir Das, Ben Liblit, Manuel Fähndrich, Jakob Rehof
      Pages 260-278

    2. Efficient Computation of Parameterized Pointer Information for Interprocedural Analyses

      • Donglin Liang, Mary Jean Harrold
      Pages 279-298

  10. Model Checking

    1. Parametric Optimization of Open Real-Time Systems

      • Farn Wang, Hsu-Chun Yen
      Pages 299-318

    2. Embedding Chaos

      • Natalia Sidorova, Martin Steffen
      Pages 319-334

  11. Abstract Model Checking

    1. Analyzing Fair Parametric Extended Automata

      • Ahmed Bouajjani, Aurore Collomb-Annichini, Yassine Lakhnech, Mihaela Sighireanu
      Pages 335-355
Back to top

Keywords

Editors and Affiliations

  • Département d’Informatique, École Normale Supérieure, Paris Cedex 05, France

    Patrick Cousot

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation