1724 search results - page 151 / 345 » Models for Concurrency |
105
Voted
DSL
1997
15 years 4 months ago
1997
The World-Wide Web is rich in content and services, but access to these resources must be obtained mostly through manual browsers. We would like to be able to write programs that ...
139
click to vote
SAC
2003
ACM
15 years 8 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...
156
Voted
CONCUR
2007
Springer
15 years 9 months 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...
129
Voted
POPL
2010
ACM
16 years 24 days 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...
139
Voted
SIGSOFT
2008
ACM
16 years 4 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...