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.

Proceedings Ninth Asia-Pacific Software Engineering Conference. ASPEC 2002

The following topics are dealt with: Requirements engineering; components; design; formal specification analysis; education; model checking; human computer interaction; software design and architecture; formal methods and components; software maintenance; software process; formal methods and design; server-based applications; review and testing; measurement; documentation; management and knowledge-based approaches.

Bellerophon: a program to detect chimeric sequences in multiple sequence alignments

Bellerophon is a program for detecting chimeric sequences in multiple sequence datasets by an adaption of partial treeing analysis. Bellerophon was specifically developed to detect 16S rRNA gene chimeras in PCR-clone libraries of environmental samples but can be applied to other nucleotide sequence alignments.

Concurreny based transition refinement for the verification of distributed algorithms

We suggest a new notion of behaviour preserving transition refinement based on partial order semantics. This notion is called transition refinement. We introduced transition refinement for elementary (low-level) Petri Nets earlier. For modelling and verifying complex distributed algorithms, high-level (Algebraic) Petri nets are usually used. In this paper, we define transition refinement for Algebraic Petri Nets. This notion is more powerful than transition refinement for elementary Petri nets because it corresponds to the simultaneous refinement of several transitions in an elementary Petri net. Transition refinement is particularly suitable for refinement steps that increase the degree of distribution of an algorithm, e.g. when synchronous communication is replaced by asynchronous message passing. We study how to prove that a replacement of a transition is a transition refinement.