Sciweavers

ATVA
2009
Springer
173views Hardware» more  ATVA 2009»
14 years 6 months ago
Solving Parity Games in Practice
Parity games are 2-player games of perfect information and infinite duration that have important applications in automata theory and decision procedures (validity as well as model...
Oliver Friedmann, Martin Lange
ATVA
2009
Springer
149views Hardware» more  ATVA 2009»
14 years 6 months ago
A Decompositional Proof Scheme for Automated Convergence Proofs of Stochastic Hybrid Systems
In this paper, we describe a decompositional approach to convergence proofs for stochastic hybrid systems given as probabilistic hybrid automata. We focus on a concept called “st...
Jens Oehlerking, Oliver E. Theel
ATVA
2009
Springer
109views Hardware» more  ATVA 2009»
14 years 6 months ago
On-the-fly Emptiness Check of Transition-Based Streett Automata
Alexandre Duret-Lutz, Denis Poitrenaud, Jean-Miche...
ATVA
2009
Springer
100views Hardware» more  ATVA 2009»
14 years 6 months ago
Dynamic Observers for the Synthesis of Opaque Systems
: In this paper, we address the problem of synthesizing opaque systems. A secret predicate S over the runs of a system G is opaque to an external user having partial observability ...
Franck Cassez, Jérémy Dubreil, Herv&...
ATVA
2009
Springer
158views Hardware» more  ATVA 2009»
14 years 6 months ago
Logahedra: A New Weakly Relational Domain
Weakly relational numeric domains express restricted classes of linear inequalities that strike a balance between what can be described and what can be efficiently computed. Popula...
Jacob M. Howe, Andy King
ATVA
2009
Springer
89views Hardware» more  ATVA 2009»
14 years 6 months ago
A Data Symmetry Reduction Technique for Temporal-epistemic Logic
We present a data symmetry reduction approach for model temporal-epistemic logic. The technique abstracts the epistemic indistinguishably relation for the knowledge operators, and ...
Mika Cohen, Mads Dam, Alessio Lomuscio, Hongyang Q...
ATVA
2009
Springer
125views Hardware» more  ATVA 2009»
14 years 6 months ago
Automated Analysis of Data-Dependent Programs with Dynamic Memory
We present a new approach for automatic verification of data-dependent programs manipulating dynamic heaps. A heap is encoded by a graph where the nodes represent the cells, and t...
Parosh Aziz Abdulla, Muhsin Atto, Jonathan Cederbe...
ATVA
2009
Springer
85views Hardware» more  ATVA 2009»
14 years 6 months ago
Quantitative Analysis under Fairness Constraints
Christel Baier, Marcus Größer, Frank Ci...
ATVA
2009
Springer
116views Hardware» more  ATVA 2009»
14 years 6 months ago
Don't Know for Multi-valued Systems
This paper studies abstraction and refinement techniques in the setting of multi-valued model checking for the μ-calculus. Two dimensions of abstrace identified and studied: Abs...
Alarico Campetelli, Alexander Gruler, Martin Leuck...
ATVA
2009
Springer
172views Hardware» more  ATVA 2009»
14 years 6 months ago
Symbolic CTL Model Checking of Asynchronous Systems Using Constrained Saturation
Abstract. The saturation state-space generation algorithm has demonstrated clear improvements over state-of-the-art symbolic methods for asynchronous systems. This work is motivate...
Yang Zhao, Gianfranco Ciardo