4353 search results - page 101 / 871 » Expressiveness of Process Algebras |
140
click to vote
DBPL
1991
Springer
15 years 7 months ago
1991
Springer
We propose a programming paradigm that tries to get close to both the semantic simplicity of relational algebra, and the expressive power of unrestricted programming languages. It...
132
click to vote
FCT
2009
Springer
15 years 10 months ago
2009
Springer
In the uniform circuit model of computation, the width of a boolean circuit exactly characterises the “space” complexity of the computed function. Looking for a similar relatio...
150
click to vote
BIRTHDAY
2008
Springer
15 years 6 months ago
2008
Springer
Event-pattern reactive programs are small programs that process an input stream of events to detect and act upon given temporal patterns. These programs are used in distributed sys...
114
click to vote
DLOG
2010
15 years 2 months ago
2010
We develop a query algebra that supports efficient assertion retrieval--a natural extension of instance retrieval. The algebra is based on previously developed techniques for index...
122
click to vote
CISC
2009
Springer
15 years 1 months ago
2009
Springer
In [10], Buchmann, Pyshkin and Weinmann have described two families of Feistel and SPN block ciphers called Flurry and Curry respectively. These two families of ciphers are fully p...