000 | 03295nam a22005895i 4500 | ||
---|---|---|---|
001 | 978-3-540-45099-3 | ||
003 | DE-He213 | ||
005 | 20240423132521.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s2000 gw | s |||| 0|eng d | ||
020 |
_a9783540450993 _9978-3-540-45099-3 |
||
024 | 7 |
_a10.1007/b87738 _2doi |
|
050 | 4 | _aQA76.76.C65 | |
072 | 7 |
_aUMC _2bicssc |
|
072 | 7 |
_aCOM010000 _2bisacsh |
|
072 | 7 |
_aUMC _2thema |
|
082 | 0 | 4 |
_a005.45 _223 |
245 | 1 | 0 |
_aStatic Analysis _h[electronic resource] : _b7th International Symposium, SAS 2000, Santa Barbara, CA, USA, June 29 - July 6, 2000, Proceedings / _cedited by Jens Palsberg. |
250 | _a1st ed. 2000. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2000. |
|
300 |
_aVIII, 433 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 ; _v1824 |
|
505 | 0 | _aInvited Papers -- Enforcing Design Constraints with Object Logic -- Model Checking as Constraint Solving -- Contributed Papers -- Abstract Interpretation Based Semantics of Sequent Calculi -- A Transformational Approach for Generating Non-linear Invariants -- Deriving Parallel Codes via Invariants -- Safety of Strictness Analysis via Term Graph Rewriting -- Checking Cleanness in Linked Lists -- Confidentiality Analysis of Mobile Systems -- Unified Analysis of Array and Object References in Strongly Typed Languages -- Polymorphic versus Monomorphic Flow-Insensitive Points-To Analysis for C -- Efficient Inference of Static Types for Java Bytecode -- Abstract Interpretation of Game Properties -- FULLDOC: A Full Reporting Debugger for Optimized Code -- Partial Redundancy Elimination on Predicated Code -- TVLA: A System for Implementing Static Analyses -- Tree Schemata and Fair Termination -- Abstract Interpretation of Probabilistic Semantics -- Code Specialization Based on Value Profiles -- Flattening Is an Improvement -- Model Checking Guided Abstraction and Analysis -- Abstract Domains for Sharing Analysis by Optimal Semantics -- Concurrency Analysis for Java. | |
650 | 0 | _aCompilers (Computer programs). | |
650 | 0 | _aComputer science. | |
650 | 0 | _aComputer programming. | |
650 | 0 | _aMachine theory. | |
650 | 0 | _aSoftware engineering. | |
650 | 1 | 4 | _aCompilers and Interpreters. |
650 | 2 | 4 | _aComputer Science Logic and Foundations of Programming. |
650 | 2 | 4 | _aProgramming Techniques. |
650 | 2 | 4 | _aFormal Languages and Automata Theory. |
650 | 2 | 4 | _aSoftware Engineering. |
700 | 1 |
_aPalsberg, Jens. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540676683 |
776 | 0 | 8 |
_iPrinted edition: _z9783662161869 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v1824 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/b87738 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c188629 _d188629 |