Sciweavers

826 search results - page 15 / 166
» Resolving Concurrent Interactions
Sort
View
FOCS
2002
IEEE
15 years 6 months ago
Concurrent Zero Knowledge with Logarithmic Round-Complexity
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...
Manoj Prabhakaran, Alon Rosen, Amit Sahai
CERA
2006
36views more  CERA 2006»
15 years 1 months ago
Federated Grid Computing with Interactive Service-oriented Programing
er.sagepub.com/cgi/content/abstract/14/1/55 The online version of this article can be found at: Published by: http://www.sagepublications.com can be found at:Concurrent Engineering...
Michael W. Sobolewski, Raymond M. Kolonay
IFIPTCS
2010
14 years 11 months ago
Concurrent Pattern Calculus
Abstract. Concurrent pattern calculus drives interaction between processes by comparing data structures, just as sequential pattern calculus drives computation. By generalising fro...
Thomas Given-Wilson, Daniele Gorla, Barry Jay
ICSE
2007
IEEE-ACM
16 years 1 months ago
Identifying Feature Interactions in Multi-Language Aspect-Oriented Frameworks
The simultaneous use of multiple aspect languages has the potential of becoming a significant one, as new aspectoriented frameworks are developed and existing ones expand to incor...
Sergei Kojarski, David H. Lorenz
ICCL
1994
IEEE
15 years 5 months ago
A Compositional Approach to Concurrent Object-Oriented Programming
This paper presents a model of concurrent objectoriented programming in which specification of computational behavior is separated from specification of interaction behavior of me...
Raju Pandey, James C. Browne