Sciweavers

20 search results - page 4 / 4
» atva 2009
Sort
View
ATVA
2009
Springer
172views Hardware» more  ATVA 2009»
13 years 12 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
ATVA
2009
Springer
149views Hardware» more  ATVA 2009»
13 years 12 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
125views Hardware» more  ATVA 2009»
13 years 12 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
97views Hardware» more  ATVA 2009»
13 years 6 months ago
Memory Usage Verification Using Hip/Sleek
Embedded systems often come with constrained memory footprints. It is therefore essential to ensure that software running on such platforms fulfils memory usage specifications at c...
Guanhua He, Shengchao Qin, Chenguang Luo, Wei-Ngan...
ATVA
2009
Springer
100views Hardware» more  ATVA 2009»
13 years 12 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&...