000 04558nam a22006255i 4500
001 978-3-540-45789-3
003 DE-He213
005 20240423132517.0
007 cr nn 008mamaa
008 121227s2002 gw | s |||| 0|eng d
020 _a9783540457893
_9978-3-540-45789-3
024 7 _a10.1007/3-540-45789-5
_2doi
050 4 _aQA76.9.D3
072 7 _aUN
_2bicssc
072 7 _aCOM021000
_2bisacsh
072 7 _aUN
_2thema
082 0 4 _a005.74
_223
245 1 0 _aStatic Analysis
_h[electronic resource] :
_b9th International Symposium, SAS 2002, Madrid, Spain, September 17-20, 2002. Proceedings /
_cedited by Manuel Hermenegildo, German Puebla.
250 _a1st ed. 2002.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2002.
300 _aXII, 536 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 ;
_v2477
505 0 _aStatic Program Analysis via 3-Valued Logic -- Open Modeling in Multi-stakeholder Distributed Systems: Research and Tool Challenges -- An Algebraic Approach to the Static Analysis of Concurrent Software -- Polynomial Constants Are Decidable -- Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi -- Nonuniform Alias Analysis of Recursive Data Structures and Arrays -- Representing and Approximating Transfer Functions in Abstract Interpretation of Hetereogeneous Datatypes -- Automated Verification of Concurrent Linked Lists with Counters -- Backward Type Inference Generalises Type Checking -- More Precise Yet Efficient Type Inference for Logic Programs -- A Few Graph-Based Relational Numerical Abstract Domains -- Static Analysis of the Numerical Stability of Loops -- On Termination of Logic Programs with Floating Point Computations -- Modular Control Flow Analysis for Libraries -- An Efficient Inclusion-Based Points-To Analysis for Strictly-Typed Languages -- Compactly Representing First-Order Structures for Static Analysis -- Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library -- Speeding Up Dataflow Analysis Using Flow-Insensitive Pointer Analysis -- Improving the Precision of Equality-Based Dataflow Analyses -- Guaranteed Optimization: Proving Nullspace Properties of Compilers -- Representation Analysis for Coercion Placement -- Pipeline Modeling for Timing Analysis -- Analysing Approximate Confinement under Uniform Attacks -- An Improved Constraint-Based System for the Verification of Security Protocols -- From Secrecy to Authenticity in Security Protocols -- Security Typings by Abstract Interpretation -- Static Confidentiality Enforcement for Distributed Programs -- Refinement of LTL Formulas for Abstract Model Checking -- Making Abstract Model Checking Strongly Preserving -- Semantics for Abstract Interpretation-Based Static Analyzes of Temporal Properties -- Checking Safety Properties of Behavioral VHDL Descriptions by Abstract Interpretation -- States vs. Traces in Model Checking by Abstract Interpretation -- Reuse of Results in Termination Analysis of Typed Logic Programs -- Finiteness Analysis in Polynomial Time -- Detecting Optimal Termination Conditions of Logic Programs.
650 0 _aDatabase management.
650 0 _aCompilers (Computer programs).
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aMachine theory.
650 0 _aComputer programming.
650 1 4 _aDatabase Management.
650 2 4 _aCompilers and Interpreters.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aSoftware Engineering.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aProgramming Techniques.
700 1 _aHermenegildo, Manuel.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aPuebla, German.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540442356
776 0 8 _iPrinted edition:
_z9783662197905
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2477
856 4 0 _uhttps://doi.org/10.1007/3-540-45789-5
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188553
_d188553