000 04436nam a22005655i 4500
001 978-3-540-69576-9
003 DE-He213
005 20160624102058.0
007 cr nn 008mamaa
008 121227s1997 gw | s |||| 0|eng d
020 _a9783540695769
_9978-3-540-69576-9
024 7 _a10.1007/BFb0032729
_2doi
050 4 _aQA76.9.L63
050 4 _aQA76.5913
050 4 _aQA76.63
072 7 _aUM
_2bicssc
072 7 _aUYF
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aCOM036000
_2bisacsh
082 0 4 _a005.1015113
_223
245 1 0 _aStatic Analysis
_h[electronic resource] :
_b4th International Symposium, SAS '97 Paris, France, September 8–10, 1997 Proceedings /
_cedited by Pascal Hentenryck.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1997.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1997.
300 _aXII, 424 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 ;
_v1302
505 0 _aOn sparse evaluation representations -- The effects of the precision of pointer analysis -- Fast and effective procedure inlining -- Set-sharing is redundant for pair-sharing -- An algebraic approach to sharing analysis of logic programs -- Logical optimality of groundness analysis -- Towards a cost-effective estimation of uncaught exceptions in SML programs -- Program analysis using mixed term and set constraints -- Set-based analysis for logic programming and tree automata -- Denotational abstract interpretation of functional logic programs -- Termination analysis for Mercury -- The power of QDDs (extended abstract) -- Type-based analysis of communication for concurrent programming languages -- True concurrency via abstract interpretation -- Static analysis of interaction nets for distributed implementations -- Type-directed flow analysis for typed intermediate languages -- Exact flow analysis -- Satisfying subtype inequalities in polynomial space -- Static analyses of congruence properties on rational numbers (extended abstract) -- Effective specialization of realistic programs via use sensitivity -- Coalescing conditional branches into efficient indirect jumps -- Automatic termination analysis for partial functions using polynomial orderings -- TEA: Automatically proving termination of programs in a non-strict higher-order functional language -- Semantic analyzer of modula-programs -- Abstract interpretation for improving WAM code -- Attribute grammars and functional programming deforestation -- Data dependences as abstract interpretations -- Abstract interpretation: A theory of approximate computation -- On the desirable link between theory and practice in abstract interpretation (extended abstract) -- Abstract interpretation based static analysis parameterized by semantics -- Can abstract interpretation become a mainstream compiler technology? -- Combining abstract interpretation and partial evaluation (brief overview) -- Practical compile-time analysis.
520 _aThis book presents the refereed proceedings of the 4th International Symposium on Static Analysis, SAS '97, held in Paris, France, in September 1997. The 23 revised papers were selected from 61 high-quality submissions on the basis of at least three reviews. Also included are one system demonstration, three posters, and six invited contributions by leading scientists. The papers are organized in topical sections on procedural languages, logic programming, concurrency, and termination.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aLogic design.
650 1 4 _aComputer Science.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aProgramming Techniques.
650 2 4 _aSoftware Engineering.
650 2 4 _aProgramming Languages, Compilers, Interpreters.
650 2 4 _aMathematical Logic and Formal Languages.
700 1 _aHentenryck, Pascal.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540634683
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v1302
856 4 0 _uhttp://dx.doi.org/10.1007/BFb0032729
942 _2EBK7260
_cEBK
999 _c36554
_d36554