This volume contains selected papers presented at the European Symposium on Programming (ESOP) held jointly with the seventeeth Colloquium on Trees in Algebra and Programming (CAAP) in Rennes, France, February 26-28, 1992 (the proceedings of CAAP appear in LNCS 581). The previous symposiawere held in France, Germany, and Denmark. Every even year, as in 1992, CAAPis held jointly with ESOP. ESOP addresses fundamental issues and important developments in the specification and implementation of programming languages and systems. It continues lines begun in France and Germany under the names "Colloque sur la Programmation" and the GI workshop on "Programmiersprachen und Programmentwicklung". The programme committee received 71 submissions, from which 28 have been selected for inclusion in this volume.
Author(s): Henrik Reif Andersen (auth.), Bernd Krieg-Brückner (eds.)
Series: Lecture Notes in Computer Science 582
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1992
Language: English
Pages: 496
Tags: Programming Languages, Compilers, Interpreters; Logics and Meanings of Programs; Software Engineering; Mathematical Logic and Formal Languages
Model checking and boolean graphs....Pages 1-19
SIGNAL as a model for real-time and hybrid systems....Pages 20-38
Towards an adequate notion of observation....Pages 39-55
Proving safety of speculative load instructions at compile-time....Pages 56-72
Typed norms....Pages 73-92
Compositional refinements in multiple blackboard systems....Pages 93-109
Fully persistent arrays for efficient incremental updates and voluminous reads....Pages 110-129
Back to direct style....Pages 130-150
Extraction of strong typing laws from action semantics definitions....Pages 151-166
Detecting determinate computations by bottom-up abstract interpretation....Pages 167-181
ELIOS-OBJ theorem proving in a specification language....Pages 182-199
Incremental garbage collection without tags....Pages 200-218
Approximate fixed points in abstract interpretation....Pages 219-232
Dynamic typing....Pages 233-253
Automatic parallelization of lazy functional programs....Pages 254-268
Reversing abstract interpretations....Pages 269-286
A theory of qualified types....Pages 287-306
A semantics for multiprocessor systems....Pages 307-320
Interprocedural type propagation for object-oriented languages....Pages 321-340
Using the Centaur system for data-parallel SIMD programming: a case study....Pages 341-350
The tensor product in Wadler's analysis of lists....Pages 351-370
Basic superposition is complete....Pages 371-389
Observers for linear types....Pages 390-407
Type inference for partial types is decidable....Pages 408-417
A provably correct compiler generator....Pages 418-434
An adequate operational semantics of sharing in lazy evaluation....Pages 435-450
Modules for a model-oriented specification language: A proposal for metasoft....Pages 451-472
Typing references by effect inference....Pages 473-491
