Automated Technology for Verification and Analysis : 8th International Symposium, ATVA 2010, Singapore, September 21-24, 2010, Proceedings
by Bouajjani, Ahmed; Chin, Wei-NganEdition: 1st
Format: Paperback
Pub. Date: 2010-10-12
Publisher(s): Springer-Verlag New York Inc
Other versions by this Author
-
This Item Qualifies for Free Shipping!*
*Excludes marketplace orders.
List Price: $114.45
Rent Textbook
Select for Price
New Textbook
We're Sorry
Sold Out
Used Textbook
We're Sorry
Sold Out
eTextbook
We're Sorry
Not Available
How Marketplace Works:
- This item is offered by an independent seller and not shipped from our warehouse
- Item details like edition and cover design may differ from our description; see seller's comments before ordering.
- Sellers much confirm and ship within two business days; otherwise, the order will be cancelled and refunded.
- Marketplace purchases cannot be returned to eCampus.com. Contact the seller directly for inquiries; if no response within two days, contact customer service.
- Additional shipping costs apply to Marketplace purchases. Review shipping costs at checkout.
Summary
This book constitutes the refereed proceedings of the 8th International Symposium on Automated Technology for Verification and Analysis, ATVA 2010, held in Singapore, in September 2010.The book includes 3 invited talks, 21 regular papers and 9 tool papers.
Table of Contents
| Invited Talks | |
| Probabilistic Automata on Infinite Words: Decidability and Undecidability Results | p. 1 |
| Abstraction Learning | p. 17 |
| Synthesis: Words and Traces | p. 18 |
| Regular Papers | |
| Promptness in ¿-Regular Automata | p. 22 |
| Using Redundant Constraints for Refinement | p. 37 |
| Methods for Knowledge Based Controlling of Distributed Systems | p. 52 |
| Composing Reachability Analyses of Hybrid Systems for Safety and Stability | p. 67 |
| The Complexity of Codiagnosability for Discrete Event and Timed Systems | p. 82 |
| On Scenario Synchronization | p. 97 |
| Compositional Algorithms for LTL Synthesis | p. 112 |
| What's Decidable about Sequences? | p. 128 |
| A Study of the Convergence of Steady State Probabilities in a Closed Fork-Join Network | p. 143 |
| Lattice-Valued Binary Decision Diagrams | p. 158 |
| A Specification Logic for Exceptions and Beyond | p. 173 |
| Non-monotonic Refinement of Control Abstraction for Concurrent Programs | p. 188 |
| An Approach for Class Testing from Class Contracts | p. 203 |
| Efficient On-the-Fly Emptiness Check for Timed Büchi Automata | p. 218 |
| Reachability as Derivability, Finite Countermodels and Verification | p. 233 |
| LTL Can Be More Succinct | p. 245 |
| Automatic Generation of History-Based Access Control from Information Flow Specification | p. 259 |
| Auxiliary Constructs for Proving Liveness in Compassion Discrete Systems | p. 276 |
| Symbolic Unfolding of Parametric Stopwatch Petri Nets | p. 291 |
| Recursive Timed Automata | p. 306 |
| Probabilistic Contracts for Component-Based Design | p. 325 |
| Tool Papers | |
| Model-Checking Web Applications with Web-TLR | p. 341 |
| GAVS: Game Arena Visualization and Synthesis | p. 347 |
| CRI: Symbolic Debugger for MCAPI Applications | p. 353 |
| MCGP: A Software Synthesis Tool Based on Model Checking and Genetic Programming | p. 359 |
| ECDAR: An Environment for Compositional Design and Analysis of Real Time Systems | p. 365 |
| Developing Model Checkers Using PAT | p. 371 |
| YAGA: Automated Analysis of Quantitative Safety Specifications in Probabilistic B | p. 378 |
| COMBINE: A Tool on Combined Formal Methods for Bindingly Verification | p. 387 |
| Rbminer: A Tool for Discovering Petri Nets from Transition Systems | p. 396 |
| Author Index | p. 403 |
| Table of Contents provided by Ingram. All Rights Reserved. |
An electronic version of this book is available through VitalSource.
This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.
By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.
Digital License
You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.
More details can be found here.
A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.
Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.
Please view the compatibility matrix prior to purchase.