ISBN-10:
3540603603
ISBN-13:
9783540603603
Pub. Date:
10/18/1995
Publisher:
Springer Berlin Heidelberg
Static Analysis: Second International Symposium, SAS '95, Glasgow, UK, September 25 - 27, 1995. Proceedings / Edition 1

Static Analysis: Second International Symposium, SAS '95, Glasgow, UK, September 25 - 27, 1995. Proceedings / Edition 1

by Alan Mycroft

Paperback

Current price is , Original price is $109.0. You
Select a Purchase Option (1995)
  • purchase options
    $93.90 $109.00 Save 14% Current price is $93.9, Original price is $109. You Save 14%.
  • purchase options

Overview

Static Analysis: Second International Symposium, SAS '95, Glasgow, UK, September 25 - 27, 1995. Proceedings / Edition 1

This book constitutes the refereed proceedings of the Second International Symposium on Static Analysis, SAS '95, held in Glasgow, UK, in September 1995. Static Analysis is increasingly recognized as a foundation for high-performance implementations and verification systems of high-level programming languages.
22 full revised papers selected from a total of 55 submissions are presented; they address static analysis issues for different programming paradigms; in particular concurrent, constraint, functional, imperative, logic, and object-oriented programming are addressed. In addition there are abstracts or full papers for three invited presentations and two system descriptions.

Product Details

ISBN-13: 9783540603603
Publisher: Springer Berlin Heidelberg
Publication date: 10/18/1995
Series: Lecture Notes in Computer Science , #983
Edition description: 1995
Pages: 431
Product dimensions: 8.50(w) x 10.98(h) x 0.04(d)

Table of Contents

Natural-semantics-based abstract interpretation (preliminary version).- Region inference for higher-order functional languages.- An automata-theoretic approach to Presburger arithmetic constraints.- Generation of efficient interprocedural analyzers with PAG.- Optimality in abstractions of model checking.- Determining storage properties of sequential and concurrent programs with assignment and structured data.- Partitioning non-strict functional languages for multi-threaded code generation.- Complementation in abstract interpretation.- Polymorphic recursion and subtype qualifications: Polymorphic binding-time analysis in polynomial time.- Optimizing lazy functional programs using flow inference.- Termination analysis for functional programs using term orderings.- A type-based analysis for stack allocation in functional languages.- Control-flow analysis and type systems.- Effective flow analysis for avoiding run-time checks.- Static analysis of communication for asynchronous concurrent programming languages.- Unification-free execution of well-moded and well-typed Prolog programs.- Efficient closure utilisation by higher-order inheritance analysis.- System F and abstract interpretation.- Call-by-name CPS-translation as a binding-time improvement.- Trust in the—-calculus.- LSign reordered.- Strictness analysis by abstract reduction using a tableau calculus.- Bigloo: a portable and optimizing compiler for strict functional languages.- Beyond prototype implementations: Polymorphic projection analysis for Glasgow Haskell.- Binding-time analysis and strictness analysis by abstract interpretation.- GENA — A tool for generating Prolog analyzers from specifications.- IGOR: A tool for developing Prolog dataflow analyzers.

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews