Automated Technology for Verification and Analysis: Third International Symposium, ATVA 2005, Taipei, Taiwan, October 4-7, 2005, Proceedings: Lecture Notes in Computer Science, cartea 3707
Editat de Doron A. Peled, Yih-Kuen Tsayen Limba Engleză Paperback – 19 sep 2005
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 340.32 lei
- 20% Preț: 341.95 lei
- 20% Preț: 453.32 lei
- 20% Preț: 238.01 lei
- 20% Preț: 340.32 lei
- 20% Preț: 438.69 lei
- Preț: 449.57 lei
- 20% Preț: 343.62 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 645.28 lei
- 17% Preț: 427.22 lei
- 20% Preț: 655.02 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 591.51 lei
- Preț: 381.21 lei
- 20% Preț: 337.00 lei
- 15% Preț: 438.59 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 575.48 lei
- 20% Preț: 583.40 lei
- 20% Preț: 763.23 lei
- 15% Preț: 580.46 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 353.50 lei
- 20% Preț: 585.88 lei
- Preț: 410.88 lei
- 20% Preț: 596.46 lei
- 20% Preț: 763.23 lei
- 20% Preț: 825.93 lei
- 20% Preț: 649.49 lei
- 20% Preț: 350.21 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 343.62 lei
Preț vechi: 429.52 lei
-20% Nou
Puncte Express: 515
Preț estimativ în valută:
65.77€ • 67.78$ • 55.52£
65.77€ • 67.78$ • 55.52£
Carte tipărită la comandă
Livrare economică 03-17 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540292098
ISBN-10: 3540292098
Pagini: 524
Ilustrații: XII, 508 p.
Dimensiuni: 152 x 229 x 28 mm
Greutate: 0.73 kg
Ediția:2005
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Programming and Software Engineering
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540292098
Pagini: 524
Ilustrații: XII, 508 p.
Dimensiuni: 152 x 229 x 28 mm
Greutate: 0.73 kg
Ediția:2005
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Programming and Software Engineering
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Keynote Speeches.- Ranking Abstraction as a Companion to Predicate Abstraction.- Termination and Invariance Analysis of Loops.- Some Perspectives of Infinite-State Verification.- Model Checking.- Verifying Very Large Industrial Circuits Using 100 Processes and Beyond.- A New Reachability Algorithm for Symmetric Multi-processor Architecture.- Comprehensive Verification Framework for Dependability of Self-optimizing Systems.- Exploiting Hub States in Automatic Verification.- Combined Methods.- An Approach for the Verification of SystemC Designs Using AsmL.- Decomposition-Based Verification of Cyclic Workflows.- Timed, Embedded, and Hybrid Systems (I).- Guaranteed Termination in the Verification of LTL Properties of Non-linear Robust Discrete Time Hybrid Systems.- Computation Platform for Automatic Analysis of Embedded Software Systems Using Model Based Approach.- Quantitative and Qualitative Analysis of Temporal Aspects of Complex Activities.- Automatic Test Case Generation with Region-Related Coverage Annotations for Real-Time Systems.- Abstraction and Reduction Techniques.- Selective Search in Bounded Model Checking of Reachability Properties.- Predicate Abstraction of RTL Verilog Descriptions Using Constraint Logic Programming.- State Space Exploration of Object-Based Systems Using Equivalence Reduction and the Sweepline Method.- Syntactical Colored Petri Nets Reductions.- Decidability and Complexity.- Algorithmic Algebraic Model Checking II: Decidability of Semi-algebraic Model Checking and Its Applications to Systems Biology.- A Static Analysis Using Tree Automata for XML Access Control.- Reasoning About Transfinite Sequences.- Semi-automatic Distributed Synthesis.- Established Formalisms and Standards.- A New Graph of Classes for the Preservation of Quantitative Temporal Constraints.- Comparison of Different Semantics for Time Petri Nets.- Introducing Dynamic Properties with Past Temporal Operators in the B Refinement.- Approximate Reachability for Dead Code Elimination in Esterel???.- Compositional Verification and Games.- Synthesis of Interface Automata.- Multi-valued Model Checking Games.- Timed, Embedded, and Hybrid Systems (II).- Model Checking Prioritized Timed Automata.- An MTBDD-Based Implementation of Forward Reachability for Probabilistic Timed Automata.- Protocols Analysis, Case Studies, and Tools.- An EFSM-Based Intrusion Detection System for Ad Hoc Networks.- Modeling and Verification of a Telecommunication Application Using Live Sequence Charts and the Play-Engine Tool.- Formal Construction and Verification of Home Service Robots: A Case Study.- Model Checking Real Time Java Using Java PathFinder.- Infinite-State and Parameterized Systems.- Using Parametric Automata for the Verification of the Stop-and-Wait Class of Protocols.- Flat Acceleration in Symbolic Model Checking.- Flat Counter Automata Almost Everywhere!.