LEADER 03600oam  2200577   450 
001 9910768473603321
005 20210714091128.0
010   $a3-540-49727-7
024 7 $a10.1007/3-540-49727-7
035   $a(CKB)1000000000210997
035   $a(SSID)ssj0000326888
035   $a(PQKBManifestationID)11231689
035   $a(PQKBTitleCode)TC0000326888
035   $a(PQKBWorkID)10298185
035   $a(PQKB)10553938
035   $a(DE-He213)978-3-540-49727-1
035   $a(MiAaPQ)EBC3072004
035   $a(MiAaPQ)EBC6486016
035   $a(PPN)155212133
035   $a(EXLCZ)991000000000210997
100   $a20210714d1998      uy             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 00$aStatic analysis $e5th international symposium, sas'98, pisa, italy, september 14-16, 1998, proceedings /$fedited by Giorgio Levi
205   $a1st ed. 1998.
210  1$aBerlin, Germany ;$aNew York, New York :$cSpringer,$d[1998]
210  4$d©1998
215   $a1 online resource (X, 394 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1503
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-65014-8 
320   $aIncludes bibliographical references and index.
327   $aData-Flow Analysis -- Bidirectional Data Flow Analysis in Code Motion: Myth and Reality -- On a New Method for Dataflow Analysis of Java Virtual Machine Subroutines -- Enabling Sparse Constant Propagation of Array Elements via Array SSA Form -- Assessing the Effects of Flow-Sensitivity on Pointer Alias Analyses -- Logic Programming -- Analysis of Normal Logic Programs -- The Correctness of Set-Sharing -- Deriving Analysers by Folding/Unfolding of Natural Semantics and a Case Study: Slicing -- Concurrency -- A Symbolic Semantics for Abstract Model Checking -- Automatic Determination of Communication Topologies in Mobile Systems -- Constructing Specific SOS Semantics for Concurrency via Abstract Interpretation -- Abstract Domains -- A First-Order Language for Expressing Aliasing and Type Properties of Logic Programs -- Refining Static Analyses by Trace-Based Partitioning Using Control Flow -- Building Complete Abstract Interpretations in a Linear Logic-Based Setting -- Partial Evaluation -- On the Power of Homeomorphic Embedding for Online Termination -- Analysis of Imperative Programs through Analysis of Constraint Logic Programs -- Improving Control in Functional Logic Program Specialization -- Type Inference -- Directional Type Inference for Logic Programs -- Finite Subtype Inference with Explicit Polymorphism -- Optimization -- Sparse Jacobian Computation in Automatic Differentiation by Static Program Analysis -- A New Solution to the Hidden Copy Problem -- Tutorials -- A Tutorial on Domain Theory in Abstract Interpretation -- Program Analysis as Model Checking of Abstract Interpretations -- Invited Talks -- Certifying, Optimizing Compilation.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v1503
606   $aProgramming languages (Electronic computers)$vCongresses
606   $aComputer programming$vCongresses
615  0$aProgramming languages (Electronic computers)
615  0$aComputer programming
676   $a005.1
702   $aLevi$b G$g(Giorgio),$f1942-
712 12$aInternational Static Analysis Symposium$d(5th :$f1998 :$ePisa, Italy),
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bUtOrBLW
906   $aBOOK
912   $a9910768473603321
996   $aStatic Analysis$92995248
997   $aUNINA