Sciweavers

184 search results - page 7 / 37
» Testing Distributed Systems Through Symbolic Model Checking
Sort
View
FMOODS
2007
13 years 9 months ago
Verifying Distributed, Event-Based Middleware Applications Using Domain-Specific Software Model Checking
The success of distributed event-based infrastructures such as SIENA and Elvin is partially due to their ease of use. Even novice users of these infrastructures not versed in distr...
L. Ruhai Cai, Jeremy S. Bradbury, Jürgen Ding...
FOSSACS
2007
Springer
14 years 1 months ago
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
Matthew Hague, C.-H. Luke Ong
DSRT
2008
IEEE
13 years 9 months ago
Two Complementary Tools for the Formal Testing of Distributed Systems with Time Constraints
The complexity and the variety of the deployed timedependent systems, as well as the high degree of reliability required for their global functioning, justify the care provided to...
Ana R. Cavalli, Edgardo Montes de Oca, Wissam Mall...
ATVA
2007
Springer
136views Hardware» more  ATVA 2007»
14 years 1 months ago
Symbolic Fault Tree Analysis for Reactive Systems
Fault tree analysis is a traditional and well-established technique for analyzing system design and robustness. Its purpose is to identify sets of basic events, called cut sets, wh...
Marco Bozzano, Alessandro Cimatti, Francesco Tappa...
CONCUR
1997
Springer
13 years 12 months ago
Reachability Analysis of Pushdown Automata: Application to Model-Checking
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
Ahmed Bouajjani, Javier Esparza, Oded Maler