000 04311nam a22005175i 4500
001 978-3-540-49005-0
003 DE-He213
005 20160624102038.0
007 cr nn 008mamaa
008 121227s1994 gw | s |||| 0|eng d
020 _a9783540490050
_9978-3-540-49005-0
024 7 _a10.1007/3-540-58485-4
_2doi
050 4 _aQA76.6-76.66
072 7 _aUM
_2bicssc
072 7 _aCOM051000
_2bisacsh
082 0 4 _a005.11
_223
245 1 0 _aStatic Analysis
_h[electronic resource] :
_bFirst International Static Analysis Symposium, SAS'94 Namur, Belgium, September 28–30, 1994 Proceedings /
_cedited by Baudouin Charlier.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1994.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1994.
300 _aXIII, 471 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 ;
_v864
505 0 _aThe costs and benefits of abstract interpretation-driven Prolog optimization -- Mode analysis of functional logic programs -- Directional type checking of logic programs -- A systematic construction of abstract domains -- Constraint-based type inference and parametric polymorphism -- Efficient on-the-fly analysis of program behavior and static cache simulation -- From processor timing specifications to static instruction scheduling -- Stackability in the simply-typed call-by-value lambda calculus -- Generalized boxings, congruences and partial inlining -- Selective thunkification -- About synchronous programming and abstract interpretation -- Uniqueness and completeness analysis of array comprehensions -- Extent analysis of data fields -- Verification of linear hybrid systems by means of convex approximations -- Compile-time detection of uncaught exceptions in Standard ML programs -- Estimating the computational cost of logic programs -- Boolean functions for dependency analysis: Algebraic properties and efficient representation -- Deriving polymorphic type dependencies for logic programs using multiple incarnations of Prop -- Extracting Non-strict independent and-parallelism using sharing and freeness information -- Efficient fixpoint computation -- Finding fixpoints in finite function spaces using neededness analysis and chaotic iteration -- Efficient strictness analysis of Haskell -- Abstract interpretation using TDGs -- A type-based framework for program analysis -- Iterative fixed point computation for type-based strictness analysis -- Strictness and totality analysis -- Fast strictness analysis via symbolic fixpoint iteration -- Generating transformers for deforestation and supercompilation -- Mechanical elimination of commutative redundancy.
520 _aThis volume presents the proceedings of the First International Static Analysis Symposium (SAS '94), held in Namur, Belgium in September 1994. The proceedings comprise 25 full refereed papers selected from 70 submissions as well as four invited contributions by Charles Consel, Saumya K. Debray, Thomas W. Getzinger, and Nicolas Halbwachs. The papers address static analysis aspects for various programming paradigms and cover the following topics: generic algorithms for fixpoint computations; program optimization, transformation and verification; strictness-related analyses; type-based analyses and type inference; dependency analyses and abstract domain construction.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aLogic design.
650 1 4 _aComputer Science.
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.
650 2 4 _aLogics and Meanings of Programs.
700 1 _aCharlier, Baudouin.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540584858
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v864
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-58485-4
942 _2EBK6632
_cEBK
999 _c35926
_d35926