31387 search results - page 6037 / 6278 » Abstracting abstract machines |
162
click to vote
CONCUR
2010
Springer
15 years 7 months ago
2010
Springer
Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by realvalued distance functions between systems, wher...
170
click to vote
CONCUR
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Graph games of infinite length provide a natural model for open reactive systems: one player (Eve) represents the controller and the other player (Adam) represents the en...
164
click to vote
CRYPTO
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Let pk = (N , e) be an RSA public key with corresponding secret key sk = (p, q, d, dp, dq , q-1 p ). Assume that we obtain partial error-free information of sk, e.g., ass...
227
click to vote
ECAI
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. One of the most frequently used inference services of description logic reasoners classifies all named classes of OWL ontologies into a subsumption hierarchy. Due to emer...
180
click to vote
ECAI
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. In this paper we introduce a new option pricing mechanism for reducing the exposure problem encountered by bidding agents with complementary valuations when participating...