Sciweavers

2372 search results - page 200 / 475
» is 2012
Sort
View
POPL
2012
ACM
13 years 8 months ago
A type theory for probability density functions
There has been great interest in creating probabilistic programming languages to simplify the coding of statistical tasks; however, there still does not exist a formal language th...
Sooraj Bhat, Ashish Agarwal, Richard W. Vuduc, Ale...
131
Voted
POPL
2012
ACM
13 years 8 months ago
Deciding choreography realizability
Since software systems are becoming increasingly more concurrent and distributed, modeling and analysis of interactions among their components is a crucial problem. In several app...
Samik Basu, Tevfik Bultan, Meriem Ouederni
129
Voted
POPL
2012
ACM
13 years 8 months ago
Higher-order functional reactive programming in bounded space
Functional reactive programming (FRP) is an elegant and successful approach to programming reactive systems declaratively. The high levels of abstraction and expressivity that mak...
Neelakantan R. Krishnaswami, Nick Benton, Jan Hoff...
123
Voted
PPOPP
2012
ACM
13 years 8 months ago
Massively parallel breadth first search using a tree-structured memory model
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
Tom St. John, Jack B. Dennis, Guang R. Gao
PPOPP
2012
ACM
13 years 8 months ago
A methodology for creating fast wait-free data structures
Lock-freedom is a progress guarantee that ensures overall program progress. Wait-freedom is a stronger progress guarantee that ensures the progress of each thread in the program. ...
Alex Kogan, Erez Petrank