523 search results - page 56 / 105 » A General Model for Reachability Testing of Concurrent Progr... |
111
click to vote
SAIG
2001
Springer
15 years 7 months ago
2001
Springer
Most foundational models for global computing have focused on the spatial dimension of computations, however global computing requires also new ways of thinking about the temporal ...
131
Voted
SIGSOFT
2008
ACM
16 years 3 months ago
2008
ACM
We propose a novel method for modular verification of web service compositions. We first use symbolic fixpoint computations to derive conditions on the incoming messages and relat...
159
click to vote
CL
2007
Springer
15 years 2 months ago
2007
Springer
The CCS (Calculus of Communicating Systems) process algebra is a well-known formal model of synchronization and communication. It is used for the analysis of safety and liveness i...
144
Voted
LCTRTS
2005
Springer
15 years 8 months ago
2005
Springer
Effective use of the memory hierarchy is critical for achieving high performance on embedded systems. We focus on the class of streaming applications, which is increasingly preval...
118
click to vote
RTSS
1998
IEEE
15 years 6 months ago
1998
IEEE
Timed and hybrid automata are extensions of finite-state machines for formal modeling of embedded systems with both discrete and continuous components. Reachability problems for t...