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ț: 461.83 lei - 20%
Preț: 461.57 lei - 20%
Preț: 424.26 lei - 20%
Preț: 390.69 lei - 20%
Preț: 498.50 lei - 15%
Preț: 388.50 lei - 20%
Preț: 390.35 lei - 20%
Preț: 460.98 lei - 20%
Preț: 461.52 lei - 20%
Preț: 497.55 lei - 20%
Preț: 389.72 lei - 20%
Preț: 461.83 lei - 20%
Preț: 389.90 lei - 20%
Preț: 497.04 lei - 20%
Preț: 462.05 lei - 20%
Preț: 391.14 lei - 20%
Preț: 389.85 lei - 20%
Preț: 461.32 lei - 20%
Preț: 498.32 lei - 20%
Preț: 496.64 lei - 20%
Preț: 532.28 lei - 20%
Preț: 527.36 lei - 20%
Preț: 498.46 lei - 15%
Preț: 461.85 lei - 20%
Preț: 390.12 lei - 20%
Preț: 532.41 lei - 20%
Preț: 462.24 lei - 20%
Preț: 391.14 lei - 20%
Preț: 461.77 lei - 20%
Preț: 390.35 lei - 20%
Preț: 461.06 lei - 20%
Preț: 461.65 lei - 20%
Preț: 390.18 lei - 20%
Preț: 392.64 lei - 20%
Preț: 252.15 lei - 20%
Preț: 390.94 lei - 20%
Preț: 461.52 lei - 20%
Preț: 391.86 lei - 20%
Preț: 532.54 lei - 20%
Preț: 462.67 lei - 20%
Preț: 461.65 lei - 20%
Preț: 639.72 lei - 20%
Preț: 255.91 lei - 15%
Preț: 535.92 lei - 20%
Preț: 535.77 lei - 5%
Preț: 516.27 lei - 20%
Preț: 499.36 lei - 20%
Preț: 391.20 lei - 20%
Preț: 391.20 lei - 20%
Preț: 249.95 lei
Preț: 330.54 lei
Preț vechi: 413.16 lei
-20% Nou
Puncte Express: 496
Preț estimativ în valută:
58.48€ • 68.75$ • 51.22£
58.48€ • 68.75$ • 51.22£
Carte disponibilă
Livrare economică 08-22 ianuarie 26
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!.