Alan Mycroft
Proceedings of the Second International Static Analysis Symposium
SAS-1995, 1995.

@proceedings{SAS-1995,
	address       = "Glasgow, Scotland, United Kingdom",
	editor        = "Alan Mycroft",
	isbn          = "3-540-60360-3",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Second International Static Analysis Symposium}",
	volume        = 983,
	year          = 1995,
}

Contents (27 items)

8 ×#analysis
6 ×#functional
4 ×#abstract interpretation
4 ×#source code
3 ×#concurrent
3 ×#named
3 ×#prolog
3 ×#strict
3 ×#type system
3 ×#using

SAS-1995-Schmidt #abstract interpretation #semantics

Natural-Semantics-Based Abstract Interpretation (DAS), pp. 1–18.

SAS-1995-Tofte #functional #higher-order

Region Inference for Higher-Order Functional Languages (MT), pp. 19–20.

SAS-1995-WolperB #approach #constraints

An Automata-Theoretic Approach to Presburger Arithmetic Constraints (PW, BB), pp. 21–32.

SAS-1995-AltM #generative #interprocedural #performance

Generation of Efficient Interprocedural Analyzers with PAG (MA, FM), pp. 33–50.

SAS-1995-CleavelandIY #abstraction #model checking

Optimality in Abstractions of Model Checking (RC, SPI, DY), pp. 51–63.

SAS-1995-Colby #concurrent #source code

Determining Storage Properties of Sequential and Concurrent Programs with Assignment and Structured Data (CC), pp. 64–81.

SAS-1995-Coorg #clustering #code generation #concurrent #functional #multi #strict #thread

Partitioning Non-strict Functional Languages for Multi-threaded Code Generation (SRC), pp. 82–99.

SAS-1995-CortesiFGPR #abstract interpretation

Complementation in Abstract Interpretation (AC, GF, RG, CP, FR), pp. 100–117.

SAS-1995-DussartHM #analysis #polymorphism #polynomial #recursion #type system

Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time (DD, FH, CM), pp. 118–135.

SAS-1995-Faxen #functional #lazy evaluation #optimisation #source code #using

Optimizing Lazy Functional Programs Using Flow Inference (KFF), pp. 136–153.

SAS-1995-Giesl #analysis #functional #order #source code #termination #using

Termination Analysis for Functional Programs using Term Orderings (JG), pp. 154–171.

SAS-1995-Hannan #analysis #functional #stack #type system

A Type-based Analysis for Stack Allocation in Functional Languages (JH), pp. 172–188.

SAS-1995-Heintze #analysis #control flow #type system

Control-Flow Analysis and Type Systems (NH), pp. 189–206.

SAS-1995-JagannathanW #analysis #effectiveness #runtime

Effective Flow Analysis for Avoiding Run-Time Checks (SJ, AKW), pp. 207–224.

SAS-1995-KobayashiNY #communication #concurrent #programming language #static analysis

Static Analysis of Communication for Asynchronous Concurrent Programming Languages (NK, MN, AY), pp. 225–242.

SAS-1995-RaoS #execution #prolog #source code

Unification-Free Execution of Well-Moded and Well-Typed Prolog Programs (MRKKR, RKS), pp. 243–260.

SAS-1995-Mohnen #analysis #higher-order #inheritance #performance

Efficient Closure Utilisation by Higher-Order Inheritance Analysis (MM), pp. 261–278.

SAS-1995-Monsuez #abstract interpretation #system f

System F and Abstract Interpretation (BM), pp. 279–295.

SAS-1995-NielsenS #call-by

Call-By-Name CPS-Translation as a Binding-Time Improvement (KN, MHS), pp. 296–313.

SAS-1995-PalsbergO #trust #λ-calculus

Trust in the λ-Calculus (JP, PØ), pp. 314–329.

SAS-1995-RamachandranH

LSign Reordered (VR, PVH), pp. 330–347.

SAS-1995-Schmidt-SchausPS #calculus #reduction #using

Abstract Reduction Using a Tableau Calculus (MSS, SEP, MS), pp. 348–365.

SAS-1995-SerranoW #compilation #functional #named #optimisation #strict

Bigloo: A Portable and Optimizing Compiler for Strict Functional Languages (MS, PW), pp. 366–381.

SAS-1995-Seward #analysis #haskell #implementation #polymorphism #prototype

Beyond Prototype Implementations: Polymorphic Projection Analysis for Glasgow Haskell (JS), pp. 382–399.

SAS-1995-Vedrine #abstract interpretation #analysis #strict

Binding-Time Analysis and Strictness Analysis by Abstract Interpretation (FV), pp. 400–417.

SAS-1995-Fecht #generative #named #prolog #specification

GENA — A Tool for Generating Prolog Analyzers from Specifications (CF), pp. 418–419.

SAS-1995-NordinLM #data flow #named #prolog

IGOR: A Tool for Developing Prolog Dataflow Analyzers (MN, TL, HM), pp. 420–421.