To manage the massive growth of sport videos, we need to summarize the contents into a more compact and interesting representation. Unlike previous work which summarized either hi...
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
Abstract. Solvers for satisfiability modulo theories (SMT) check the satisfiability of first-order formulas containing operations from various theories such as the Booleans, bit-ve...
Abstract. This paper surveys the state-of-the-art in developing multi-agent systems, and sets out to answer the questions: "what are the key current issues in developing multi...
Rafael H. Bordini, Mehdi Dastani, Michael Winikoff
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...