We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...
Context-bounded analysis has been shown to be both efficient and effective at finding bugs in concurrent programs. According to its original definition, context-bounded analysis...
In recent years there has been growing interest in generating valid inequalities for mixedinteger programs using sets with 2 or more constraints. In particular, Andersen et al. (2...
We consider the problem of minimizing a polynomial on the hypercube [0, 1]n and derive new error bounds for the hierarchy of semidefinite programming approximations to this problem...
Parallel platforms are becoming ubiquitous with modern computing systems. Many parallel applications attempt to avoid locks in order to achieve high responsiveness, aid scalabilit...