Vai al contenuto principale della pagina
| Titolo: |
Automated Technology for Verification and Analysis [[electronic resource] ] : 8th International Symposium, ATVA 2010, Singapore, September 21-24, 2010, Proceedings / / edited by Ahmed Bouajjani, Wei-Ngan Chin
|
| Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Edizione: | 1st ed. 2010. |
| Descrizione fisica: | 1 online resource (VIII, 404 p. 112 illus.) |
| Disciplina: | 511.3/6028563 |
| Soggetto topico: | Software engineering |
| Computer programming | |
| Computer communication systems | |
| Computer logic | |
| Programming languages (Electronic computers) | |
| Software Engineering/Programming and Operating Systems | |
| Software Engineering | |
| Programming Techniques | |
| Computer Communication Networks | |
| Logics and Meanings of Programs | |
| Programming Languages, Compilers, Interpreters | |
| Persona (resp. second.): | BouajjaniAhmed |
| ChinWei-Ngan | |
| Note generali: | Bibliographic Level Mode of Issuance: Monograph |
| Nota di bibliografia: | Includes bibliographical references and index. |
| Nota di contenuto: | 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. |
| Titolo autorizzato: | Automated Technology for Verification and Analysis ![]() |
| ISBN: | 1-280-38884-6 |
| 9786613566768 | |
| 3-642-15643-6 | |
| Formato: | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione: | Inglese |
| Record Nr.: | 996465909103316 |
| Lo trovi qui: | Univ. di Salerno |
| Opac: | Controlla la disponibilità qui |