Achieving peak performance in important numerical kernels such as dense matrix multiply or sparse-matrix vector multiplication usually requires extensive, machine-dependent tuning ...
We modify the reflection method to enable it to deal with partial functions like division. The idea behind reflection is to program a tactic for a theorem prover not in the impleme...
Abstract. This paper presents a framework of specification and verification for distributed real-time object-oriented systems. An earlier paper [17] introduced a process calculus...
Computer science students need mathematical proof skills. At our University, these skills are being taught as part of various mathematics and computer science courses. To test the ...
An infinite binary sequence x is defined to be (i) strongly useful if there is a computable time bound within which every decidable sequence is Turing reducible to x; and (ii) w...