159 search results - page 30 / 32 » Semantics of Termination |
153
click to vote
HASKELL
2009
ACM
15 years 8 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
141
click to vote
CONCUR
2005
Springer
15 years 7 months ago
2005
Springer
d Abstract) Vijay Saraswat1 and Radha Jagadeesan2 1 IBM T.J. Watson Research Lab 2 School of CTI, DePaul University Abstract. We present the concurrency and distribution primitives...
151
click to vote
POPL
2011
ACM
14 years 4 months 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...
177
click to vote
SIGMOD
2007
ACM
16 years 1 months ago
2007
ACM
Suppose a long-running analytical query is executing on a database server and has been allocated a large amount of physical memory. A high-priority task comes in and we need to ru...
117
click to vote
CMSB
2007
Springer
15 years 8 months ago
2007
Springer
We explore some presynaptic mechanisms of the calyx of Held synapse through a stochastic model. The model, drawn from a kinetic approach developed in literature, exploits process c...