Sciweavers

5964 search results - page 403 / 1193
» A theory of speculative computation
Sort
View
TCS
2010
15 years 6 months ago
Alternating states for dual nondeterminism in imperative programming
The refinement calculus of Back, Morgan, Morris, and others is based on monotone predicate transformers (weakest preconditions) where conjunctions stand for demonic choices betwee...
Wim H. Hesselink
DALT
2010
Springer
15 years 2 months ago
Executing Specifications of Social Reasoning Agents
Social reasoning theories, whilst studied extensively in the area of multiagent systems, are hard to implement directly in agents. They often specify properties of beliefs or behav...
Iain Wallace, Michael Rovatsos
SIAMNUM
2010
123views more  SIAMNUM 2010»
15 years 2 months ago
Critical Analysis of the Spanning Tree Techniques
Two algorithms based upon a tree-cotree decomposition, called in this paper spanning tree technique (STT) and generalized spanning tree technique (GSTT), have been shown to be usef...
Pawel Dlotko, Ruben Specogna
DCG
2011
14 years 11 months ago
A Celtic Framework for Knots and Links
We describe a variant of a method used by modern graphic artists to design what are traditionally called Celtic knots, which are part of a larger family of designs called “mirro...
Jonathan L. Gross, Thomas W. Tucker
POPL
2012
ACM
14 years 3 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...