Abstract. We propose a new operational model for shared variable concurrency, in the context of a concurrent, higher-order imperative language `a la ML. In our model the scheduling...
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
In order to cope with the expected size of the Semantic Web (SW) in the coming years, we need to benchmark existing SW tools (e.g., query language interpreters) in a credible manne...
Yannis Theoharis, George Georgakopoulos, Vassilis ...
We develop a general method for proving properties of contract-signing protocols using a specialized protocol logic. The method is applied to the Asokan-ShoupWaidner and the Garay...
Michael Backes, Anupam Datta, Ante Derek, John C. ...
Traditional data mining applications consider the problem of mining a single relation between two attributes. For example, in a scientific bibliography database, authors are rela...
Foto N. Afrati, Gautam Das, Aristides Gionis, Heik...