Amorphous procedure extraction

The procedure extraction problem is concerned with the meaning preserving formation of a procedure from a (not necessarily contiguous) selected set of statements. Previous approaches to the problem have used dependence analysis to identify the non-selected statements which must be 'promoted' (also selected) in order to preserve semantics. All previous approaches to the problem have been syntax preserving. This work shows that by allowing transformation of the program's syntax it is possible to extract both procedures and functions in an amorphous manner. That is, although the amorphous extraction process is meaning preserving it is not necessarily syntax preserving. The amorphous approach is advantageous in a variety of situations. These include when it is desirable to avoid promotion, when a value-returning function is to be extracted from a scattered set of assignments to a variable, and when side effects are present in the program from which the procedure is to be extracted

Amorphous procedure extraction

The procedure extraction problem is concerned with the meaning preserving formation of a procedure from a (not necessarily contiguous) selected set of statements. Previous approaches to the problem have used dependence analysis to identify the non-selected statements which must be 'promoted' (also selected) in order to preserve semantics. All previous approaches to the problem have been syntax preserving. This work shows that by allowing transformation of the program's syntax it is possible to extract both procedures and functions in an amorphous manner. That is, although the amorphous extraction process is meaning preserving it is not necessarily syntax preserving. The amorphous approach is advantageous in a variety of situations. These include when it is desirable to avoid promotion, when a value-returning function is to be extracted from a scattered set of assignments to a variable, and when side effects are present in the program from which the procedure is to be extracted

Effects of quantized fields on the spacetime geometries of static spherically symmetric black holes

Analytic approximations for the stress-energy of quantized fields in the Hartle-Hawking state in static black hole spacetimes predict divergences on the event horizon of the black hole for a number of important cases. Such divergences, if real, could substantially alter the spacetime geometry near the event horizon, possibly preventing the black hole from existing. The results of three investigations of these types of effects are presented. The first involves a new analytic approximation for conformally invariant fields in Reissner-Nordstrom spacetimes which is finite on the horizon. The second focuses on the stress-energy of massless scalar fields in Schwarzschild-de Sitter black holes. The third focuses on the stress-energy of massless scalar fields in zero temperature black hole geometries that could be solutions to the semiclassical backreaction equations near the event horizon of the black hole.Comment: 5 pages. To appear in the "Proceedings of the Eleventh Marcel Grossmann Meeting on General Relativity", July 2006, Berlin, German

Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas

The article attached is a preprint version of the final published article which can be accessed at the link below. The article title has been changed. For referencing purposes please use the published details. Copyright © 2010 Elsevier B.V. All rights reserved.A program schema defines a class of programs, all of which have identical statement structure, but whose functions and predicates may differ. A schema thus defines an entire class of programs according to how its symbols are interpreted. Two schemas are strongly equivalent if they always define the same function from initial states to final states for every interpretation. A subschema of a schema is obtained from a schema by deleting some of its statements. A schema S is liberal if there exists an initial state in the Herbrand domain such that the same term is not generated more than once along any executable path through S. In this paper, we introduce near-liberal schemas, in which this non-repeating condition applies only to terms not having the form g() for a constant function symbol g. Given a schema S that is linear (no function or predicate symbol occurs more than once in S) and a variable v, we compute a set of function and predicate symbols in S which is a subset of those defined by Weiser's slicing algorithm and prove that if for every while predicate q in S and every constant assignment w:=g(); lying in the body of q, no other assignment to w also lies in the body of q, our smaller symbol set defines a correct subschema of S with respect to the final value of v after execution. We also prove that if S is also free (every path through S is executable) and near-liberal, it is decidable which of its subschemas are strongly equivalent to S. For the class of pairs of schemas in which one schema is a subschema of the other, this generalises a recent result in which S was required to be linear, free and liberal.This work was supported by a grant from the Engineering and Physical Sciences Research Council, Grant EP/E002919/1

Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas

This is a preprint version of the article - Copyright @ 2011 ElsevierA program schema defines a class of programs, all of which have identical statement structure, but whose functions and predicates may differ. A schema thus defines an entire class of programs according to how its symbols are interpreted. A subschema of a schema is obtained from a schema by deleting some of its statements. We prove that given a schema S which is predicate-linear, free and liberal, such that the true and false parts of every if predicate satisfy a simple additional condition, and a slicing criterion defined by the final value of a given variable after execution of any program defined by S, the minimal subschema of S which respects this slicing criterion contains all the function and predicate symbols ‘needed’ by the variable according to the data dependence and control dependence relations used in program slicing, which is the symbol set given by Weiser’s static slicing algorithm. Thus this algorithm gives predicate-minimal slices for classes of programs represented by schemas satisfying our set of conditions. We also give an example to show that the corresponding result with respect to the slicing criterion defined by termination behaviour is incorrect. This complements a result by the authors in which S was required to be function-linear, instead of predicate-linear.This work was supported by a grant from the Engineering and Physical Sciences Research Council, Grant EP/E002919/1

Variation in Cortical Density Within the Cortical Shell of Individuals Across a Range in Densities and Ages

OBJECTIVES: The purpose of this study was to determine variability in cortical volumetric bone density (vBMD) from a single slice tibia image over a range of vBMD readings and ages. METHODS: Males and females (N=80; aged 6-80) were randomly selected from a previous study. Cortical vBMD at the anterior, posterior, medial, and lateral regions as well as the endocortical, mid-cortical, and pericortical regions of the cortical shell were determined using pQCT. RESULTS: Mean anterior ROI cortical vBMD (1111±11 mg/cm(3)) was lower than the posterior and lateral ROIs (1169±7 mg/cm(3) and 1151±9 mg/cm(3), respectively), (p CONCLUSIONS: Variability in cortical vBMD was higher among young individuals and those with lower overall cortical vBMD, while lowest in older individuals and men. The anterior ROI had lower mean cortical vBMD than posterior or lateral regions, and endocortical vBMD was lower than the mid- and pericortical regions

High Resolution T-O-F Positron Emission Tomograph

開始ページ、終了ページ: 冊子体のページ付