Sciweavers

4536 search results - page 552 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
TACAS
2010
Springer
225views Algorithms» more  TACAS 2010»
16 years 1 months ago
Automated Termination Analysis for Programs with Second-Order Recursion
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...
Markus Aderhold
VR
2007
IEEE
184views Virtual Reality» more  VR 2007»
16 years 1 months ago
Balanced Hierarchies for Collision Detection between Fracturing Objects
The simulation of fracture leads to collision-intensive situations that call for efficient collision detection algorithms and data structures. Bounding volume hierarchies (BVHs) ...
Miguel A. Otaduy, Olivier Chassot, Denis Steineman...
SAS
2007
Springer
103views Formal Methods» more  SAS 2007»
16 years 27 days ago
Footprint Analysis: A Shape Analysis That Discovers Preconditions
Existing shape analysis algorithms infer descriptions of data structures at program points, starting from a given precondition. We describe an analysis that does not require any pr...
Cristiano Calcagno, Dino Distefano, Peter W. O'Hea...
ICCSA
2005
Springer
16 years 9 days ago
Mesh Generation for Symmetrical Geometries
Symmetries are not only fascinating, but they can also be exploited when designing numerical algorithms and data structures for scientific engineering problems in symmetrical doma...
Krister Åhlander
APN
2004
Springer
16 years 5 days ago
Reachability Set Generation for Petri Nets: Can Brute Force Be Smart?
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...
Gianfranco Ciardo