ESOP '92: 4th European Symposium on Programming, Rennes, France, February 26-28, 1992. Proceedings

ISBN-13: 9783540552536 / Angielski / Miękka / 1992 / 496 str.

Bernd Krieg-Br]ckner; B. Krieg-Bruckner

Opis

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.

Spis treści

Model checking and boolean graphs.- SIGNAL as a model for real-time and hybrid systems.- Towards an adequate notion of observation.- Proving safety of speculative load instructions at compile-time.- Typed norms.- Compositional refinements in multiple blackboard systems.- Fully persistent arrays for efficient incremental updates and voluminous reads.- Back to direct style.- Extraction of strong typing laws from action semantics definitions.- Detecting determinate computations by bottom-up abstract interpretation.- ELIOS-OBJ theorem proving in a specification language.- Incremental garbage collection without tags.- Approximate fixed points in abstract interpretation.- Dynamic typing.- Automatic parallelization of lazy functional programs.- Reversing abstract interpretations.- A theory of qualified types.- A semantics for multiprocessor systems.- Interprocedural type propagation for object-oriented languages.- Using the Centaur system for data-parallel SIMD programming: a case study.- The tensor product in Wadler's analysis of lists.- Basic superposition is complete.- Observers for linear types.- Type inference for partial types is decidable.- A provably correct compiler generator.- An adequate operational semantics of sharing in lazy evaluation.- Modules for a model-oriented specification language: A proposal for metasoft.- Typing references by effect inference.