Cantitate/Preț
Produs

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 Chin
en Limba Engleză Paperback – 3 sep 2010

Din seria Lecture Notes in Computer Science

Preț: 33264 lei

Preț vechi: 41580 lei
-20% Nou

Puncte Express: 499

Preț estimativ în valută:
6368 6619$ 5280£

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

Public țintă

Research

Cuprins

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.