Sciweavers

383 search results - page 2 / 77
» Testing Concurrent Systems: A Formal Approach
Sort
View
SIAMCOMP
2002
90views more  SIAMCOMP 2002»
13 years 7 months ago
A Virtually Synchronous Group Multicast Algorithm for WANs: Formal Approach
This paper presents a formal design for a novel group communication service targeted for WANs. The service provides Virtual Synchrony semantics. Such semantics facilitate the desi...
Idit Keidar, Roger Khazan
CONCUR
2006
Springer
13 years 11 months ago
Concurrent Rewriting for Graphs with Equivalences
Several applications of graph rewriting systems (notably, some encodings of calculi with name passing) require rules which, besides deleting and generating graph items, are able to...
Paolo Baldan, Fabio Gadducci, Ugo Montanari
FATES
2005
Springer
14 years 29 days ago
Testing Systems of Concurrent Black-Boxes-An Automata-Theoretic and Decompositional Approach
The global testing problem studied in this paper is to seek a definite answer to whether a system of concurrent black-boxes has an observable behavior in a given finite (but cou...
Gaoyan Xie, Zhe Dang
ASWEC
2005
IEEE
14 years 1 months ago
A UML Approach to the Generation of Test Sequences for Java-Based Concurrent Systems
Starting with a UML specification that captures the underlying functionality of some given Java-based concurrent system, we describe a systematic way to construct, from this speci...
Soon-Kyeong Kim, Luke Wildman, Roger Duke
ISTA
2003
13 years 8 months ago
Formal Modeling of Communication Traces
: Development of distributed systems is complicated by the absence of reliable global timing, concurrency, and nondeterminism. To deal with these obstacles log files are produced b...
Sergiy Boroday, Hesham Hallal, Alexandre Petrenko,...