Sciweavers

3394 search results - page 268 / 679
» A Modal Model of Memory
Sort
View
CORR
2010
Springer
120views Education» more  CORR 2010»
15 years 6 months ago
Modeling of 2D and 3D Assemblies Taking Into Account Form Errors of Plane Surfaces
The tolerancing process links the virtual and the real worlds. From the former, tolerances define a variational geometrical language (geometric parameters). From the latter, there...
Serge Samper, Pierre-Antoine Adragna, Hugues Favre...
LICS
2006
IEEE
16 years 21 days ago
On Model-Checking Trees Generated by Higher-Order Recursion Schemes
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...
C.-H. Luke Ong
178
Voted
IPPS
2009
IEEE
16 years 1 months ago
Scalable RDMA performance in PGAS languages
Partitioned Global Address Space (PGAS) languages provide a unique programming model that can span shared-memory multiprocessor (SMP) architectures, distributed memory machines, o...
Montse Farreras, George Almási, Calin Casca...
ICPP
2008
IEEE
16 years 1 months ago
Scalable Dynamic Load Balancing Using UPC
An asynchronous work-stealing implementation of dynamic load balance is implemented using Unified Parallel C (UPC) and evaluated using the Unbalanced Tree Search (UTS) benchmark ...
Stephen Olivier, Jan Prins
ICALP
2007
Springer
16 years 25 days ago
Checking and Spot-Checking the Correctness of Priority Queues
We revisit the problem of memory checking considered by Blum et al. [3]. In this model, a checker monitors the behavior of a data structure residing in unreliable memory given an a...
Matthew Chu, Sampath Kannan, Andrew McGregor