Abstract. The decision problem for positively quantified formulae in the theory of linearly ordered Heyting algebras is known, as a special case of work of Kreisel, to be solvable;...
In this article, we study the quantified constraint satisfaction problem (QCSP) over infinite domains. We develop a technique called collapsibility that allows one to give strong c...
The CGiS programming language is designed to open up the parallel performance possibilities of graphics processing units (GPUs) to general purpose programmers. This tool demonstrat...
: DYNAMO (Dynamic Architectural Memory Online) is an interactive platform to share ideas, knowledge and insights in the form of concrete building projects among designers in differ...
Random testing is not only a useful testing technique in itself, but also plays a core role in many other testing methods. Hence, any significant improvement to random testing ha...
Tsong Yueh Chen, Fei-Ching Kuo, Robert G. Merkel, ...