Titlebook: Reachability Problems; Third International Olivier Bournez,Igor Potapov Conference proceedings 2009 Springer-Verlag Berlin Heidelberg 2009

清楚說話

How to Tackle Integer Weighted Automata Positivity,abstractions is studied to build the deterministic reachability graphs allowing us to semi-decide the positivity problem on these automata. Moreover, the papers reports on the implementations and experimental results, and discusses other encodings.

ABOUT

ARCHE

Memorial

Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order,cally. In this model the set of successors of a regular set of configurations can be non-regular, making forward analysis of these models difficult. We refine the model by adding the associative-commutative properties of parallel composition, and we define Presburger weighted tree automata, an exten

interlude

foodstuff

Abstract Counterexamples for Non-disjunctive Abstractions,ly used, for example in selecting predicates for predicate abstraction. To date, however, it has been applied primarily to powerset abstractions, which allow one to speak of an abstract transition system and abstract states. Here, we describe a general framework for CEGAR in non-disjunctive abstract

乏味

Cross-Checking - Enhanced Over-Approximation of the Reachable Global State Space of Component-Basednent-based systems to obtain a first approximation of the reachable global state space. In order to improve this approximation we introduce a new technique we call cross-checking. The resulting approximation can be used to study global properties of component-based systems, which we demonstrate here

Lignans

0302-9743 009. The 20 full papers of this workshop reflect reachability problems that appear in algebraic structures, computational models, hybrid systems and verification. Reachability is a fundamental problem in the context of many models and abstractions which are describing various computational processes

promote

Automatic Verification of Directory-Based Consistency Protocols,cation procedure computes an approximated backward reachability analysis by using a symbolic representation of sets of configurations. Termination is ensured by using the theory of well-quasi orderings.

consolidate

Abstract Counterexamples for Non-disjunctive Abstractions,d Predicate Abstraction (IPA), a promising technique for synthesizing quantified inductive invariants of infinite-state systems. In principle, it can be applied to other non-disjunctive abstractions occurring in program analysis.