Now showing items 1-5 of 5
N-Version programming for the detection of zero-day exploits
Using N-Version programming techniques to increase software reliability is a well-explored field. In this paper, we extend the concept to the detection of new security vulnerabilities. Using our own N-Version arbiter, ...
Culprit detection on incremental tractable qualitative temporal reasoning problems
This thesis is a confluence of three problems in constraint reasoning: qualitative temporal reasoning (QTR), incremental reasoning, and explanation generation. We first address a set of algorithms to solve the QTR for point ...
Machine learning for computer security
The prevalent use of computers and internet has enhanced the quality of life for many people, but it has also attracted undesired attempts to undermine these systems. This special topic contains several research studies ...
Dynamic branch & bound, an optimization counterpart for dynamic backtracking
Here we show how the idea of dynamic backtracking can be applied to branch and bound optimization. This is done by exploiting the concept of valued nogood. However, simple replacement of nogoods with valued nogoods does ...
Correlogram method for comparing bio-sequences
Sequence comparison is one of the most primitive operations used in bio-informatics. It is used as a basis for many other complex manipulations in the field of Computational Molecular Biology. Many methods and algorithms ...