Programs as paths: An approach to timing constraint analysis

A program can be decomposed into a set of possible execution paths. These can be described in terms of primitives such as assignments, assumptions and coercions, and composition operators such as sequential composition and nondeterministic choice as well as finitely or infinitely iterated sequential composition. Some of these paths cannot possibly be followed (they are dead or infeasible), and they may or may not terminate. Decomposing programs into paths provides a foundation for analyzing properties of programs. Our motivation is timing constraint analysis of real-time programs, but the same techniques can be applied in other areas such as program testing. In general the set of execution paths for a program is infinite. For timing analysis we would like to decompose a program into a finite set of subpaths that covers all possible execution paths, in the sense that we only have to analyze the subpaths in order to determine suitable timing constraints that cover all execution paths.

A classification of concurrency failures in java components

The Java programming language supports concurrency. Concurrent programs are hard to test due to their inherent non-determinism. This paper presents a classification of concurrency failures that is based on a model of Java concurrency. The model and failure classification is used to justify coverage of synchronization primitives of concurrent components. This is achieved by constructing concurrency flow graphs for each method call. A producer-consumer monitor is used to demonstrate how the approach can be used to measure coverage of concurrency primitives and thereby assist in determining test sequences for deterministic execution.

Tool support for generating passive C++ test oracles from object-z specifications

A test oracle provides a means for determining whether an implementation behaves according to its specification. A passive test oracle checks that the correct behaviour has been implemented, but does not implement the behaviour itself. In previous work, we have presented a method that allows us to derive passive C++ test oracles from formal specifications written in Object-Z. We describe the "Warlock" prototype tool that supports the method. Warlock is built on top of an existing Object-Z type checker and generates oracle code for a substantial subset of the Object-Z language. We describe the architecture of Warlock and its application to a number of Object-Z specifications. We also discuss its current limitations.

Teaching software engineering fundamentals to practicing engineers

This paper describes an ongoing collaboration between Boeing Australia Limited and the University of Queensland to develop and deliver an introductory course on software engineering for Boeing Australia. The aim of the course is to provide a common understanding for all Boeing Australia's engineering staff of the nature of software engineering and the practices used throughout Boeing Australia. It is meant as an introductory course that can be presented to people with varying backgrounds, such as recent software engineering graduates, systems engineers, quality assurance personnel, etc. The paper describes the structure and content of the course, and the evaluation techniques used to collect feedback from the participants and the corresponding results. The course has been well-received by the participants, but the feedback from the course has indicated a need for more advanced courses in specific areas.

Proceedings of the 2004 Australian Software Engineering Conference

Established in 1986, ASWEC is the premier technical meeting for the Australian Software Engineering Community, and attracts a significant number of international participants. The conference is sponsored by both Engineers Australia and the Australian Computer Society. The major goal of the conference is to provide a forum for exchanging experience and new research results in software engineering. The technical program for ASWEC 2004 includes research papers from Australia and across the world. This year we received 79 submissions from 12 countries: 56 from Australia, 6 from New Zealand, 9 from Asia, 4 from Europe, and 4 from North America. All papers were fully refereed by three (two papers by only two) Program Committee members. We accepted 36 papers to be presented at the conference. We are grateful to all authors who contributed to ASWEC 2004. In addition to the technical papers, the conference program also includes two keynote speakers and one panel on Software Engineering accreditation. We are very pleased about being able to attract Philippe Kruchten, University of British Columbia, and Ian Hayes, The University of Queensland, as the keynote speakers for this conference.

Proceedings of the 2005 Australian Software Engineering Conference

Established in 1986, ASWEC is the premier technical meeting for the Australian software engineering community, and attracts a significant number of international participants. The major goal of the conference is to provide a forum for exchanging experience and new research results in software engineering. To increase the industry participation at ASWEC, we organized two separate paper tracks, which we have called Research Papers and Industry Experience Reports. These paper tracks had separate deadlines, separate program committees, separate review procedures, and separate proceedings. The Research Papers appear in these proceedings and the Industry Experience Reports will appear on a CD-Rom that will be distributed at the conference. The Research Papers track for ASWEC 2005 includes submissions from Australia and across the world. This year we received 79 submissions from 13 countries: 48 from Australia, 7 from New Zealand, 11 from Asia, 9 from Europe, and 2 each from North and South America. All papers were fully refereed by three Program Committee members. We accepted 34 papers to be presented at the conference. We are grateful to all authors who contributed to ASWEC.