Sciweavers

138 search results - page 22 / 28
» Model Checking Round-Based Distributed Algorithms
Sort
View
JSSPP
2005
Springer
15 years 2 months ago
Enhancing Security of Real-Time Applications on Grids Through Dynamic Scheduling
Real-time applications with security requirements are emerging in various areas including government, education, and business. The security sensitive real-time applications can ta...
Tao Xie 0004, Xiao Qin
FMICS
2007
Springer
15 years 3 months ago
An Approach to Formalization and Analysis of Message Passing Libraries
Message passing using libraries implementing the Message Passing Interface (MPI) standard is the dominant communication mechanism in high performance computing (HPC) applications. ...
Robert Palmer, Michael Delisi, Ganesh Gopalakrishn...
PPDP
2001
Springer
15 years 1 months ago
Trust in the Pi-Calculus
We introduce a new system of trust analysis for concurrent and distributed systems using the π-calculus[13, 14, 15] as a modelling tool. A Type system using boolean annotations g...
Mark Hepburn, David Wright
3DIM
2007
IEEE
15 years 3 months ago
Generalized MPU Implicits Using Belief Propagation
In this paper, we present a new algorithm to reconstruct 3D surfaces from an unorganized point cloud based on generalizing the MPU implicit algorithm through introducing a powerfu...
Yi-Ling Chen, Shang-Hong Lai, Tung-Ying Lee
PLDI
2012
ACM
12 years 12 months ago
Speculative linearizability
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
Rachid Guerraoui, Viktor Kuncak, Giuliano Losa