Sciweavers

148 search results - page 5 / 30
» Programming with angelic nondeterminism
Sort
View
ICFP
2009
ACM
14 years 10 months ago
Purely functional lazy non-deterministic programming
Functional logic programming and probabilistic programming have demonstrated the broad benefits of combining laziness (non-strict evaluation with sharing of the results) with non-...
Sebastian Fischer, Oleg Kiselyov, Chung-chieh Shan
APAL
2008
104views more  APAL 2008»
13 years 10 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy
SPAA
1997
ACM
14 years 1 months ago
Efficient Detection of Determinacy Races in Cilk Programs
A parallel multithreaded program that is ostensibly deterministic may nevertheless behave nondeterministically due to bugs in the code. These bugs are called determinacy races, an...
Mingdong Feng, Charles E. Leiserson
HOTOS
2007
IEEE
14 years 1 months ago
Relaxed Determinism: Making Redundant Execution on Multiprocessors Practical
Given that the majority of future processors will contain an abundance of execution cores, redundant execution can offer a promising method for increasing the availability and res...
Jesse Pool, Ian Sin Kwok Wong, David Lie
IEEEPACT
2003
IEEE
14 years 3 months ago
Redeeming IPC as a Performance Metric for Multithreaded Programs
Recent work has shown that multithreaded workloads running in execution-driven, full-system simulation environments cannot use instructions per cycle (IPC) as a valid performance ...
Kevin M. Lepak, Harold W. Cain, Mikko H. Lipasti