Sciweavers

1491 search results - page 239 / 299
» Resource-Passing Concurrent Programming
Sort
View
ICALP
2010
Springer
15 years 2 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
IFIP
2009
Springer
15 years 2 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 2 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
ICALP
1998
Springer
15 years 2 months ago
Deciding Bisimulation-Like Equivalences with Finite-State Processes
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
Petr Jancar, Antonín Kucera, Richard Mayr
EURODAC
1994
IEEE
209views VHDL» more  EURODAC 1994»
15 years 1 months ago
MOS VLSI circuit simulation by hardware accelerator using semi-natural models
- The accelerator is destined to circuit-level simulation of digital and analog/digital MOS VLSI'c containing of up to 100 thousand transistors (with 16 Mb RAM host-machine). ...
Victor V. Denisenko