2227 search results - page 216 / 446 » Reversibility and Models for Concurrency |
191
click to vote
SOFSEM
2007
Springer
16 years 22 days ago
2007
Springer
Digital technology is increasingly deployed in safety-critical situations. This calls for systematic design and verification methodologies that can cope with three major sources o...
169
click to vote
POPL
2010
ACM
16 years 4 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...
171
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...
213
click to vote
CONCUR
2007
Springer
16 years 24 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...
180
Voted
ICLP
2005
Springer
16 years 4 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 ...