The production of male of-only offspring in beef cattle - a proof of principle project

The Australian beef industry places the greatest value in bulls, in comparison to cows, for prime beef production. Male carcasses can be sold for a larger profit due to their increased muscle mass. This project aims to demonstrate the feasibility of producing male animals that can sire male only offspring, through a transgenic approach in mice that could later be translated into livestock production systems. The mouse Sry (Sex determining region on the Y) gene has been shown to provide the initiating molecular signal leading to male sex determination in mammals. Sry has also been shown to cause sex reversal in XX mice transgenic for the gene. In this project Sry will be targeted to a locus not subject to X-inactivation on the X chromosome of XY mice. These mice will be bred to determine how the transgene is passed on, to determine expression of the transgene, and to assess its activity in causing XX sex reversal. The male mice transgenic for the Sry gene on their X chromosome will be produced using tetraploid aggregation, which in a single step produces 100% ES cell derived embryos. The same target locus can later be used to introduce the bovine SRY gene onto the X chromosome of bovidae species and using germ cell transplantation produce sex reversed animals. This would bypass the need for expensive chimera crosses and provide farmers with a stud bull capable of producing only sons.

Incremental derivation of abstraction relations for data refinements

Data refinements are refinement steps in which a program’s local data structures are changed. Data refinement proof obligations require the software designer to find an abstraction relation that relates the states of the original and new program. In this paper we describe an algorithm that helps a designer find an abstraction relation for a proposed refinement. Given sufficient time and space, the algorithm can find a minimal abstraction relation, and thus show that the refinement holds. As it executes, the algorithm displays mappings that cannot be in any abstraction relation. When the algorithm is not given sufficient resources to terminate, these mappings can help the designer find a suitable abstraction relation. The same algorithm can be used to test an abstraction relation supplied by the designer.

Integrating runtime assertions with dynamic types: Structuring a derivation from an incomputable specification

An inherent incomputability in the specification of a functional language extension that combines assertions with dynamic type checking is isolated in an explicit derivation from mathematical specifications. The combination of types and assertions (into "dynamic assertion-types" - DATs) is a significant issue since, because the two are congruent means for program correctness, benefit arises from their better integration in contrast to the harm resulting from their unnecessary separation. However, projecting the "set membership" view of assertion-checking into dynamic types results in some incomputable combinations. Refinement of the specification of DAT checking into an implementation by rigorous application of mathematical identities becomes feasible through the addition of a "best-approximate" pseudo-equality that isolates the incomputable component of the specification. This formal treatment leads to an improved, more maintainable outcome with further development potential.