Sciweavers

148 search results - page 6 / 30
» Programming with angelic nondeterminism
Sort
View
LPAR
1992
Springer
15 years 8 months ago
From the Past to the Future: Executing Temporal Logic Programs
We describe some of the techniques which have been used to implement METATEM, a programming language based on temporal logic, and address problems such as non-determinism and loopi...
Michael Fisher, Richard Owens
PLDI
2012
ACM
13 years 6 months ago
Proving acceptability properties of relaxed nondeterministic approximate programs
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
Michael Carbin, Deokhwan Kim, Sasa Misailovic, Mar...
149
Voted
SAS
2012
Springer
208views Formal Methods» more  SAS 2012»
13 years 6 months ago
Finding Non-terminating Executions in Distributed Asynchronous Programs
Programming distributed and reactive asynchronous systems is complex due to the lack of synchronization between concurrently executing tasks, and arbitrary delay of message-based c...
Michael Emmi, Akash Lal
141
Voted
RV
2010
Springer
152views Hardware» more  RV 2010»
15 years 1 months ago
Efficient Data Race Detection for Async-Finish Parallelism
One of the major productivity hurdles for parallel programming is non-determinism -- a parallel program may yield different results on different executions with the same input, dep...
Raghavan Raman, Jisheng Zhao, Vivek Sarkar, Martin...
PPDP
2009
Springer
15 years 10 months ago
Set functions for functional logic programming
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
Sergio Antoy, Michael Hanus