Michel Billaud, Pierre Castéran, Marc-Michel Corsini, Kaninda Musumbu, Antoine Rauzy
Proceedings of the Second Workshop on Static Analysis in Bordeaux
WSA, 1992.

@proceedings{WSA-1992,
	editor        = "Michel Billaud and Pierre Castéran and Marc-Michel Corsini and Kaninda Musumbu and Antoine Rauzy",
	publisher     = "{Atelier Irisa, IRISA, Campus de Beaulieu}",
	series        = "{Series Bigre}",
	title         = "{Proceedings of the Second Workshop on Static Analysis in Bordeaux}",
	volume        = "81-82",
	year          = 1992,
}

Contents (35 items)

9 ×#analysis
7 ×#source code
5 ×#abstract interpretation
3 ×#logic programming
3 ×#partial evaluation
3 ×#performance
2 ×#concurrent
2 ×#french
2 ×#functional
2 ×#lazy evaluation

WSA-1992-DanvyH

Thunks (Continued) (OD, JH), pp. 3–11.

WSA-1992-HankinMS #source code

Transformation of Gamma Programs (CH, DLM, DS), pp. 12–19.

WSA-1992-Queinnec

Value Transforming Style (CQ), pp. 20–28.

WSA-1992-MesnardM #automation #generative #linear #metric #source code

Automatic Generation of Valid Linear Measures for CLP(Q) Programs (FM, MM), pp. 29–34.

WSA-1992-CodishFMW #analysis #concurrent #constraints #logic programming #performance #source code

Efficient Analysis of Reactive Properties of Concurrent Constraint Logic Programs (MC, MF, KM, WHW), pp. 35–42.

WSA-1992-BagnaraGL #source code #static analysis

Static Analysis of CLP Programs over Numeric Domains (RB, RG, GL), pp. 43–50.

WSA-1992-CorsiniMR #calculus #finite #prolog #semantics #μ-calculus

The μ-Calculus over Finite Domains as an Abstract Semantics of Prolog (MMC, KM, AR), pp. 51–59.

WSA-1992-MycroftR #graph

Minimal Function Graphs are not Instrumented (AM, MR), pp. 60–67.

WSA-1992-Hamilton #analysis #first-order #functional #lazy evaluation #source code

Sharing Analysis of Lazy First-Order Functional Programs (GWH), pp. 68–78.

WSA-1992-Serpette #approximate #french

Approximations d’évaluateurs fonctionnels (BPS), pp. 79–90.

WSA-1992-ParkG #analysis #lazy evaluation

Order-of-Demand Analysis for Lazy Languages (YGP, BG), pp. 91–101.

WSA-1992-Saint-James #compilation #industrial #partial evaluation

Partial Evaluation in an Industrial Context: Compiling for Endomorphic Machines (ESJ), pp. 102–108.

WSA-1992-QueinnecG #backtracking #partial evaluation #pattern matching

Partial Evaluation applied to Symbolic Pattern Matching with Intelligent Backtrack (CQ, PG), pp. 109–117.

WSA-1992-BandaH

A Practical Application of Sharing and Freeness Inference (MJGdlB, MVH), pp. 118–125.

WSA-1992-Ayers #analysis #performance #reachability

Efficient Closure Analysis with Reachability (AEA), pp. 126–134.

WSA-1992-Araragi #program transformation #reasoning

Program Transformation in a Nonmonotonic Reasoning System (TA), pp. 135–143.

WSA-1992-Jensen #axiom #data type #recursion

Axiomatising Uniform Properties of Recursive Data Structures (TPJ), pp. 144–151.

WSA-1992-Kuiper #attribute grammar #detection #parallel

Speeding Up Parallelism Detection for Attribute Grammars (MFK), pp. 152–162.

WSA-1992-DevienneLR #revisited

Weighted Systems Revisited (PD, PL, JCR), pp. 163–173.

WSA-1992-AmatoGM #analysis #concurrent #database #functional #programming language #transaction

Analysis of Concurrent Transactions in a Functional Database Programming Language (GA, FG, GM), pp. 174–184.

WSA-1992-GiavittoSM #french

Inférer rapidement la géométrie des collections (JLG, JPS, OM), pp. 185–193.

WSA-1992-GiannottiL #abstract interpretation #specification #using

Using Abstract Interpretation for Gate splitting in LOTOS Specifications (FG, DL), pp. 194–204.

WSA-1992-AmeurCFG #abstract interpretation #float

An Application of Abstract Interpretation to Floating Point Arithmetic (YAA, PC, JJF, AG), pp. 205–212.

WSA-1992-GloessHLH #on the

On Boolean Feature Types (PYG, YNH, CML, MAH), pp. 213–220.

WSA-1992-Baker-Finch #analysis #logic #strict

Relevant Logic and Strictness Analysis (CABF), pp. 221–228.

WSA-1992-CharlierH #abstract interpretation #design #framework #on the

On the Design of Generic Abstract Interpretation Frameworks (BLC, PVH), pp. 229–246.

WSA-1992-SolbergNN #analysis

Inference Systems for Binding Time Analysis (KLS, HRN, FN), pp. 247–254.

WSA-1992-BreuerB #decompiler #performance

Decompilation is the Efficient Enumeration of Types (PTB, JPB), pp. 255–273.

WSA-1992-Monsuez

Fractional Types (BM), pp. 274–284.

WSA-1992-Gallagher #logic programming #specification #static analysis

Static Analysis for Logic Program Specification (JPG), pp. 285–294.

WSA-1992-ParrainDL #abstract interpretation #optimisation #prolog #source code #towards

Towards Optimization of Full Prolog Programs guided by Abstract Interpretation (AP, PD, PL), pp. 295–303.

WSA-1992-Hanus #abstract interpretation #algorithm #logic programming #source code

An Abstract Interpretation Algorithm for Residuating Logic Programs (MH), pp. 304–312.

WSA-1992-TangJ #analysis #control flow

Control-Flow Effects for Escape Analysis (YMT, PJ), pp. 313–321.

WSA-1992-GenglerR #analysis

A Polyvariant Binding Time Analysis Handling Partially Known Values (MG, MR), pp. 322–330.

WSA-1992-Bechet #interactive #partial evaluation

Partial Evaluation of Interaction Nets (DB), pp. 331–338.