7 search results - page 1 / 2 » Alternating states for dual nondeterminism in imperative pro... |
TCS
2010
13 years 3 months ago
2010
The refinement calculus of Back, Morgan, Morris, and others is based on monotone predicate transformers (weakest preconditions) where conjunctions stand for demonic choices betwee...
COORDINATION
2007
Springer
13 years 11 months ago
2007
Springer
We present a generalized committed choice construct for concurrent programs that interact with a shared store. The generalized committed choice (GCC) allows multiple computations ...
OOPSLA
2009
Springer
13 years 11 months ago
2009
Springer
Side effects are both the essence and bane of imperative programming. The programmer must carefully coordinate actions to manage their side effects upon each other. Such coordinat...
AMAST
1991
Springer
13 years 8 months ago
1991
Springer
Boolean logic treats disjunction and conjunction symmetrically and algebraically. The corresponding operations for computation are respectively nondeterminism (choice) and concurr...
SDM
2011
SIAM
12 years 7 months ago
2011
SIAM
In many real world prediction problems the output is a structured object like a sequence or a tree or a graph. Such problems range from natural language processing to computationa...