238 search results - page 45 / 48 » Compositional Proof Methods for Concurrency: A Semantic Appr... |
FM
2006
Springer
15 years 1 months ago
2006
Springer
Formal modeling is a crucial first step in the analysis of safety critical communication protocols such as IP Telephony. These protocols are notoriously resistant to formal modelin...
104
click to vote
FMICS
2009
Springer
15 years 4 months ago
2009
Springer
on Abstraction: a Lightweight Approach to Modelling Concurrency. Javier de Dios and Ricardo Peña Certified Implementation on top of the Java Virtual Machine 19:00 Social dinner + ...
SIGLEX
1991
15 years 1 months ago
1991
Explaining how the meaning of words relate to the meaning of the utterance in which they are used is of utmost importance. The most common approaches view the meaning of an uttera...
112
click to vote
POPL
2011
ACM
14 years 13 days ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
107
click to vote
CAV
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Pseudo-code descriptions of STMs assume sequentially consistent program execution and atomicity of high-level STM operations like read, write, and commit. These assumptio...