Sciweavers

1206 search results - page 34 / 242
» Concurrent Abstract Predicates
Sort
View
95
Voted
ISCA
1999
IEEE
105views Hardware» more  ISCA 1999»
15 years 4 months ago
The Program Decision Logic Approach to Predicated Execution
Modern compilers must expose sufficient amounts of Instruction-Level Parallelism (ILP) to achieve the promised performance increases of superscalar and VLIW processors. One of the...
David I. August, John W. Sias, Jean-Michel Puiatti...
ECOOPW
1994
Springer
15 years 4 months ago
Abstracting Interactions Based on Message Sets
ing Interactions Based on Message Sets Svend Frr 1 and Gul Agha2. 1 Hewlett-Packard Laboratories, 1501 Page Mill Road, Palo Alto, CA 94303 2 University of Illinois, 1304 W. Springf...
Svend Frølund, Gul Agha
ICDE
1999
IEEE
94views Database» more  ICDE 1999»
16 years 1 months ago
Scalable Trigger Processing
Current database trigger systems have extremely limited scalability. This paper proposes a way to develop a truly scalable trigger system. Scalability to large numbers of trigger...
Eric N. Hanson, Chris Carnes, Lan Huang, Mohan Kon...
ADAEUROPE
2007
Springer
15 years 6 months ago
Modelling Remote Concurrency with Ada
When developing concurrent software, a proper engineering practice is to choose a good level of abstraction for expressing concurrency control. Ideally, this level should provide p...
Claude Kaiser, Christophe Pajault, Jean-Fran&ccedi...
CRYPTO
2000
Springer
182views Cryptology» more  CRYPTO 2000»
15 years 4 months ago
A Note on the Round-Complexity of Concurrent Zero-Knowledge
Abstract. We present a lower bound on the number of rounds required by Concurrent Zero-Knowledge proofs for languages in NP. It is shown that in the context of Concurrent Zero-Know...
Alon Rosen