7109 search results - page 108 / 1422 » Process Algebra with Combinators |
116
Voted
CSL
2008
Springer
15 years 5 months ago
2008
Springer
We study the expressive power of the logics EF + F-1 , 2 and boolean combinations of 1 over ranked trees. In particular, we provide effective characterizations of those three logic...
124
click to vote
IPL
2006
15 years 3 months ago
2006
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
149
Voted
IPPS
1997
IEEE
15 years 7 months ago
1997
IEEE
Algebraic factorization is an extremely important part of any logic synthesis system but is computationally expensive. Hence it is important to look at parallel processing to spee...
108
click to vote
SIAMSC
2008
15 years 3 months ago
2008
With the rise in popularity of compatible finite element, finite difference and finite volume discretizations for the time domain eddy current equations, there has been a correspon...
162
click to vote
WER
2010
Springer
15 years 1 months ago
2010
Springer
Feature models are commonly used to capture the commonality and the variability of product families. There are several feature model notations that correspondingly depict the conce...