Sciweavers

2478 search results - page 84 / 496
» Quadtrees as an Abstract Domain
Sort
View
POPL
2008
ACM
14 years 8 months ago
Relational inductive shape analysis
alyses are concerned with precise abstractions of the heap to capture detailed structural properties. To do so, they need to build and decompose summaries of disjoint memory regio...
Bor-Yuh Evan Chang, Xavier Rival
CAV
2008
Springer
122views Hardware» more  CAV 2008»
13 years 10 months ago
Thread Quantification for Concurrent Shape Analysis
In this paper we address the problem of shape analysis for concurrent programs. We present new algorithms, based on abstract interpretation, for automatically verifying properties ...
Josh Berdine, Tal Lev-Ami, Roman Manevich, G. Rama...
SAC
2009
ACM
14 years 2 months ago
Origami fold as algebraic graph rewriting
We formalize paper fold (origami) by graph rewriting. Origami construction is abstractly described by a rewriting sys), where O is the set of abstract origami’s and ary relation...
Tetsuo Ida, Hidekazu Takahashi
ATAL
2006
Springer
13 years 11 months ago
Comparing market and token-based coordination
Many coordination algorithms claim to be general, implying that they can be used to coordinate agents in a variety of domains. However, little work has been done to quantitatively...
Yang Xu, Paul Scerri, Katia P. Sycara, Michael Lew...
ACSW
2007
13 years 9 months ago
DGRID: A DHT-Based Resource Indexing and Discovery Scheme for Computational Grids
Traditional DHT (Distributed Hash Tables) abstraction distributes data items among peer nodes on a structured overlay network. This introduces a number of issues when nodes are un...
Verdi March, Yong Meng Teo, Xianbing Wang