Automated Technology for Verification and Analysis: 8th International Symposium, ATVA 2010, Singapore, September 21-24, 2010, Proceedings: Lecture Notes in Computer Science, cartea 6252
Editat de Ahmed Bouajjani, Wei-Ngan Chinen Limba Engleză Paperback – 3 sep 2010
Din seria Lecture Notes in Computer Science
- 20% Preț: 1040.03 lei
- 20% Preț: 333.46 lei
- 20% Preț: 335.08 lei
- 20% Preț: 444.17 lei
- 20% Preț: 238.01 lei
- 20% Preț: 333.46 lei
- 20% Preț: 438.69 lei
- Preț: 440.52 lei
- 20% Preț: 336.71 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 632.22 lei
- 17% Preț: 427.22 lei
- 20% Preț: 641.78 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1053.45 lei
- 20% Preț: 579.56 lei
- Preț: 373.56 lei
- 20% Preț: 330.23 lei
- 15% Preț: 429.74 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1386.07 lei
- 20% Preț: 1003.66 lei
- 20% Preț: 567.60 lei
- 20% Preț: 575.48 lei
- 20% Preț: 571.63 lei
- 20% Preț: 747.79 lei
- 15% Preț: 568.74 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 346.40 lei
- 20% Preț: 574.05 lei
- Preț: 402.62 lei
- 20% Preț: 584.40 lei
- 20% Preț: 747.79 lei
- 20% Preț: 809.19 lei
- 20% Preț: 649.49 lei
- 20% Preț: 343.16 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 332.64 lei
Preț vechi: 415.80 lei
-20% Nou
Puncte Express: 499
Preț estimativ în valută:
63.68€ • 66.19$ • 52.80£
63.68€ • 66.19$ • 52.80£
Carte disponibilă
Livrare economică 15-29 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642156427
ISBN-10: 3642156428
Pagini: 404
Ilustrații: VIII, 404 p. 112 illus.
Greutate: 0.61 kg
Ediția:2010
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: 3642156428
Pagini: 404
Ilustrații: VIII, 404 p. 112 illus.
Greutate: 0.61 kg
Ediția:2010
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
Invited Talks.- Probabilistic Automata on Infinite Words: Decidability and Undecidability Results.- Abstraction Learning.- Synthesis: Words and Traces.- Regular Papers.- Promptness in ?-Regular Automata.- Using Redundant Constraints for Refinement.- Methods for Knowledge Based Controlling of Distributed Systems.- Composing Reachability Analyses of Hybrid Systems for Safety and Stability.- The Complexity of Codiagnosability for Discrete Event and Timed Systems.- On Scenario Synchronization.- Compositional Algorithms for LTL Synthesis.- What’s Decidable about Sequences?.- A Study of the Convergence of Steady State Probabilities in a Closed Fork-Join Network.- Lattice-Valued Binary Decision Diagrams.- A Specification Logic for Exceptions and Beyond.- Non-monotonic Refinement of Control Abstraction for Concurrent Programs.- An Approach for Class Testing from Class Contracts.- Efficient On-the-Fly Emptiness Check for Timed Büchi Automata.- Reachability as Derivability, Finite Countermodels and Verification.- LTL Can Be More Succinct.- Automatic Generation of History-Based Access Control from Information Flow Specification.- Auxiliary Constructs for Proving Liveness in Compassion Discrete Systems.- Symbolic Unfolding of Parametric Stopwatch Petri Nets.- Recursive Timed Automata.- Probabilistic Contracts for Component-Based Design.- Tool Papers.- Model-Checking Web Applications with Web-TLR.- GAVS: Game Arena Visualization and Synthesis.- CRI: Symbolic Debugger for MCAPI Applications.- MCGP: A Software Synthesis Tool Based on Model Checking and Genetic Programming.- ECDAR: An Environment for Compositional Design and Analysis of Real Time Systems.- Developing Model Checkers Using PAT.- YAGA: Automated Analysis of Quantitative Safety Specifications in Probabilistic B.-COMBINE: A Tool on Combined Formal Methods for Bindingly Verification.- Rbminer: A Tool for Discovering Petri Nets from Transition Systems.