http://espace.library.uq.edu.au/ The University of Queensland en Fez http://blogs.law.harvard.edu/tech/rss http://espace.library.uq.edu.au/view/UQ:255098 2011-10-12T11:04:00Z Ellis, Kathryn A. og Rowe, Christopher C. og Szoeke, Cassandra E. I. og Villemagne, Victor L. og Ames, David og Chetelat, Gael og Martins, Ralph N. og Masters, Colin L. og Fripp, Jurgen og Acosta, Oscar og Raniga, Parnesh og Bourgeat, Pierrick T. og Salvado, Olivier http://espace.library.uq.edu.au/view/UQ:234934 2011-03-11T11:58:55Z Lim, Einly og Cloherty, Shaun L. og Reizes, John A. og Mason, David G. og Salamonsen, Robert F. og Karantonis, Dean M. og Lovell, Nigel H. http://espace.library.uq.edu.au/view/UQ:139712 2008-06-10T00:00:00Z Robinson, A. W. og Bialkowski, M. E. og Song, H. J. http://espace.library.uq.edu.au/view/UQ:272233 In order to advance face recognition research, algorithm performance has to be measured and compared using a range of metrics and operating characteristics. While public challenges such as the NIST-sponsored FERET, FRVT, FRGC, and MBGC are helpful to gauge comparative performance and improvement for a particular scenario, they typically are not sufficient to fully characterise the strengths and weaknesses of the face recognition algorithm, thus researchers need to do additionally benchmarking independently. This paper provides: (1) a detailed review and categorisation of publicly available face biometrics benchmarks; (2) a discussion of metrics and performance factors to consider; (3) a proposal for a meta-face biometric benchmarking regime which suggests guidelines for benchmarking across multiple datasets to more fully characterise and quantify face recognition performance across various operating characteristics; and (4) a sample demonstration which compare the performance of a face recognition algorithm before and after inclusion of a face quality metric. 2012-04-04T00:00:00Z Mau, Sandra og Dadgostar, Farhad og Cullinan, Ian og Bigdeli, Abbas og Lovell, Brian C. http://espace.library.uq.edu.au/view/UQ:143770 Let Gamma be a simple graph and let G be a group of automorphisms of Gamma. The graph is (G, 2)-arc transitive if G is transitive on the set of the 2-arcs of Gamma. In this paper we construct a new family of (PSU(3, q(2)), 2)-arc transitive graphs r of valency 9 such that Aut Gamma = Z(3).G, for some almost simple group G with socle PSU(3, q(2)). This gives a new infinite family of non-quasiprimitive almost simple graphs. (C) 1999 Academic Press. 2008-06-10T00:00:00Z Fang, XG og Havas, G og Wang, J http://espace.library.uq.edu.au/view/UQ:57372 Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algorithms for generating order preserving minimal perfect hash functions. We show that almost all members of the family construct space and time optimal order preserving minimal perfect hash functions, and we identify the one with minimum constants. Members of the family generate a hash function in two steps. First a special kind of function into an r-graph is computed probabilistically. Then this function is refined deterministically to a minimal perfect hash function. We give strong theoretical evidence that the first step uses linear random time. The second step runs in linear deterministic time. The family not only has theoretical importance, but also offers the fastest known method for generating perfect hash functions. 2007-08-13T00:00:00Z Majewski, BS og Wormald, NC og Havas, G og Czech, ZJ http://espace.library.uq.edu.au/view/UQ:256339 This study describes a novel method for automatically obtaining the attitude of an aircraft from the visual horizon. A wide-angle view of the environment, including the visual horizon, is captured and the input images are classified into fuzzy sky and ground regions using the spectral and intensity properties of the pixels. The classifier is updated continuously using an online reinforcement strategy and is therefore able to adapt to the changing appearance of the sky and ground, without requiring prior training offline. A novel approach to obtaining the attitude of the aircraft from the classified images is described, which is reliable, accurate, and computationally efficient to implement. This method is therefore suited to real-time operation and we present results from flight tests that demonstrate the ability of this vision-based approach to outperform an inexpensive inertial system. 2011-10-17T00:00:00Z Moore, Richard J. D. og Thurrowgood, Saul og Bland, Daniel og Soccol, Dean og Srinivasan, Mandyam V. http://espace.library.uq.edu.au/view/UQ:188993 2009-12-03T00:00:00Z Sode-Yome. Arthit og Kwang, Y. Lee og Mithulananthan, Nadarajah http://espace.library.uq.edu.au/view/UQ:293494 A new method of finding optimal variables using self-adaptive differential evolution derived multi-modal image registration is proposed. The method features multi-resolution images achieved through down-sampling at different stages of the transformation model variable optimization process. The performance of the method is illustrated by registering magnetic resonance images to histological sections. We provide an investigation of the impact of the down-sampling factor and convergence criteria. Our findings show that given appropriately down-sampled images, and by using the proposed approach, it is possible to find optimal registration transformation model variables faster than if appropriate down-sampling is not used. 2013-03-12T14:34:07Z Yang, Zhengyi og Vegh, Viktor og Reutens, David http://espace.library.uq.edu.au/view/UQ:135168 A new class of a receive-only 2 T 4-element rotary phased array head coil has been proposed for MRI brain imaging applications. Coil elements of the rotary phased array head coil have "paddle-like" structures consisting of a pair of main conductors located on opposite sides, inserted equi-angularly around and over the head. Using such a unique design, the proposed rotary head coil can improve the sensitivity deep at the centre of the brain and produces highly homogeneous brain images. The rotary phased array head coil is numerically modeled using a hybrid MoM/FEM method and a prototype was constructed accordingly. In vivo MR brain imaging using the prototype rotary phased array head coil has been undertaken and the acquired brain images show high homogeneity as anticipated. In addition, parallel imaging, VD-GRAPPA, is used in conjunction with the rotary phased array head coil to enable rapid imaging. 2008-04-11T00:00:00Z Weber, E. og Li, B. K. og Liu, F. og Crozier, S. http://espace.library.uq.edu.au/view/UQ:176465 This paper presents a method for constructing a biomechanical breast model which does not require an initial time- and labour-intensive segmentation of the breast tissue. This is achieved by mapping voxel intensity and enhancement levels directly to Youngpsilas modulus values characteristic of the respective tissues. We demonstrate this new method by incorporating it into a biomechanically based registration evaluation framework, which produces qualitatively the same results as a segmentation based model. 2009-04-16T00:00:00Z Hill, A. og Mehnert, A. og Crozier, S. http://espace.library.uq.edu.au/view/UQ:103870 2007-08-23T00:00:00Z Wang, Hua og Bialkowski, Marek E. og Liu, Feng og Crozier, Stuart http://espace.library.uq.edu.au/view/UQ:100524 2007-08-23T00:00:00Z Liu, F. og Crozier, S. http://espace.library.uq.edu.au/view/UQ:234974 2011-03-11T00:00:00Z Iyer, K. og Mason, D.G. og Suresh, S. og Terrill, P.I. og Wilson, S.J. http://espace.library.uq.edu.au/view/UQ:8055 In this paper, we propose that, in order to improve customer satisfaction, we need to incorporate communication modes (e.g., speech act) in the current standards of web services specifications. We show that with the communication modes, we can estimate various affects on service consumers during their interactions with web services. With this information, a web-service management system can automatically prevent and compensate potential negative affects, and even take advantage of positive affect. 2006-07-28T00:00:00Z Song, I. og Governatori, G. http://espace.library.uq.edu.au/view/UQ:8554 In [12,16] we showed how to combine propositional BDI logics using Gabbay's fibring methodology. In this paper we extend the above mentioned works by providing a tableau-based decision procedure for the combined/fibred logics. To achieve this end we first outline with an example two types of tableau systems, (graph and path), and discuss why both are inadequate in the case of fibring. Having done that we show how to uniformly construct a tableau calculus for the combined logic using Governatori's labelled tableau system KEM. 2006-03-20T00:00:00Z Padmanabhan, Vineet og Governatori, Guido http://espace.library.uq.edu.au/view/UQ:13298 In previous works we showed how to combine propositional multimodal logics using Gabbay's \emph{fibring} methodology. In this paper we extend the above mentioned works by providing a tableau-based proof technique for the combined/fibred logics. To achieve this end we first make a comparison between two types of tableau proof systems, (\emph{graph} $\&$ \emph{path}), with the help of a scenario (The Friend's Puzzle). Having done that we show how to uniformly construct a tableau calculus for the combined logic using Governatori's labelled tableau system \KEM. We conclude with a discussion on \KEM's features. 2007-04-02T00:00:00Z Padmanabhan, V. og Governatori, G http://espace.library.uq.edu.au/view/UQ:240832 This paper presents a finite difference method for the design of gradient coil in MRI. In this method, a linear matrix equation is formulated using a finite-difference approximation of the current density in the source domain and an optimization procedure is then carried out to solve the resulting inverse problem and the coil winding pattern are found. The developed algorithm is tested with a transverse biplanar gradient coil design example. Compared with conventional design methods such as target-field, standard stream function or boundary element schemes, the new design approach is relatively easy to implement and flexible to manage the local winding pattern for 2D or 3D geometries. © 2010 IEEE. 2011-05-13T00:00:00Z Zhu, Minhua og Shou, Guofa og Xia, Ling og Li, Xia og Liu, Feng og Crozier, Stuart http://espace.library.uq.edu.au/view/UQ:287792 2012-12-23T00:49:20Z Zhu, Minhua og Xia, Ling og Liu, Feng og Zhu, Jianfeng og Kang, Liyi og Crozier, Stuart http://espace.library.uq.edu.au/view/UQ:77939 This paper defines the 3D reconstruction problem as the process of reconstructing a 3D scene from numerous 2D visual images of that scene. It is well known that this problem is ill-posed, and numerous constraints and assumptions are used in 3D reconstruction algorithms in order to reduce the solution space. Unfortunately, most constraints only work in a certain range of situations and often constraints are built into the most fundamental methods (e.g. Area Based Matching assumes that all the pixels in the window belong to the same object). This paper presents a novel formulation of the 3D reconstruction problem, using a voxel framework and first order logic equations, which does not contain any additional constraints or assumptions. Solving this formulation for a set of input images gives all the possible solutions for that set, rather than picking a solution that is deemed most likely. Using this formulation, this paper studies the problem of uniqueness in 3D reconstruction and how the solution space changes for different configurations of input images. It is found that it is not possible to guarantee a unique solution, no matter how many images are taken of the scene, their orientation or even how much color variation is in the scene itself. Results of using the formulation to reconstruct a few small voxel spaces are also presented. They show that the number of solutions is extremely large for even very small voxel spaces (5 x 5 voxel space gives 10 to 10(7) solutions). This shows the need for constraints to reduce the solution space to a reasonable size. Finally, it is noted that because of the discrete nature of the formulation, the solution space size can be easily calculated, making the formulation a useful tool to numerically evaluate the usefulness of any constraints that are added. 2007-08-15T00:00:00Z Robinson, M. og Kubik, K. og Lovell, B. http://espace.library.uq.edu.au/view/UQ:60950 The design of open-access elliptical cross-section magnet systems has recently come under consideration. Obtaining values for the forces generated within these unusual magnets is important to progress the designs towards feasible instruments. This paper presents a novel and flexible method for the rapid computation of forces within elliptical magnets. The method is demonstrated by the analysis of a clinical magnetic resonance imaging magnet of elliptical cross-section and open design. The analysis reveals the non-symmetric nature of the generated Maxwell forces, which are an important consideration, particularly in the design of superconducting systems. 2007-08-14T00:00:00Z Snape-Jenkinson, C. J. og Crozier, S. og Forbes, L. K. http://espace.library.uq.edu.au/view/UQ:96162 2007-08-24T00:00:00Z Rajagopalan, K. og Sutton, P. R. http://espace.library.uq.edu.au/view/UQ:262770 2011-12-02T00:00:00Z Antoniades, M. A. og Eleftheriades, G. V. http://espace.library.uq.edu.au/view/UQ:231166 In the last decade, compact low-profile antennas featuring multiband operation have drawn a considerable interest from designers of portable wireless devices. The demand for these antennas stems from the fact that modern portable devices have to access an increased number of wireless services across the frequency spectrum from approximately 880MHz to 5850MHz. 2011-03-04T00:00:00Z Bialkowski, Marek E. og Razali, Ahmad Rashidy og Boldaji, Ashkan http://espace.library.uq.edu.au/view/UQ:8412 This paper presents a formal system for reasoning about violations of obligations in contracts. The system is based on the formalism for the representation of contrary-to-duty obligations. These are the obligations that take place when other obligations are violated as typically applied to penalties in contracts. The paper shows how this formalism can be mapped onto the key policy concepts of a contract specification language, called Business Contract Language (BCL), previously developed to express contract conditions for run time contract monitoring. The aim of this mapping is to establish a formal underpinning for this key subset of BCL. 2006-05-16T00:00:00Z Governatori, Guido og Milosevic, Zoran http://espace.library.uq.edu.au/view/UQ:9607 This paper presents a formal and executable approach to capture the behaviour of parties involved in a negotiation. A party is modeled as a negotiating agent composed of a communication module, a control module, a reasoning module, and a knowledge base. The control module is expressed as a statechart, and the reasoning module as a defeasible logic program. A strategy specification therefore consists of a statechart, a set of defeasible rules, and a set of initial facts. Such a specification can be dynamically plugged into an agent shell incorporating a statechart interpreter and a defeasible logic inference engine, in order to yield an agent capable of participating in a given type of negotiations. The choice of statecharts and defeasible logic with respect to other formalisms is justified against a set of desirable criteria, and their suitability is illustrated through concrete examples of bidding and multi-lateral bargaining scenarios. 2005-04-11T00:00:00Z Dumas, Marlon og Governatori, Guido og ter Hofstede, Arthur H. M og Oaks, Philippa http://espace.library.uq.edu.au/view/UQ:9619 We propose a formal and executable framework for expressing protocols and strategies for automated (legal) negotiation. In this framework a party involved in a negotiation is represented through a software agent composed of four modules: (i) a communication module which manages the interaction with the other agents; (ii) a control module; (iii) a reasoning module specified as a defeasible theory; and (iv) a knowledge base which bridges the control and the reasoning modules, while keeping track of past decisions and interactions. The choice of defeasible logic is justified against a set of desirable criteria for negotiation automation languages. Moreover, the suitability of the framework is illustrated through two case studies. 2005-04-11T00:00:00Z Governatori, Guido og Dumas, Marlon og ter Hofstede, Arthur H. M og Oaks, Philippa http://espace.library.uq.edu.au/view/UQ:2473 This paper presents a case study in verified program compilation from high-level language programs to assembler code using the Cogito formal development system. A form of window-inference based on the Z schema is used to perform the compilation. Data-refinement is used to change the representation of integer variables to assembler word locations. 2006-04-11T17:21:35Z Wildman, Luke http://espace.library.uq.edu.au/view/UQ:83960 2007-08-14T00:00:00Z Wildman, L. P. http://espace.library.uq.edu.au/view/UQ:59394 2007-08-14T00:00:00Z Kim, S. og Carrington, D. A. http://espace.library.uq.edu.au/view/UQ:100426 This paper presents a formal framework for modelling and analysing mobile systems. The framework comprises a collection of models of the dominant design paradigms which are readily extended to incorporate details of particular technologies, i.e., programming languages and their run-time support, and applications. The modelling language is Object-Z, an extension of the well-known Z specification language with explicit support for object-oriented concepts. Its support for object orientation makes Object-Z particularly suited to our task. The system structuring techniques offered by object-orientation are well suited to modelling mobile systems. In addition, inheritance and polymorphism allow us to exploit commonalities in mobile systems by defining more complex models in terms of simpler ones. 2007-08-23T00:00:00Z Smith, G. P. http://espace.library.uq.edu.au/view/UQ:203993 Design patterns are typically defined imprecisely using natural language descriptions with graphical annotations. It is also common to describe patterns using a concrete design example with implementation details. Several approaches have been proposed to describe design patterns abstractly based on role concepts. However, the notion of role differs in each approach. The behavioral aspects of patterns are not addressed in the role-based approaches. This paper presents a rigorous approach to describe design patterns based on role concepts.Adopting metamodeling and formalism, our work defines an innovative framework where generic pattern concepts based on roles are precisely defined as a formal role metamodel using Object-Z. Individual patterns are specified using these generic role concepts in terms of pattern role models. Temporal behaviors of patterns are also specified using Object-Z and integrated in the pattern role models. Patterns described this way are abstract, separating pattern realization information from the pattern description. They are also precise providing a rigorous foundation for reasoning about pattern properties. This paper also formalizes the properties that must be captured in a class model when a design pattern is deployed. These properties are defined generically in terms of role bindings from a pattern role model to a class model. They provide a precise basis for checking the validity of pattern utilisation in designs. Our work is supported by tools. We have developed an initial role metamodel using an existing modeling framework, Eclipse Modeling Framework (EMF) and have transformed the metamodel to Object-Z using model transformation techniques. Complex constraints are added to the transformed Object-Z model. More importantly, we implement the role metamodel. Using this implementation, pattern authors can develop an initial pattern role model in the same modeling framework and convert the initial model to Object-Z using our transformation rules. The transformed Object-Z model is then enhanced with behavioral features of the pattern. This tool support significantly improves the practicability of applying formalism to design patterns. 2010-04-22T11:31:23Z Kim, Soon Kyeong og Carrington, David http://espace.library.uq.edu.au/view/UQ:147470 2008-06-06T00:00:00Z Kim, S. og Carrington, D. A. http://espace.library.uq.edu.au/view/UQ:97290 A significant problem with currently suggested approaches for transforming between models in different languages is that the transformation is often described imprecisely, with the result that the overall transformation task may be imprecise, incomplete and inconsistent. This paper presents a formal metamodeling approach for transforming between UML and Object-Z. In the paper, the two languages are defined in terms of their formal metamodels, and a systematic transformation between the models is provided at the meta-level in terms of formal mapping functions. As a consequence, we can provide a precise, consistent and complete transformation between them. 2007-08-24T01:09:46Z Kim, Soon-Kyeong og Carrington, David http://espace.library.uq.edu.au/view/UQ:10542 Formal modeling notations and visual modeling notations can complement each other when developing software models. The most frequently adopted approach is to define transformations between the visual and formal models. However, a significant problem with the currently suggested approaches is that the transformation itself is often described imprecisely, with the result that the overall transformation task may be imprecise, incomplete and inconsistent. This paper presents a formal metamodeling approach to transform between UML and Object-Z. In the paper, the two languages are defined in terms of their formal metamodels, and a systematic transformation between the models is provided at the meta-level in terms of formal mapping functions. As a consequence, we can provide a precise, consistent and complete transformation between a visual model in UML and a formal model in Object-Z. 2004-04-08T00:00:00Z Kim, Soon-Kyeong og Carrington, David http://espace.library.uq.edu.au/view/UQ:10573 This document describes a formal model of the cognitive processes involved in a simplified Air Traffic Control task. The model has been developed as part of the SafeHCI project, which is investigating detection and prevention of human error in safety-critical systems. The model will serve as the basis for development of new techniques for prediction of error sources and classification of error types. This document describes the cognitive model in detail. 2004-05-19T00:00:00Z Connelly, Simon og Lindsay, Peter og Neal, Andrew og Humphreys, Mike http://espace.library.uq.edu.au/view/UQ:62286 Program compilation can be formally defined as a sequence of equivalence-preserving transformations, or refinements, from high-level language programs to assembler code, Recent models also incorporate timing properties, but the resulting formalisms are intimidatingly complex. Here we take advantage of a new, simple model of real-time refinement, based on predicate transformer semantics, to present a straightforward compilation formalism that incorporates real-time constraints. (C) 2002 Elsevier Science B.V. All rights reserved. 2007-08-14T00:00:00Z Lermer, K. og Fidge, C. http://espace.library.uq.edu.au/view/UQ:97289 2007-08-24T00:00:00Z Kim, S. og Carrington, D. A. http://espace.library.uq.edu.au/view/UQ:100518 We discuss how integrity consistency constraints between different UML models can be precisely defined at a language level. In doing so, we introduce a formal object-oriented metamodeling approach. In the approach, integrity consistency constraints between UML models are defined in terms of invariants of the UML model elements used to define the models at the language-level. Adopting a formal approach, constraints are formally defined using Object-Z. We demonstrate how integrity consistency constraints for UML models can be precisely defined at the language-level and once completed, the formal description of the consistency constraints will be a precise reference of checking consistency of UML models as well as for tool development. 2007-08-23T00:00:00Z Kim, S. og Carrington, D. A. http://espace.library.uq.edu.au/view/UQ:9048 Answering a query over a group of RDF data pages is a trivial process. However, in the Semantic Web, there is a need for ontology technology. Consequently, OWL, a family of web ontology languages based on description logic, has been proposed for the Semantic Web. Answering a query over the Semantic Web is thus not trivial, but a deductive process. However, the reasoning on OWL with data has an efficiency problem. Thus, we introduce optimization techniques for the inference algorithm. This work demonstrates the techniques for instance checking and instance retrieval problems with respect to ALC description logic which covers certain parts of OWL. 2005-10-25T00:00:00Z Pothipruk, Pakornpong og Governatori, Guido http://espace.library.uq.edu.au/view/UQ:103130 2007-08-23T00:00:00Z Kim, S. K. og Carrington, D. A. http://espace.library.uq.edu.au/view/UQ:67052 Formal specifications can precisely and unambiguously define the required behavior of a software system or component. However, formal specifications are complex artifacts that need to be verified to ensure that they are consistent, complete, and validated against the requirements. Specification testing or animation tools exist to assist with this by allowing the specifier to interpret or execute the specification. However, currently little is known about how to do this effectively. This article presents a framework and tool support for the systematic testing of formal, model-based specifications. Several important generic properties that should be satisfied by model-based specifications are first identified. Following the idea of mutation analysis, we then use variants or mutants of the specification to check that these properties are satisfied. The framework also allows the specifier to test application-specific properties. All properties are tested for a range of states that are defined by the tester in the form of a testgraph, which is a directed graph that partially models the states and transitions of the specification being tested. Tool support is provided for the generation of the mutants, for automatically traversing the testgraph and executing the test cases, and for reporting any errors. The framework is demonstrated on a small specification and its application to three larger specifications is discussed. Experience indicates that the framework can be used effectively to test small to medium-sized specifications and that it can reveal a significant number of problems in these specifications. 2007-08-15T00:00:00Z Miller, T. og Strooper, P. http://espace.library.uq.edu.au/view/UQ:274105 2012-05-15T14:41:13Z Süß, Jörn Guy og Carrington, David og Robinson, Neil og Strooper, Paul http://espace.library.uq.edu.au/view/UQ:259058 Data Quality (DQ) is increasingly gaining more importance as organizations as well as individuals are relying on data available from various data sources. User satisfaction from query result is directly related to the quality of data returned to user. In this paper we present a framework for DQ aware query systems focused on three key requirements of profiling DQ, capturing user preferences on DQ and processing data quality aware queries. 2011-10-23T02:08:33Z Yeganeh, Naiem K. og Sharaf, Mohamed A. http://espace.library.uq.edu.au/view/UQ:23863 There are many techniques for electricity market price forecasting. However, most of them are designed for expected price analysis rather than price spike forecasting. An effective method of predicting the occurrence of spikes has not yet been observed in the literature so far. In this paper, a data mining based approach is presented to give a reliable forecast of the occurrence of price spikes. Combined with the spike value prediction techniques developed by the same authors, the proposed approach aims at providing a comprehensive tool for price spike forecasting. In this paper, feature selection techniques are firstly described to identify the attributes relevant to the occurrence of spikes. A simple introduction to the classification techniques is given for completeness. Two algorithms: support vector machine and probability classifier are chosen to be the spike occurrence predictors and are discussed in details. Realistic market data are used to test the proposed model with promising results. 2007-07-05T00:00:00Z Zhao, J. H. og Dong, Z. Y. og Li, Xue og Wong, K. P. http://espace.library.uq.edu.au/view/UQ:261079 Ontology has been widely used to represent many real world aspects and is prominently used as tool to facilitate shared understanding (and knowledge sharing) in a particular domain. Ensuring that such an ontology is relevant to a particular domain, however, remains a challenging task to the ontology developer. This paper introduces a framework that guides industry-relevant ontology development. The framework follows a typical ontology development cycle and details incremental steps that need to be taken to assure industry-relevance of the ontology. To provide a thorough discussion of the framework, we utilise a previously completed ontology development project that followed the developed framework. The project was specifically aimed at developing an industry-relevant ontology for the compliance management domain and was based on three main inputs, namely, scholarly articles, industry expert/practitioner input and industry reports. Our experience indicates that the application of the developed framework promotes ontology development that utilises industry and academic inputs to assure the developed ontology is relevant to its domain. 2011-11-10T00:00:00Z Abdullah, Norris Syed og Sadiq, Shazia og Indulska, Marta http://espace.library.uq.edu.au/view/UQ:175691 2009-04-14T00:00:00Z Abeyratne, U. http://espace.library.uq.edu.au/view/UQ:9887 This paper proposes a conceptual framework for the reliability assessment of software components that incorporates test case execution and output evaluation. Determining an operational profile and test output evaluation are two difficult and important problems that must be addressed in such a framework. Determining an operational profile is difficult, because it requires anticipating the future use of the component. An expected result is needed for each test case to evaluate the test result and a test oracle is used to generate these expected results. The framework combines statistical testing and test oracles implemented as self-checking versions of the implementations. The framework is illustrated using two examples that were chosen to identify the issues that must be addressed to provide tool support for the framework. 2005-02-18T00:00:00Z Shukla, Rakesh og Strooper, Paul og Carrington, David http://espace.library.uq.edu.au/view/UQ:57378 Test templates and a test template framework are introduced as useful concepts in specification-based testing. The framework can be defined using any model-based specification notation and used to derive tests from model-based specifications-in this paper, it is demonstrated using the Z notation. The framework formally defines test data sets and their relation to the operations in a specification and to other test data sets, providing structure to the testing process. Flexibility is preserved, so that many testing strategies can be used. Important application areas of the framework are discussed, including refinement of test data, regression testing, and test oracles. 2007-08-13T00:00:00Z Stocks, P og Carrington, D http://espace.library.uq.edu.au/view/UQ:130717 Statistical testing involves the testing of software by selecting test cases from a probability distribution that is intended to represent the software's operational usage. In this paper, we describe and evaluate a framework for statistical testing of software components that incorporates test case execution and output evaluation. An operational profile and a test oracle are essential for the statistical testing of software components because they are used for test case generation and output evaluation respectively. An operational profile is a set of input events and their associated probabilities of occurence expected in actual operation. A test oracle is a mechanism that is used to check the results of test cases. We present four types of operational profiles and three types of test oracles, and empirically evaluate them using the framework by applying them to two software components. The results show that while simple operational profiles may be effective for some components, more sophisticated profiles are needed for others. For the components that we tested, the fault-detecting effectiveness of the test oracles was similar. 2008-02-18T00:00:00Z Shukla, Rakesh og Strooper, Paul og Carrington, David