The traditional use of formal methods has been for the veri cation of algorithms or protocols. Given the high cost and limitations in state space coverage provided by conventional...
In this paper we develop a framework, based on strand spaces, for reasoning about cryptographic protocols and characterizing their executions. We define skeletons, homomorphisms,...
Shaddin F. Doghmi, Joshua D. Guttman, F. Javier Th...
This paper presents an approach for interaction design based on the specificity of the information involved in the interaction. The contribution is intended for application design...
This demonstration program presents the V*-kNN algorithm, an efficient algorithm to process moving k nearest neighbor queries (MkNN). The V*-kNN algorithm is based on a safe-region...
Sarana Nutanong, Rui Zhang, Egemen Tanin, Lars Kul...
When a Constraint Satisfaction Problem (CSP) admits no solution, most current solvers express that the whole search space has been explored unsuccessfully but do not exhibit which...