4850 search results - page 612 / 970 » Proof and Computation in Geometry |
167
click to vote
MFCS
2005
Springer
16 years 11 days ago
2005
Springer
Systems of language equations of the form {ϕ(X1, . . . , Xn) = ∅, ψ(X1, . . . , Xn) = ∅} are studied, where ϕ, ψ may contain set-theoretic operations and concatenation; the...
185
Voted
PKC
2005
Springer
16 years 10 days ago
2005
Springer
We develop a method for generating shared, secret, safe primes applicable to use in threshold RSA signature schemes such as the one developed by Shoup. We would like a scheme usabl...
174
click to vote
CONCUR
2004
Springer
16 years 8 days ago
2004
Springer
Existing spatial logics for concurrency are intensional, in the sense that they induce an equivalence that coincides with structural congruence. In this work, we study a contextual...
174
click to vote
FOSSACS
2004
Springer
16 years 7 days ago
2004
Springer
Abstract. Motivated by recent work on the derivation of labelled transitions and bisimulation congruences from unlabelled reaction rules, we show how to solve this problem in the D...
223
Voted
FOSSACS
2004
Springer
16 years 7 days ago
2004
Springer
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...