Sciweavers

81 search results - page 9 / 17
» Closure of Language Classes Under Bounded Duplication
Sort
View
AGTIVE
2003
Springer
14 years 22 days ago
Specifying Pointer Structures by Graph Reduction
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
Adam Bakewell, Detlef Plump, Colin Runciman
LICS
2006
IEEE
14 years 1 months ago
On Tractability and Congruence Distributivity
Constraint languages that arise from finite algebras have recently been the object of study, especially in connection with the Dichotomy Conjecture of Feder and Vardi. An importa...
Emil W. Kiss, Matthew Valeriote
SPAA
2009
ACM
14 years 8 months ago
Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futures
Work stealing is a popular method of scheduling fine-grained parallel tasks. The performance of work stealing has been extensively studied, both theoretically and empirically, but...
Daniel Spoonhower, Guy E. Blelloch, Phillip B. Gib...
DLT
2007
13 years 9 months ago
2-Visibly Pushdown Automata
Visibly Pushdown Automata (VPA) are a special case of pushdown machines where the stack operations are driven by the input. In this paper, we consider VPA with two stacks, namely 2...
Dario Carotenuto, Aniello Murano, Adriano Peron
WWW
2003
ACM
14 years 8 months ago
Conversation specification: a new approach to design and analysis of e-service composition
This paper introduces a framework for modeling and specifying the global behavior of e-service compositions. Under this framework, peers (individual e-services) communicate throug...
Tevfik Bultan, Xiang Fu, Richard Hull, Jianwen Su