1895 search results - page 301 / 379 » Using ATL for Checking Models |
133
click to vote
IANDC
2007
15 years 2 months ago
2007
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
148
click to vote
JACM
2002
15 years 2 months ago
2002
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: ...
126
click to vote
PLDI
2011
ACM
14 years 5 months ago
2011
ACM
The most intuitive memory consistency model for shared-memory multi-threaded programming is sequential consistency (SC). However, current concurrent programming languages support ...
115
click to vote
KBSE
1998
IEEE
15 years 6 months ago
1998
IEEE
Most efforts to automate formal verification of communicating systems have centred around finite-state systems (FSSs). However, FSSs are incapable of modelling many practical comm...
127
click to vote
ICSE
1993
IEEE-ACM
15 years 6 months ago
1993
IEEE-ACM
Composite systems generally comprise heterogeneous components whose specifications are developed by many development participants. The requirements of such systems are invariably ...