Michel Billaud, Pierre Castéran, Marc-Michel Corsini, Kaninda Musumbu, Antoine Rauzy
Proceedings of the First Workshop on Static Analysis at JTASPEFL in Bordeaux
JTASPEFL/WSA, 1991.

@proceedings{WSA-1991,
	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 First Workshop on Static Analysis at JTASPEFL in Bordeaux}",
	volume        = 74,
	year          = 1991,
}

Contents (33 items)

10 ×#french
6 ×#source code
5 ×#prolog
4 ×#abstract interpretation
4 ×#functional
3 ×#equation
3 ×#partial evaluation
3 ×#polymorphism
2 ×#analysis
2 ×#evaluation

WSA-1991-QueinnecP #composition #evaluation #lisp #metaprogramming

A Proposal for a Modular Lisp with Macros and Dynamic Evaluation (CQ, JAP), pp. 1–8.

WSA-1991-DornicJG #complexity #polymorphism

Polymorphic Time Systems for Estimating Program Complexity (VD, PJ, DKG), pp. 9–17.

WSA-1991-Monsuez #abstract interpretation #polymorphism

An Attempt to Find Polymorphic Types by Abstract Interpretation (BM), pp. 18–25.

WSA-1991-TalpinJ #polymorphism

Polymorphic Type, Region and Effect Inference (JPT, PJ), pp. 26–32.

WSA-1991-CousotC #abstract interpretation #functional #higher-order #relational #source code

Relational Abstract Interpretation of Higher Order Functional Programs (PC, RC), pp. 33–36.

WSA-1991-Cregut #french

Interprétation abstraite pour améliorer la représentation des environnements dans les langages fonctionnels (PC), pp. 37–43.

WSA-1991-Sun #equation #logic

Equational Logics (YS), pp. 44–52.

WSA-1991-EchahedJPS #case study #comparative #equation #program transformation

Equational Reasonning and the Completion Procedure. A Comparative Study in Program Transformation (RE, PJ, MLP, SS), pp. 53–61.

WSA-1991-LecoutreDL #french #prolog

Une analyse du comportement récursif de programmes Prolog par une interprétation abstraite (CL, PD, PL), pp. 62–69.

WSA-1991-CodognetF #abstraction #constraints

Computations, Abstractions and Constraints (PC, GF), pp. 70–71.

WSA-1991-ConselK #evaluation #french

Evaluation partielle paramétrable (CC, SCK), pp. 72–81.

WSA-1991-ColbyL #implementation #partial evaluation

An Implementation of Parametrized Partial Evaluation (CC, PL), pp. 82–89.

WSA-1991-NielBV #functional #partial evaluation #problem #representation

Partial Evaluation of Polymorphically Typed Functional Languages: the Representation Problem (ADN, EB, KDV), pp. 90–97.

WSA-1991-DurandSS #equation #partial evaluation #source code

Partial Evaluation of an Intermediate Language for Equational Programs (ID, DS, RS), pp. 98–106.

WSA-1991-CousotC91a #abstract interpretation #comparison

Comparison of the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation (PC, RC), pp. 107–110.

WSA-1991-Billaud #axiom #backtracking

Axiomatizations of Backtracking (MB), pp. 111–116.

WSA-1991-BarbutiCGL #modelling #prolog

Modelling Prolog Control (RB, MC, RG, GL), pp. 117–124.

WSA-1991-MesnardG #french

A propos du contrôle de la résolution (FM, JGG), pp. 125–131.

WSA-1991-ParrainDL #french #prolog #validation

Techniques de transformations de programmes Prolog généraux et validation de méta-interpréteurs (AP, PD, PL), pp. 132–138.

WSA-1991-Barthelemy #french

Prédire à bon escient (FB), pp. 139–143.

WSA-1991-Musumbu #french

Interprétation abstraite au moyen de grammaires attribuées (KM), pp. 144–150.

WSA-1991-Clergerie #abstract interpretation #programming

A Tool for Abstract Interpretation: Dynamic Programming (EVdlC), pp. 151–156.

WSA-1991-DenisD #fixpoint #logic programming #semantics #source code

Unfolding, Procedural and Fixpoint Semantics of Logic Programs (FD, JPD), pp. 157–164.

WSA-1991-BoeckC #analysis #automation #prolog #type checking

Automatic Construction of Prolog Primitives for Type Checking Analysis (PDB, BLC), pp. 165–172.

WSA-1991-Chin #deforestation #first-order #functional #source code

Generalising Deforestation for All First-Order Functional Programs (WNC), pp. 173–181.

WSA-1991-HamiltonJ #source code

Transforming Programs to Eliminate Intermediate Structures (GWH, SBJ), pp. 182–188.

WSA-1991-Ameur #functional

Non Functional Properties Can Guide Program Developments (YAA), pp. 189–196.

WSA-1991-Shivers

Useless-Variable Elimination (OS), pp. 197–201.

WSA-1991-Breuer #analysis #learning #synthesis

An Analysis/Synthesis Language with Learning Strategies (PTB), pp. 202–209.

WSA-1991-ImbertH #french

A propos des redondances dans les systèmes d’inéquations linéaires (JLI, PVH), pp. 210–216.

WSA-1991-GriffithsMP #french #prolog

Analyse et transformation de programmes Prolog en vue de leur parallélisation avec les prédicats parand et paror (MG, PM, CP), pp. 217–224.

WSA-1991-Goudal #continuation #french

Une représentation abstraite des expressions et continuations en Scheme (FG), pp. 225–233.

WSA-1991-Malmkjaer #on the #source code

On Static Properties of Specialized Programs (KM), pp. 234–241.