8. ATVA 2010:
Singapore
Ahmed Bouajjani, Wei-Ngan Chin (Eds.):
Automated Technology for Verification and Analysis - 8th International Symposium, ATVA 2010, Singapore, September 21-24, 2010. Proceedings.
Lecture Notes in Computer Science 6252 Springer 2010, ISBN 978-3-642-15642-7
Invited Talks
Regular Papers
- Shaull Almagor, Yoram Hirshfeld, Orna Kupferman:
Promptness in omega-Regular Automata.
22-36
- Eugene Asarin, Thao Dang, Oded Maler, Romain Testylier:
Using Redundant Constraints for Refinement.
37-51
- Saddek Bensalem, Marius Bozga, Susanne Graf, Doron Peled, Sophie Quinton:
Methods for Knowledge Based Controlling of Distributed Systems.
52-66
- Sergiy Bogomolov, Corina Mitrohin, Andreas Podelski:
Composing Reachability Analyses of Hybrid Systems for Safety and Stability.
67-81
- Franck Cassez:
The Complexity of Codiagnosability for Discrete Event and Timed Systems.
82-96
- Duc-Hanh Dang, Anh-Hoang Truong, Martin Gogolla:
On Scenario Synchronization.
97-111
- Emmanuel Filiot, Naiyong Jin, Jean-François Raskin:
Compositional Algorithms for LTL Synthesis.
112-127
- Carlo A. Furia:
What's Decidable about Sequences?
128-142
- Guy Edward Gallasch, Jonathan Billington:
A Study of the Convergence of Steady State Probabilities in a Closed Fork-Join Network.
143-157
- Gilles Geeraerts, Gabriel Kalyon, Tristan Le Gall, Nicolas Maquet, Jean-François Raskin:
Lattice-Valued Binary Decision Diagrams.
158-172
- Cristian Gherghina, Cristina David:
A Specification Logic for Exceptions and Beyond.
173-187
- Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenko:
Non-monotonic Refinement of Control Abstraction for Concurrent Programs.
188-202
- Atul Gupta:
An Approach for Class Testing from Class Contracts.
203-217
- Frédéric Herbreteau, B. Srivathsan:
Efficient On-the-Fly Emptiness Check for Timed Büchi Automata.
218-232
- Alexei Lisitsa:
Reachability as Derivability, Finite Countermodels and Verification.
233-244
- Kamal Lodaya, A. V. Sreejith:
LTL Can Be More Succinct.
245-258
- Yoshiaki Takata, Hiroyuki Seki:
Automatic Generation of History-Based Access Control from Information Flow Specification.
259-275
- Teng Long, Wenhui Zhang:
Auxiliary Constructs for Proving Liveness in Compassion Discrete Systems.
276-290
- Louis-Marie Traonouez, Bartosz Grabiec, Claude Jard, Didier Lime, Olivier H. Roux:
Symbolic Unfolding of Parametric Stopwatch Petri Nets.
291-305
- Ashutosh Trivedi, Dominik Wojtczak:
Recursive Timed Automata.
306-324
- Dana N. Xu, Gregor Gößler, Alain Girault:
Probabilistic Contracts for Component-Based Design.
325-340
Tool Papers
- María Alpuente, Demis Ballis, Javier Espert, Daniel Romero:
Model-Checking Web Applications with Web-TLR.
341-346
- Chih-Hong Cheng, Christian Buckl, Michael Luttenberger, Alois Knoll:
GAVS: Game Arena Visualization and Synthesis.
347-352
- Mohamed Elwakil, Zijiang Yang, Liqiang Wang:
CRI: Symbolic Debugger for MCAPI Applications.
353-358
- Gal Katz, Doron Peled:
MCGP: A Software Synthesis Tool Based on Model Checking and Genetic Programming.
359-364
- Alexandre David, Kim Guldstrand Larsen, Axel Legay, Ulrik Nyman, Andrzej Wasowski:
ECDAR: An Environment for Compositional Design and Analysis of Real Time Systems.
365-370
- Yang Liu, Jun Sun, Jin Song Dong:
Developing Model Checkers Using PAT.
371-377
- Ukachukwu Ndukwu, A. K. McIver:
YAGA: Automated Analysis of Quantitative Safety Specifications in Probabilistic B.
378-386
- An N. Nguyen, Tho T. Quan, Phung H. Nguyen, Thang H. Bui:
COMBINE: A Tool on Combined Formal Methods for Bindingly Verification.
387-395
- Marc Solé, Josep Carmona:
Rbminer: A Tool for Discovering Petri Nets from Transition Systems.
396-402
Last update Tue May 22 23:22:59 2012
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page