Procedure compilation in the refinement calculus

High-level language program compilation strategies can be proven correct by modelling the process as a series of refinement steps from source code to a machine-level description. We show how this can be done for programs containing recursively-defined procedures in the well-established predicate transformer semantics for refinement. To do so the formalism is extended with an abstraction of the way stack frames are created at run time for procedure parameters and variables.

Structural basis of autoregulation of phenylalanine hydroxylase

Phenylalanine hydroxylase converts phenylalanine to tyrosine, a rate-limiting step in phenylalanine catabolism and protein and neurotransmitter biosynthesis. It is tightly regulated by the substrates phenylalanine and tetrahydrobiopterin and by phosphorylation. We present the crystal structures of dephosphorylated and phosphorylated forms of a dimeric enzyme with catalytic and regulatory properties of the wild-type protein. The structures reveal a catalytic domain flexibly linked to a regulatory domain. The latter consists of an N-terminal autoregulatory sequence (containing Ser 16, which is the site of phosphorylation) that extends over the active site pocket, and an alpha-beta sandwich core that is, unexpectedly, structurally related to both pterin dehydratase and the regulatory domains of metabolic enzymes. Phosphorylation has no major structural effects in the absence of phenylalanine, suggesting that phenylalanine and phosphorylation act in concert to activate the enzyme through a combination of intrasteric and possibly allosteric mechanisms.

The mechanisms of combustion and continuous reactions during mechanical alloying

Some materials exhibit a combustion event during mechanical alloying, which results in the rapid transformation of reactants into products, while others show a slow transformation of reactants into products, In this paper, the continuous W + C --> WC reaction is compared to the Ti + C --> TiC combustion reaction. Rietveld refinement of X-ray diffraction patterns is used to show that these particular reactions proceed through different pathways, determined by crystallographic factors of the reactants. When a crystallographic relationship exists between the reactants and the products, such as that between W and WC, the product forms slowly over a period of time. In contrast, insertion of C into the Ti structure is associated with atomic rearrangements within the crowded lattice planes and the subsequent catastrophic failure of the reactant lattices results in combustion to form TiC. (C) 2001 Academic Press.

Limitations of asymmetric parallel-beam geometry

Bragg diffraction peak profiles and intensities in asymmetric (Omega-2theta) diffraction using a mirror-based parallel-beam geometry were compared with symmetric parallel-beam (theta-2theta) and conventional Bragg - Brentano (theta-2theta) diffraction for a powdered quartz sample and the NIST standard reference material (SRM) 660a (LaB6, lanthanum hexaboride). A comparison of the intensities and line widths (full width at half-maximum, FWHM) of these techniques demonstrated that low incident angles (Omega < 5&DEG;) are preferable for the parallel-beam setup. For higher &UOmega; values, if 2θ < 2Omega, mass absorption reduces the intensities significantly compared with the Bragg - Brentano setup. The diffraction peak shapes for the mirror geometry are more asymmetric and have larger FWHM values than corresponding peaks recorded with a Bragg - Brentano geometry. An asymmetric mirror-based parallel-beam geometry offers some advantages in respect of intensity when compared with symmetric geometries, and hence may be well suited to quantitative studies, such as those involving Rietveld analysis. A trial Rietveld refinement of a 50% quartz - 50% corundum mixture was performed and produced adequate results.

Supporting contexts in program refinement

A program can be refined either by transforming the whole program or by refining one of its components. The refinement of a component is, for the main part, independent of the remainder of the program. However, refinement of a component can depend on the context of the component for information about the variables that are in scope and what their types are. The refinement can also take advantage of additional information, such as any precondition the component can assume. The aim of this paper is to introduce a technique, which we call program window inference, to handle such contextual information during derivations in the refinement calculus. The idea is borrowed from a technique, called window inference, for handling context in theorem proving. Window inference is the primary proof paradigm of the Ergo proof editor. This tool has been extended to mechanize refinement using program window inference. (C) 1997 Elsevier Science B.V.

Procedures and parameters in the real-time program refinement calculus

The real-time refinement calculus is a formal method for the systematic derivation of real-time programs from real-time specifications in a style similar to the non-real-time refinement calculi of Back and Morgan. In this paper we extend the real-time refinement calculus with procedures and provide refinement rules for refining real-time specifications to procedure calls. A real-time specification can include constraints on, not only what outputs are produced, but also when they are produced. The derived programs can also include time constraints oil when certain points in the program must be reached; these are expressed in the form of deadline commands. Such programs are machine independent. An important consequence of the approach taken is that, not only are the specifications machine independent, but the whole refinement process is machine independent. To implement the machine independent code on a target machine one has a separate task of showing that the compiled machine code will reach all its deadlines before they expire. For real-time programs, externally observable input and output variables are essential. These differ from local variables in that their values are observable over the duration of the execution of the program. Hence procedures require input and output parameter mechanisms that are references to the actual parameters so that changes to external inputs are observable within the procedure and changes to output parameters are externally observable. In addition, we allow value and result parameters. These may be auxiliary parameters, which are used for reasoning about the correctness of real-time programs as well as in the expression of timing deadlines, but do not lead to any code being generated for them by a compiler. (c) 2006 Elsevier B.V. All rights reserved.

A technique for modular logic program refinement

A refinement calculus provides a method for transforming specifications to executable code, maintaining the correctness of the code with respect to its specification. In this paper we introduce modules into a logic programming refinement calculus. Modules allow data types to be grouped together with sets of procedures that manipulate the data types. By placing restrictions on the way a program uses a module, we develop a technique for refining the module so that it uses a more efficient representation of the data type.

A formal model of real-time program compilation

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.

The variety of variables in automated real-time refinement

The refinement calculus is a well-established theory for deriving program code from specifications. Recent research has extended the theory to handle timing requirements, as well as functional ones, and we have developed an interactive programming tool based on these extensions. Through a number of case studies completed using the tool, this paper explains how the tool helps the programmer by supporting the many forms of variables needed in the theory. These include simple state variables as in the untimed calculus, trace variables that model the evolution of properties over time, auxiliary variables that exist only to support formal reasoning, subroutine parameters, and variables shared between parallel processes.

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.

Towards a refinement calculus for concurrent real-time programs

We define a language and a predicative semantics to model concurrent real-time programs. We consider different communication paradigms between the concurrent components of a program: communication via shared variables and asynchronous message passing (for different models of channels). The semantics is the basis for a refinement calculus to derive machine-independent concurrent real-time programs from specifications. We give some examples of refinement laws that deal with concurrency.

Compilation by refinement for a practical assembly language

In this paper we extend the conventional framework of program refinement down to the assembler level. We describe an extension to the Refinement Calculus that supports the refinement of programs in the Guarded Command Language to programs in .NET assembler. This is illustrated by a small example.

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.

Combining GIS and Expert Opinion to Model Landscapes for a Smallholder Forest Extension Program in Leyte, the Philippines

A Geographic Information System (GIS) was used to model datasets of Leyte Island, the Philippines, to identify land which was suitable for a forest extension program on the island. The datasets were modelled to provide maps of the distance of land from cities and towns, land which was a suitable elevation and slope for smallholder forestry and land of various soil types. An expert group was used to assign numeric site suitabilities to the soil types and maps of site suitability were used to assist the selection of municipalities for the provision of extension assistance to smallholders. Modelling of the datasets was facilitated by recent developments of the ArcGIS® suite of computer programs and derivation of elevation and slope was assisted by the availability of digital elevation models (DEM) produced by the Shuttle Radar Topography (SRTM) mission. The usefulness of GIS software as a decision support tool for small-scale forestry extension programs is discussed.