Abstract. Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. The generalizat...
Albert Atserias, Phokion G. Kolaitis, Moshe Y. Var...
The paper considers the problem of checking abstraction between two finite-state fair discrete systems (FDS). In automata-theoretic terms this is trace inclusion between two nond...
Abstract The ntcc process calculus is a timed concurrent constraint programming (ccp) model equipped with a first-order linear-temporal logic (LTL) for expressing process specifi...
The current state of the art in visualization research places a strong emphasis on different techniques to derive insight from disparate types of data. However, little work has in...
Mobile environments are highly dynamic, characterised by frequent and sudden changes in resource availability. As a consequence, adaptive mobile applications need to be capable of...
Christos Efstratiou, Adrian Friday, Nigel Davies, ...