Sciweavers

1492 search results - page 216 / 299
» Concurrent programming in VISO
Sort
View
ICALP
2010
Springer
15 years 5 months ago
Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems
Assuming the Unique Games Conjecture (UGC), we show optimal inapproximability results for two classic scheduling problems. We obtain a hardness of 2 − ε for the problem of mini...
Nikhil Bansal, Subhash Khot
102
Voted
IFIP
2009
Springer
15 years 5 months ago
Secure Information Flow for Distributed Systems
We present an abstract language for distributed systems of processes with local memory and private communication channels. Communication between processes is done via messaging. Th...
Rafael Alpízar, Geoffrey Smith
PPDP
2001
Springer
15 years 5 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
85
Voted
OOPSLA
1999
Springer
15 years 5 months ago
Removing Unnecessary Synchronization in Java
Java programs perform many synchronization operations on data structures. Some of these synchronizations are unnecessary; in particular, if an object is reachable only by a single ...
Jeff Bogda, Urs Hölzle
117
Voted
POS
1998
Springer
15 years 5 months ago
Java Finalize Method, Orthogonal Persistence and Transactions
Java is a popular, object oriented language that is runtime type safe. As such, it has been seen as an attractive basis for the implementation of orthogonally persistent systems b...
John N. Zigman, Stephen Blackburn