3575 search results - page 269 / 715 » Modeling Concurrency with Geometry |
168
click to vote
POPL
2010
ACM
16 years 3 months ago
2010
ACM
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
169
click to vote
TACAS
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We describe a scalable incomplete boundedness test for the communication buffers in UML RT models. UML RT is a variant of the UML modeling language, tailored to describin...
206
click to vote
CONCUR
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. Modelling is becoming a necessity in studying biological signalling pathways, because the combinatorial complexity of such systems rapidly overwhelms intuitive and qualit...
179
click to vote
ICLP
2005
Springer
16 years 1 days ago
2005
Springer
We present a methodology for the modeling of complex program behavior in CLP. In the first part we present an informal description about how to represent a system in CLP. At its ...
186
click to vote
SAC
2003
ACM
15 years 11 months ago
2003
ACM
Networked embedded systems such as wireless sensor networks are usually designed to be event-driven so that they are reactive and power efficient. Programming embedded systems wit...