LEADER 03278nam 2200565 a 450 001 9910484626403321 005 20200520144314.0 024 7 $a10.1007/11547662 035 $a(CKB)1000000000213207 035 $a(SSID)ssj0000320192 035 $a(PQKBManifestationID)11286199 035 $a(PQKBTitleCode)TC0000320192 035 $a(PQKBWorkID)10347461 035 $a(PQKB)11519655 035 $a(DE-He213)978-3-540-31971-9 035 $a(MiAaPQ)EBC3067617 035 $a(PPN)123097045 035 $a(EXLCZ)991000000000213207 100 $a20050729d2005 uy 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aStatic analysis $e12th international symposium, SAS 2005, London, UK, September 7-9, 2005 : proceedings /$fChris Hankin, Igor Siveroni (eds.) 205 $a1st ed. 2005. 210 $aBerlin ;$aNew York $cSpringer$dc2005 215 $a1 online resource (X, 374 p.) 225 1 $aLecture notes in computer science,$x0302-9743 ;$v3672 300 $a"12th International Static Analysis Symposium ... held ... at Imperial College London"--Pref. 311 08$aPrinted edition: 9783540285847 320 $aIncludes bibliographical references and index. 327 $aInvited Talks -- Algorithmic Game Semantics and Static Analysis -- From Typed Process Calculi to Source-Based Security -- Contributed Papers -- Widening Operators for Weakly-Relational Numeric Abstractions -- Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra -- Inference of Well-Typings for Logic Programs with Application to Termination Analysis -- Memory Space Conscious Loop Iteration Duplication for Reliable Execution -- Memory Usage Verification for OO Programs -- Abstraction Refinement for Termination -- Data-Abstraction Refinement: A Game Semantic Approach -- Locality-Based Abstractions -- Type-Safe Optimisation of Plugin Architectures -- Using Dependent Types to Certify the Safety of Assembly Code -- The PER Model of Abstract Non-interference -- A Relational Abstraction for Functions -- Taming False Alarms from a Domain-Unaware C Analyzer by a Bayesian Statistical Post Analysis -- Banshee: A Scalable Constraint-Based Analysis Toolkit -- A Generic Framework for Interprocedural Analysis of Numerical Properties -- Finding Basic Block and Variable Correspondence -- Boolean Heaps -- Interprocedural Shape Analysis for Cutpoint-Free Programs -- Understanding the Origin of Alarms in Astrée -- Pair-Sharing Analysis of Object-Oriented Programs -- Exploiting Sparsity in Polyhedral Analysis -- Secure Information Flow as a Safety Problem. 410 0$aLecture notes in computer science ;$v3672. 517 3 $aSAS 2005 606 $aComputer programming$vCongresses 606 $aProgramming languages (Electronic computers)$vCongresses 615 0$aComputer programming 615 0$aProgramming languages (Electronic computers) 676 $a005.1/3 701 $aHankin$b Chris$0905861 701 $aSiveroni$b Igor$01754267 712 12$aInternational Static Analysis Symposium 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484626403321 996 $aStatic analysis$94190509 997 $aUNINA