Sciweavers

122 search results - page 2 / 25
» Using Disjoint Reachability for Parallelization
Sort
View
FOSSACS
2006
Springer
13 years 11 months ago
A Logic of Reachable Patterns in Linked Data-Structures
We define a new decidable logic for expressing and checking invariants of programs that manipulate dynamically-allocated objects via pointers and destructive pointer updates. The ...
Greta Yorsh, Alexander Moshe Rabinovich, Mooly Sag...
TABLEAUX
1997
Springer
13 years 11 months ago
Tableau Methods for PA-Processes
Abstract. PA (Process algebra) is the name that has become common use to denote the algebra with a sequential and parallel operator (without communication), plus recursion. PA-proc...
Richard Mayr
COREGRID
2007
Springer
14 years 1 months ago
Synthetic Coordinates for Disjoint Multipath Routing
We address the problem of routing packets on multiple, router-disjoint, paths in the Internet using large-scale overlay networks. Multipath routing can improve Internet QoS, by rou...
Andrei Agapi, Thilo Kielmann, Henri E. Bal
MICRO
1995
IEEE
125views Hardware» more  MICRO 1995»
13 years 11 months ago
Disjoint eager execution: an optimal form of speculative execution
Instruction Level Parallelism (ILP) speedups of an order-of-magnitude or greater may be possible using the techniques described herein. Traditional speculative code execution is t...
Augustus K. Uht, Vijay Sindagi, Kelley Hall
FSTTCS
2003
Springer
14 years 18 days ago
Reachability Analysis of Process Rewrite Systems
We define a new model called O-PRS that extends the Process Rewrite Systems formalism with a new associative operator, “ ”, that allows to model parallel composition while ke...
Ahmed Bouajjani, Tayssir Touili