000 04113nam a22005415i 4500
001 978-3-540-46803-5
003 DE-He213
005 20160624102018.0
007 cr nn 008mamaa
008 121227s1992 gw | s |||| 0|eng d
020 _a9783540468035
_9978-3-540-46803-5
024 7 _a10.1007/3-540-55253-7
_2doi
050 4 _aQA76.7-76.73
050 4 _aQA76.76.C65
072 7 _aUMX
_2bicssc
072 7 _aUMC
_2bicssc
072 7 _aCOM051010
_2bisacsh
072 7 _aCOM010000
_2bisacsh
082 0 4 _a005.13
_223
245 1 0 _aESOP '92
_h[electronic resource] :
_b4th European Symposium on Programming Rennes, France, February 26–28, 1992 Proceedings /
_cedited by Bernd Krieg-Brückner.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1992.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1992.
300 _aVIII, 496 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v582
505 0 _aModel 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.
520 _aThis 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.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aLogic design.
650 1 4 _aComputer Science.
650 2 4 _aProgramming Languages, Compilers, Interpreters.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aSoftware Engineering.
650 2 4 _aMathematical Logic and Formal Languages.
700 1 _aKrieg-Brückner, Bernd.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540552536
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v582
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-55253-7
942 _2EBK5906
_cEBK
999 _c35200
_d35200