000 03833nam a22005895i 4500
001 978-3-540-27864-1
003 DE-He213
005 20240423125658.0
007 cr nn 008mamaa
008 121227s2004 gw | s |||| 0|eng d
020 _a9783540278641
_9978-3-540-27864-1
024 7 _a10.1007/b99688
_2doi
050 4 _aQA76.758
072 7 _aUMZ
_2bicssc
072 7 _aCOM051230
_2bisacsh
072 7 _aUMZ
_2thema
082 0 4 _a005.1
_223
245 1 0 _aStatic Analysis
_h[electronic resource] :
_b11th International Symposium, SAS 2004, Verona, Italy, August 26-28, 2004, Proceedings /
_cedited by Roberto Giacobazzi.
250 _a1st ed. 2004.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2004.
300 _aXII, 396 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 ;
_v3148
505 0 _aInvited Talks -- Injecting Life with Computers -- The Blast Query Language for Software Verification -- Program Generators and the Tools to Make Them -- Towards Declarative Programming for Web Services -- Program and System Verification -- Closed and Logical Relations for Over- and Under-Approximation of Powersets -- Completeness Refinement in Abstract Symbolic Trajectory Evaluation -- Constraint-Based Linear-Relations Analysis -- Spatial Analysis of BioAmbients -- Security and Safety -- Modular and Constraint-Based Information Flow Inference for an Object-Oriented Language -- Information Flow Analysis in Logical Form -- Type Inference Against Races -- Pointer Analysis -- Pointer-Range Analysis -- A Scalable Nonuniform Pointer Analysis for Embedded Programs -- Bottom-Up and Top-Down Context-Sensitive Summary-Based Pointer Analysis -- Abstract Interpretation and Algorithms -- Abstract Interpretation of Combinational Asynchronous Circuits -- Static Analysis of Gated Data Dependence Graphs -- A Polynomial-Time Algorithm for Global Value Numbering -- Shape Analysis -- Quantitative Shape Analysis -- A Relational Approach to Interprocedural Shape Analysis -- Partially Disjunctive Heap Abstraction -- Abstract Domain and Data Structures -- An Abstract Interpretation Approach for Automatic Generation of Polynomial Invariants -- Approximating the Algebraic Relational Semantics of Imperative Programs -- The Octahedron Abstract Domain -- Path-Sensitive Analysis for Linear Arithmetic and Uninterpreted Functions -- Shape Analysis and Logic -- On Logics of Aliasing -- Generalized Records and Spatial Conjunction in Role Logic -- Termination Analysis -- Non-termination Inference for Constraint Logic Programs.
650 0 _aSoftware engineering.
650 0 _aCompilers (Computer programs).
650 0 _aComputer science.
650 0 _aMachine theory.
650 0 _aComputer programming.
650 1 4 _aSoftware Engineering.
650 2 4 _aCompilers and Interpreters.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aProgramming Techniques.
700 1 _aGiacobazzi, Roberto.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540227915
776 0 8 _iPrinted edition:
_z9783662192054
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v3148
856 4 0 _uhttps://doi.org/10.1007/b99688
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c180571
_d180571