000 03743nam a22005775i 4500
001 978-3-540-49727-1
003 DE-He213
005 20240423132520.0
007 cr nn 008mamaa
008 121227s1998 gw | s |||| 0|eng d
020 _a9783540497271
_9978-3-540-49727-1
024 7 _a10.1007/3-540-49727-7
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aStatic Analysis
_h[electronic resource] :
_b5th International Symposium, SAS'98, Pisa, Italy, September 14-16, 1998, Proceedings /
_cedited by Giorgio Levi.
250 _a1st ed. 1998.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c1998.
300 _aX, 394 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,
_x1611-3349 ;
_v1503
505 0 _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.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aComputer programming.
650 0 _aCompilers (Computer programs).
650 1 4 _aTheory of Computation.
650 2 4 _aSoftware Engineering.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aProgramming Techniques.
650 2 4 _aCompilers and Interpreters.
700 1 _aLevi, Giorgio.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540650140
776 0 8 _iPrinted edition:
_z9783662175309
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1503
856 4 0 _uhttps://doi.org/10.1007/3-540-49727-7
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188598
_d188598