Sciweavers

198 search results - page 12 / 40
» Modal Proofs as Distributed Programs (Extended Abstract)
Sort
View
WDAG
1993
Springer
98views Algorithms» more  WDAG 1993»
14 years 19 days ago
Fairness of N-party Synchronization and Its Implementation in a Distributed Environment
Fairness is an important concept in design and implementation of distributed systems. At the specification level, fairness usually serves as an assumption for proving liveness. At ...
Cheng Wu, Gregor von Bochmann, Ming Yu Yao
VL
2008
IEEE
14 years 3 months ago
End-user programming to support classroom activities on small devices
We believe it is unreasonable to assume that all students will own a laptop. One potential solution is to depend on the students to bring whatever computing devices (cell phones, ...
Craig Prince
DRM
2007
Springer
14 years 2 months ago
Slicing obfuscations: design, correctness, and evaluation
The goal of obfuscation is to transform a program, without affecting its functionality, such that some secret information within the program can be hidden for as long as possible...
Anirban Majumdar, Stephen Drape, Clark D. Thombors...
AC
2000
Springer
14 years 28 days ago
The Join Calculus: A Language for Distributed Mobile Programming
In these notes, we give an overview of the join calculus, its semantics, and its equational theory. The join calculus is a language that models distributed and mobile programming. ...
Cédric Fournet, Georges Gonthier
IPPS
2006
IEEE
14 years 2 months ago
Fault injection in distributed Java applications
In a network consisting of several thousands computers, the occurrence of faults is unavoidable. Being able to test the behaviour of a distributed program in an environment where ...
William Hoarau, Sébastien Tixeuil, Fabien V...