Skip to main content

Research Repository

Advanced Search

Outputs (3130)

The natural work-stealing algorithm is stable (2001)
Presentation / Conference Contribution
Berenbrink, P., Friedetzky, T., & Goldberg, L. (2001, December). The natural work-stealing algorithm is stable. Presented at Proceedings 2001 IEEE International Conference on Foundations of Computer Science

Using Model Checking for Pre-Planning Analysis (2001)
Presentation / Conference Contribution
Fox, M., Long, D., Bradley, S., & McKinna, J. (2001, December). Using Model Checking for Pre-Planning Analysis. Presented at AAAI Symposium on Model-based Validation of Intelligence

On the structure of clone lattices, II (2001)
Presentation / Conference Contribution
Bulatov, A., Krokhin, A., Safin, K., Semigrodskikh, A., & Sukhanov, E. (2001, December). On the structure of clone lattices, II

Object languages in a type-theoretic meta-framework (2001)
Presentation / Conference Contribution
Callaghan, P., Luo, Z., & Pang, J. (2001, June). Object languages in a type-theoretic meta-framework. Presented at Proof Transformation and Presentation and Proof Complexities Workshop : PTP'01., Siena, Italy

This paper concerns techniques for providing a convenient syntax for object languages implemented via a type-theoretic Logical Framework, and reports on work in progress. We first motivate the need for a type-theoretic logical framework. Firstly, we... Read More about Object languages in a type-theoretic meta-framework.

Generalized partition testing via Bayes linear methods (2001)
Journal Article
Coolen, F., Goldstein, M., & Munro, M. (2001). Generalized partition testing via Bayes linear methods. Information and Software Technology, 43(13), 783-793. https://doi.org/10.1016/s0950-5849%2801%2900185-9

This paper explores the use of Bayes linear methods related to partition testing for software. If a partition of the input domain has been defined, the method works without the assumption of homogeneous (revealing) subdomains, and also includes the p... Read More about Generalized partition testing via Bayes linear methods.

Planar tautologies hard for resolution (2001)
Presentation / Conference Contribution
Dantchev, S., & Riis, S. (2001, October). Planar tautologies hard for resolution. Presented at 42nd IEEE Symposium of Foundations of Computer Science, Las Vegas, Nev

We prove exponential lower bounds on the resolution proofs of some tautologies, based on rectangular grid graphs. More specifically, we show a 2/sup /spl Omega/(n)/ lower bound for any resolution proof of the mutilated chessboard problem on a 2n/spl... Read More about Planar tautologies hard for resolution.

Reuse strategies in software development: An empirical study (2001)
Journal Article
Pohthong, A., & Budgen, D. (2001). Reuse strategies in software development: An empirical study. Information and Software Technology, 43(9), 561-575. https://doi.org/10.1016/S0950-5849%2801%2900166-5

We report on a study of reuse strategies, as employed in performing component-based software design, that we have conducted using the Unix environment. A number of subjects were asked to develop shell scripts that would perform a set of tasks, using... Read More about Reuse strategies in software development: An empirical study.