1895 search results - page 191 / 379 » Using ATL for Checking Models |
160
click to vote
ICWS
2009
IEEE
16 years 3 months ago
2009
IEEE
Analyzing interactions among peers that interact via messages is a crucial problem due to increasingly distributed nature of current software systems, especially the ones built us...
191
click to vote
FORMATS
2003
Springer
15 years 11 months ago
2003
Springer
Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a specification formalism suitable for describing both nondeterminis...
151
click to vote
RE
2001
Springer
15 years 10 months ago
2001
Springer
at different levels of abstraction. There are two very different ways of using such languages. One approach is based on the manifestation of a single model, with construction of di...
181
click to vote
ICECCS
2010
IEEE
15 years 6 months ago
2010
IEEE
Abstract—Transactional Memory (TM) is a promising technique that addresses the difficulty of parallel programming. Since TM takes responsibility for all concurrency control, TM ...
274
click to vote
CONCUR
2011
Springer
14 years 6 months ago
2011
Springer
The problem of model checking threads interacting purely via the standard synchronization primitives is key for many concurrent program analyses, particularly dataflow analysis. U...