000 03861nam a22005775i 4500
001 978-3-540-37758-0
003 DE-He213
005 20240730173534.0
007 cr nn 008mamaa
008 100301s2006 gw | s |||| 0|eng d
020 _a9783540377580
_9978-3-540-37758-0
024 7 _a10.1007/11823230
_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] :
_b13th International Symposium, SAS 2006, Seoul, Korea, August 29-31, 2006, Proceedings /
_cedited by Kwangkeun Yi.
250 _a1st ed. 2006.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2006.
300 _aXIII, 443 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aProgramming and Software Engineering,
_x2945-9168 ;
_v4134
505 0 _aInvited Talk -- Unleashing the Power of Static Analysis -- Session 1 -- Static Analysis in Disjunctive Numerical Domains -- Static Analysis of Numerical Algorithms -- Static Analysis of String Manipulations in Critical Embedded C Programs -- Session 2 -- Abstract Regular Tree Model Checking of Complex Dynamic Data Structures -- Structural Invariants -- Existential Label Flow Inference Via CFL Reachability -- Session 3 -- Abstract Interpretation with Specialized Definitions -- Underapproximating Predicate Transformers -- Combining Widening and Acceleration in Linear Relation Analysis -- Beyond Iteration Vectors: Instancewise Relational Abstract Domains -- Invited Talk -- Separation Logic and Program Analysis -- Beyond Reachability: Shape Abstraction in the Presence of Pointer Arithmetic -- Session 4 -- Specialized 3-Valued Logic Shape Analysis Using Structure-Based Refinement and Loose Embedding -- Recency-Abstraction for Heap-Allocated Storage -- Interprocedural Shape Analysis with Separated Heap Abstractions -- Automated Verification of the Deutsch-Schorr-Waite Tree-Traversal Algorithm -- Invited Talk -- Shape Analysis for Low-Level Code -- Session 5 -- Catching and Identifying Bugs in Register Allocation -- Certificate Translation for Optimizing Compilers -- Analysis of Low-Level Code Using Cooperating Decompilers -- Session 6 -- Static Analysis for Java Servlets and JSP -- Cryptographically-Masked Flows -- Proving the Properties of Communicating Imperfectly-Clocked Synchronous Systems -- Session 7 -- Parametric and Termination-Sensitive Control Dependence -- Memory Leak Analysis by Contradiction -- Path-Sensitive Dataflow Analysis with Iterative Refinement.
650 0 _aSoftware engineering.
_94138
650 0 _aCompilers (Computer programs).
_93350
650 0 _aComputer science.
_99832
650 0 _aMachine theory.
_9108668
650 0 _aComputer programming.
_94169
650 1 4 _aSoftware Engineering.
_94138
650 2 4 _aCompilers and Interpreters.
_931853
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aFormal Languages and Automata Theory.
_9108669
650 2 4 _aProgramming Techniques.
_9108670
700 1 _aYi, Kwangkeun.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9108671
710 2 _aSpringerLink (Online service)
_9108672
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540377566
776 0 8 _iPrinted edition:
_z9783540828167
830 0 _aProgramming and Software Engineering,
_x2945-9168 ;
_v4134
_9108673
856 4 0 _uhttps://doi.org/10.1007/11823230
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c88972
_d88972