103 search results - page 18 / 21 » Algebraic Methods for Interactive Proof Systems |
TEC
2002
13 years 7 months ago
2002
Abstract--The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Even though t...
BIRTHDAY
2004
Springer
14 years 29 days ago
2004
Springer
Abstract. A long-running transaction is an interactive component of a distributed system which must be executed as if it were a single atomic action. In principle, it should not be...
FUIN
2000
13 years 7 months ago
2000
We study the notion of class refinement in a concurrent object-oriented setting. Our model is based on a combination of action systems and classes. An action system describes the b...
ENTCS
2007
13 years 7 months ago
2007
We present a powerful and flexible method for automatically checking the secrecy of values inside components. In our framework an attacker may monitor the external communication ...
CCECE
2006
IEEE
14 years 1 months ago
2006
IEEE
To help programmers of high-performance computing (HPC) systems avoid communication-related errors, we employ a formal process algebra, Communicating Sequential Processes (CSP), w...