Deregulation, competition policy and intra-professional contests in medical education

This paper investigates how government policy directions embracing deregulation and market liberalism, together with significant pre-existing tensions within the Australian medical profession, produced ground breaking change in the funding and delivery of medical education for general practitioners. From an initial view between and within the medical profession, and government, about the goal of improving the standards of general practice education and training, segments of the general practice community, particularly those located in rural and remote settings, displayed increasingly vocal concerns about the approach and solutions proffered by the predominantly urban-influenced Royal Australian College of General Practitioners (RACGP). The extent of dissatisfaction culminated in the establishment of the Australian College of Rural and Remote Medicine (ACRRM) in 1997 and the development of an alternative curriculum for general practice. This paper focuses on two decades of changes in general practice training and how competition policy acted as a justificatory mechanism for putting general practice education out to competitive tender against a background of significant intra-professional conflict. The government's interest in increasing efficiency and deregulating the 'closed shop' practices of professions, as expressed through national competition policy, ultimately exposed the existing antagonisms within the profession to public view and allowed the government some influence on the sacred cow of professional training. Government policy has acted as a mechanism of resolution for long standing grievances of the rural GPs and propelled professional training towards an open competition model. The findings have implications for future research looking at the unanticipated outcomes of competition and internal markets.

The real-time refinement calculus: A foundation for machine-independent real-time programming

The real-time refinement calculus is an extension of the standard refinement calculus in which programs are developed from a precondition plus post-condition style of specification. In addition to adapting standard refinement rules to be valid in the real-time context, specific rules are required for the timing constructs such as delays and deadlines. Because many real-time programs may be nonterminating, a further extension is to allow nonterminating repetitions. A real-time specification constrains not only what values should be output, but when they should be output. Hence for a program to implement such a specification, it must guarantee to output values by the specified times. With standard programming languages such guarantees cannot be made without taking into account the timing characteristics of the implementation of the program on a particular machine. To avoid having to consider such details during the refinement process, we have extended our real-time programming language with a deadline command. The deadline command takes no time to execute and always guarantees to meet the specified time; if the deadline has already passed the deadline command is infeasible (miraculous in Dijkstra's terminology). When such a realtime program is compiled for a particular machine, one needs to ensure that all execution paths leading to a deadline are guaranteed to reach it by the specified time. We consider this checking as part of an extended compilation phase. The addition of the deadline command restores for the real-time language the advantage of machine independence enjoyed by non-real-time programming languages.

Computer-aided programming using formally specificed design templates

This paper describes a formal component language, used to support automated component-based program development. The components, referred to as templates, are machine processable, meaning that appropriate tool support, such as retrieval support, can be developed. The templates are highly adaptable, meaning that they can be applied to a wide range of problems. Some of the main features of the language are described, including: higher-order parameters; state variable declarations; specification statements and conditionals; applicability conditions and theories; meta-level place holders; and abstract data structures.