Skip to main content

Research Repository

Advanced Search

Outputs (35)

Simulating Errors in Web Services. (2004)
Journal Article
Looker, N., Munro, M., & Xu, J. (2004). Simulating Errors in Web Services. International journal of simulation: systems, science & technology, 5(5), 29-37

Understanding service-oriented software (2004)
Journal Article
Gold, N., Knight, C., Mohan, A., & Munro, M. (2004). Understanding service-oriented software. IEEE Software, 21(2), 71-77. https://doi.org/10.1109/ms.2004.1270766

Service-oriented software is being hailed as the next revolutionary approach to software development. Service orientation allows organizations to rapidly and dynamically form new software applications to meet changing business needs, thus alleviating... Read More about Understanding service-oriented software.

Moral dominance relations for program comprehension (2003)
Journal Article
Shaw, S., Goldstein, M., Munro, M., & Burd, E. (2003). Moral dominance relations for program comprehension. IEEE Transactions on Software Engineering, 29(9), 851-863. https://doi.org/10.1109/tse.2003.1232289

Dominance trees have been used as a means for reengineering legacy systems into potential reuse candidates. The dominance relation suggests the reuse candidates which are identified by strongly directly dominated subtrees. We review the approach and... Read More about Moral dominance relations for program comprehension.

Weakest precondition for general recursive programs formalized in coq (2002)
Presentation / Conference Contribution
Zhang, X., Munro, M., Harman, M., & Hu, L. (2002, January). Weakest precondition for general recursive programs formalized in coq. Presented at 15th International Conference on Theorem Proving in Higher Order Logics : TPHOLs., Hampton, VA

This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is a deep embedding using the computational power intrinsic to type theory. Since C... Read More about Weakest precondition for general recursive programs formalized in coq.

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.

Supporting program comprehension using dominance trees (2000)
Journal Article
Burd, E., & Munro, M. (2000). Supporting program comprehension using dominance trees. Annals of Software Engineering, 9(1-2), 193-213. https://doi.org/10.1023/a%3A1018928825530

This paper will address how program comprehension can be aided within software maintenance through the use of high level representations of code, specifically the use of dominance trees. The paper proposes that dominance trees should be used as a sta... Read More about Supporting program comprehension using dominance trees.