Automated Technology for Verification and Analysis

4th International Symposium, ATVA 2006, Beijing, China, October 23-26, 2006, Proceedings

Susanne Graf, Wenhui Zhang (Herausgeber)

Buch | Softcover

XIV, 546 Seiten

2006 | 2006
Springer Berlin (Verlag)
978-3-540-47237-7 (ISBN)

Artikel merken

The Automated Technology for Veri?cation and Analysis (ATVA) international symposium series was initiated in 2003, responding to a growing interest in formal veri?cation spurred by the booming IT industry, particularly hardware design and manufacturing in East Asia. Its purpose is to promote research on automated veri?cation and analysis in the region by providing a forum for int- action between the regional and the international research/industrial commu- ties of the ?eld. ATVA 2006, the fourth of the ATVA series, was held in Beijing, China, October 23-26, 2006. The main topics of the symposium include th- ries useful for providing designers with automated support for obtaining correct software or hardware systems, as well as the implementation of such theories in tools or their application. This year, we received a record number of papers: a total of 137 submissions from 27 countries. Each submission was assigned to three Program Comm- tee members, who could request help from subreviewers, for rigorous and fair evaluation. The ?nal deliberation by the Program Committee was conducted through Springer's Online Conference Service for a duration of about 10 days after nearly all review reports had been collected. In the end, 35 papers were selected for inclusion in the program. ATVA 2006 had three keynote speeches given respectively by Thomas Ball, Jin Yang, and Mihalis Yannakakis. The main symposium was preceded by a tutorial day, consisting of three two-hourlectures given by the keynotespeakers.

Keynote Speeches.- Analysis of Recursive Probabilistic Models.- Verification Challenges and Opportunities in the New Era of Microprocessor Design.- Automated Abstraction of Software.- Regular Papers.- Symmetry Reduction for Probabilistic Model Checking Using Generic Representatives.- Eager Markov Chains.- A Probabilistic Learning Approach for Counterexample Guided Abstraction Refinement.- A Fine-Grained Fullness-Guided Chaining Heuristic for Symbolic Reachability Analysis.- Model Checking Timed Systems with Urgencies.- Whodunit? Causal Analysis for Counterexamples.- On the Membership Problem for Visibly Pushdown Languages.- On the Construction of Fine Automata for Safety Properties.- On the Succinctness of Nondeterminism.- Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains.- Compositional Reasoning for Hardware/Software Co-verification.- Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition.- On the Satisfiability of Modular Arithmetic Formulae.- Selective Approaches for Solving Weak Games.- Controller Synthesis and Ordinal Automata.- Effective Contraction of Timed STGs for Decomposition Based Timed Circuit Synthesis.- Synthesis for Probabilistic Environments.- Branching-Time Property Preservation Between Real-Time Systems.- Automatic Verification of Hybrid Systems with Large Discrete State Space.- Timed Unfoldings for Networks of Timed Automata.- Symbolic Unfoldings for Networks of Timed Automata.- Ranked Predicate Abstraction for Branching Time: Complete, Incremental, and Precise.- Timed Temporal Logics for Abstracting Transient States.- Predicate Abstraction of Programs with Non-linear Computation.- A Fresh Look at Testing for Asynchronous Communication.- Proactive Leader Election in Asynchronous Shared Memory Systems.- A Semantic Framework for Test Coverage.- Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols.- Analyzing Security Protocols in Hierarchical Networks.- Functional Analysis of a Real-Time Protocol for Networked Control Systems.- Symbolic Semantics for the Verification of Security Properties of Mobile Petri Nets.- Sigref - A Symbolic Bisimulation Tool Box.- Towards a Model-Checker for Counter Systems.- The Implementation of Mazurkiewicz Traces in POEM.- Model-Based Tool-Chain Infrastructure for Automated Analysis of Embedded Systems.

Erscheint lt. Verlag	10.10.2006
Reihe/Serie	Lecture Notes in Computer Science
Reihe/Serie	Programming and Software Engineering
Zusatzinfo	XIV, 546 p.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 235 mm
Gewicht	776 g
Themenwelt	Informatik ► Weitere Themen ► CAD-Programme
Schlagworte	algorithm • algorithms • Automata • bisimulation • Construction • Embedded Systems • formal methods • formal performance analysis • hardware verification • Hybrid Systems • microprocessor • Model • Model Checking • oetri nets • Probabilistic Models • program analysis • protocal verification • Real-Time Systems • Refinement • Software Verification • Systems Analysis • Systems Design • systems verification • timed systems • Validation • verification
ISBN-10	3-540-47237-1 / 3540472371
ISBN-13	978-3-540-47237-7 / 9783540472377
Zustand	Neuware