Sciweavers

13 search results - page 3 / 3
» Proving Liveness with Fairness Using Rewriting
Sort
View
KBSE
2005
IEEE
13 years 11 months ago
Learning to verify branching time properties
We present a new model checking algorithm for verifying computation tree logic (CTL) properties. Our technique is based on using language inference to learn the fixpoints necessar...
Abhay Vardhan, Mahesh Viswanathan
HASKELL
2009
ACM
13 years 11 months ago
A compositional theory for STM Haskell
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...
Johannes Borgström, Karthikeyan Bhargavan, An...
SIGMETRICS
2010
ACM
233views Hardware» more  SIGMETRICS 2010»
13 years 10 months ago
Incentivizing peer-assisted services: a fluid shapley value approach
A new generation of content delivery networks for live streaming, video on demand, and software updates takes advantage of a peer-to-peer architecture to reduce their operating co...
Vishal Misra, Stratis Ioannidis, Augustin Chaintre...