| 000 | 05505nam a22005895i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-36577-8 | ||
| 003 | DE-He213 | ||
| 005 | 20240423132458.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 121227s2003 gw | s |||| 0|eng d | ||
| 020 |
_a9783540365778 _9978-3-540-36577-8 |
||
| 024 | 7 |
_a10.1007/3-540-36577-X _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 |
_aTools and Algorithms for the Construction and Analysis of Systems _h[electronic resource] : _b9th International Conference, TACAS 2003, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003, Warsaw, Poland, April 7-11, 2003, Proceedings / _cedited by Hubert Garavel, John Hatcliff. |
| 250 | _a1st ed. 2003. | ||
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2003. |
|
| 300 |
_aXVI, 604 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 ; _v2619 |
|
| 505 | 0 | _aInvited Contributions -- What Are We Trying to Prove? Reflections on Experiences with Proof-Carrying Code -- Bounded Model Checking and SAT-Based Methods -- Automatic Abstraction without Counterexamples -- Bounded Model Checking for Past LTL -- Experimental Analysis of Different Techniques for Bounded Model Checking -- Mu-Calculus and Temporal Logics -- On the Universal and Existential Fragments of the ?-Calculus -- Resets vs. Aborts in Linear Temporal Logic -- A Generic On-the-Fly Solver for Alternation-Free Boolean Equation Systems -- Verification of Parameterized Systems -- Decidability of Invariant Validation for Paramaterized Systems -- Verification and Improvement of the Sliding Window Protocol -- Simple Representative Instantiations for Multicast Protocols -- Rapid Parameterized Model Checking of Snoopy Cache Coherence Protocols -- Abstractions and Counter-Examples -- Proof-Like Counter-Examples -- Multiple-Counterexample Guided Iterative Abstraction Refinement: An Industrial Evaluation -- Verification of Hybrid Systems Based on Counterexample-Guided Abstraction Refinement -- Counter-Example Guided Predicate Abstraction of Hybrid Systems -- Real-Time and Scheduling -- Schedulability Analysis Using Two Clocks -- On Optimal Scheduling under Uncertainty -- Static Guard Analysis in Timed Automata Verification -- Moby/DC – A Tool for Model-Checking Parametric Real-Time Specifications -- ?erics: A Tool for Verifying Timed Automata and Estelle Specifications -- Security and Cryptography -- A New Knowledge Representation Strategy for Cryptographic Protocol Analysis -- Pattern-Based Abstraction for Verifying Secrecy in Protocols -- Modules and Compositional Verification -- Compositional Analysis for Verification of Parameterized Systems -- Learning Assumptions for Compositional Verification.-Automated Module Composition -- Modular Strategies for Recursive Game Graphs -- Symbolic State Spaces and Decision Diagrams -- Saturation Unbound -- Construction of Efficient BDDs for Bounded Arithmetic Constraints -- Performance and Mobility -- Modeling and Analysis of Power-Aware Systems -- A Set of Performance and Dependability Analysis Components for CADP -- The Integrated CWB-NC/PIOATool for Functional Verification and Performance Analysis of Concurrent Systems -- Banana - A Tool for Boundary Ambients Nesting ANAlysis -- State Space Reductions -- State Class Constructions for Branching Analysis of Time Petri Nets -- Branching Processes of High-Level Petri Nets -- Using Petri Net Invariants in State Space Construction -- Optimistic Synchronization-Based State-Space Reduction -- Constraint-Solving and Decision Procedures -- Checking Properties of Heap-Manipulating Procedures with a Constraint Solver -- An Online Proof-Producing Decision Procedure for Mixed-Integer Linear Arithmetic -- Strategies for Combining Decision Procedures -- Testing and Verification -- Generalized Symbolic Execution for Model Checking and Testing -- Code-Based Test Generation for Validation of Functional Processor Descriptions -- Large State Space Visualization -- Automatic Test Generation with AGATHA -- LTSA-MSC: Tool Support for Behaviour Model Elaboration Using Implied Scenarios. | |
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aSoftware engineering. | |
| 650 | 0 | _aComputer networks . | |
| 650 | 0 | _aAlgorithms. | |
| 650 | 1 | 4 | _aTheory of Computation. |
| 650 | 2 | 4 | _aSoftware Engineering. |
| 650 | 2 | 4 | _aComputer Science Logic and Foundations of Programming. |
| 650 | 2 | 4 | _aComputer Communication Networks. |
| 650 | 2 | 4 | _aAlgorithms. |
| 700 | 1 |
_aGaravel, Hubert. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 700 | 1 |
_aHatcliff, John. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540008989 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783662186091 |
| 830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v2619 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/3-540-36577-X |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 912 | _aZDB-2-BAE | ||
| 942 | _cSPRINGER | ||
| 999 |
_c188199 _d188199 |
||