LEADER 05498nam 22007215 450 001 996466089203316 005 20200702085228.0 010 $a3-540-49005-1 024 7 $a10.1007/3-540-58485-4 035 $a(CKB)1000000000234190 035 $a(SSID)ssj0000326884 035 $a(PQKBManifestationID)11276167 035 $a(PQKBTitleCode)TC0000326884 035 $a(PQKBWorkID)10297360 035 $a(PQKB)10053960 035 $a(DE-He213)978-3-540-49005-0 035 $a(PPN)155168711 035 $a(EXLCZ)991000000000234190 100 $a20121227d1994 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aStatic Analysis$b[electronic resource] $eFirst International Static Analysis Symposium, SAS '94, Namur, Belgium, September 28 - 30, 1994. Proceedings /$fedited by Baudouin LeCharlier 205 $a1st ed. 1994. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1994. 215 $a1 online resource (XIII, 471 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v864 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-58485-4 327 $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. 330 $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. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v864 606 $aSoftware engineering 606 $aComputers 606 $aComputer programming 606 $aProgramming languages (Electronic computers) 606 $aMathematical logic 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aSoftware Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I14029 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 615 0$aSoftware engineering. 615 0$aComputers. 615 0$aComputer programming. 615 0$aProgramming languages (Electronic computers). 615 0$aMathematical logic. 615 14$aSoftware Engineering/Programming and Operating Systems. 615 24$aTheory of Computation. 615 24$aProgramming Techniques. 615 24$aSoftware Engineering. 615 24$aProgramming Languages, Compilers, Interpreters. 615 24$aMathematical Logic and Formal Languages. 676 $a005.13/1 702 $aLeCharlier$b Baudouin$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aInternational Static Analysis Symposium 906 $aBOOK 912 $a996466089203316 996 $aStatic Analysis$9772085 997 $aUNISA