Research Catalog

Static analysis : First International Static Analysis Symposium, SAS '94, Namur, Belgium, September 28-30, 1994 : proceedings

Title
Static analysis : First International Static Analysis Symposium, SAS '94, Namur, Belgium, September 28-30, 1994 : proceedings / Baudouin Le Charlier (ed.).
Author
International Static Analysis Symposium (1st : 1994 : Namur, Belgium)
Publication
Berlin ; New York : Springer-Verlag, ©1994.

Items in the Library & Off-site

Filter by

1 Item

StatusFormatAccessCall NumberItem Location
TextUse in library QA76.6 .S2656 1994Off-site

Details

Additional Authors
Le Charlier, Baudouin, 1950-
Description
xii, 463 pages : illustrations; 24 cm
Summary
"This volume presents the proceedings of the First International Static Analysis Symposium (SAS '94), held in Namur, Belgium in September 1994. The proceedings comprise 25 full refereed papers selected from 70 submissions as well as four invited contributions by Charles Consel, Saumya K. Debray, Thomas W. Getzinger, and Nicolas Halbwachs. The papers address static analysis aspects for various programming paradigms and cover the following topics: generic algorithms for fixpoint computations; program optimization, transformation and verification; strictness-related analyses; type-based analyses and type inference; dependency analyses and abstract domain construction."--PUBLISHER'S WEBSITE.
Series Statement
Lecture notes in computer science ; 864
Uniform Title
Lecture notes in computer science ; 864.
Alternative Title
Static analysis symposium.
Subject
  • Computer programming > Congresses
  • Programming languages (Electronic computers) > Congresses
  • Computer programming
  • Programming languages (Electronic computers)
  • Statische Analyse
  • Statistische Analyse
  • Kongress
  • Programmatuurtechniek
  • Programacao De Computadores
  • Logic programming > Congresses
  • Computer programs > Verification > Congresses
  • Ordinateurs > Programmation > Congrès
  • Langages de programmation > Congrès
Genre/Form
  • Conference papers and proceedings.
  • Namur (1994)
Note
  • Spine title: Static analysis symposium.
Bibliography (note)
  • Includes bibliographical references.
Contents
The Costs and Benefits of Abstract Interpretation-driven Prolog Optimization / Thomas W. Getzinger -- Mode Analysis of Functional Logic Programs / Michael Hanus and Frank Zartmann -- Directional Type Checking of Logic Programs / Alexander Aiken and T. K. Lakshman -- A Systematic Construction of Abstract Domains / Dmitri Boulanger and Maurice Bruynooghe -- Constraint-Based Type Inference and Parametric Polymorphism / Ole Agesen -- Efficient On-the-fly Analysis of Program Behavior and Static Cache Simulation / Frank Mueller and David B. Whalley -- From Processor Timing Specifications to Static Instruction Scheduling / Ed Harcourt, Jon Mauney and Todd Cook -- Stackability in the Simply-Typed Call-by-value Lambda Calculus / Anindya Banerjee and David A. Schmidt -- Generalized Boxings, Congruences and Partial Inlining / Jean Goubault -- Selective Thunkification / Paul Steckler and Mitchell Wand -- About Synchronous Programming and Abstract Interpretation / Nicolas Halbwachs -- Uniqueness and Completeness Analysis of Array Comprehensions / David Garza-Salazar and Wim Bohm -- Extent Analysis of Data Fields / Bjorn Lisper and Jean-Francois Collard -- Verification of Linear Hybrid Systems by Means of Convex Approximations / Nicolas Halbwachs, Yann-Eric Proy and Pascal Raymond -- Compile-time Detection of Uncaught Exceptions in Standard ML Programs / Kwangkeun Yi -- Estimating the Computational Cost of Logic Programs / Saumya K. Debray, P. Lopez Garcia, Manuel Hermenegildo and N.-W. Lin -- Boolean Functions for Dependency Analysis: Algebraic Properties and Efficient Representation / Tania Armstrong, Kim Marriott, Peter Schachte and Harald Sondergaard -- Deriving Polymorphic Type Dependencies for Logic Programs using Multiple Incarnations of Prop / Michael Codish and Bart Demoen -- Extracting Non-strict Independent And-parallelism using Sharing and Freeness Information / Daniel Cabeza Gras and Manuel Hermenegildo -- Efficient FixPoint Computation / B. Vergauwen, J. Wauman and J. Dewi -- Finding Fixpoints in Finite Function Spaces using Neededness Analysis and Chaotic Iteration / Niels Jorgensen -- Efficient Strictness Analysis of Haskell / Kristian Damm Jensen, Peter Hjaeresen and Mads Rosendahl -- Abstract Interpretation using TDGs / Laurent Mauborgne -- A Type-based Framework for Program Analysis / Chris Hankin and Daniel Le Metayer -- Iterative Fixed Point Computation for Type-Based Strictness Analysis / Fritz Henglein -- Strictness and Totality Analysis / Kirsten Lackner Solberg, Hanne Riis Nielson and Flemming Nielson -- Fast Strictness Analysis Via Symbolic Fixpoint Iteration / Charles Consel -- Generating Transformers for Deforestation and Supercompilation / Robert Gluck and Jesper Jorgensen -- Mechanical Elimination of Commutative Redundancy / Hessam Khoshnevisan and Mohamad Afshar.
ISBN
  • 3540584854
  • 9783540584858
  • 0387584854
  • 9780387584850
LCCN
94035446
OCLC
  • ocm31132319
  • 31132319
  • SCSB-2031426
Owning Institutions
Princeton University Library