Program transformation

The acquisition sequence is as follows a first acquisition calibration enables the acquisition operator to verify the data before storage. The row data, together with calibration files are transferred to the analysis program. The program transforms the row data into calibrated data, which is then analysed. 

Program transforms the c s to a set based on the original, atom-centered basis functions. 

This section briefly discusses two elements common to all configuration interaction programs transformation of integrals, and iterative subspace diagonal-ization of the Hamiltonian. 

Table 4.1 Characteristics for the variables teelmique program transformation 33...

Table 4.2 Characteristics for the Inverted Branehes teelmique program transformation 36...

Table 4.3 Characteristics for the PODER program transformation to the matrix multiplication 45...

Table 4.9 Characteristics for the HETA program transformation to the bubble sort 60...

Table 4.1 Charaeteristies for the variables technique program transformation...

The meta-interpreter in our framework is constructed for reasoning with the metaprograms MPs, MMPs, and AMPs. It is defined by a demo predicate of the form demo (A). With this predicate we can infer the answer A from the meta-programs. Our meta-interpreter adapts the Vanilla meta-interpreter in [12] in order for reasoning with the meta-programs transformed from ontologies and rules where we have defined three kinds of meta-level statements (1) statement (A B) for the object-level of an ontology, (2) meta statement (A B) for the... 

In this paper we have presented a meta-logical framework for reasoning with ontologies and rules expressed in OWL 2. The logical system of our framework consists of meta-programs transformed from ontologies and rules expressed in... 

In the near future, the Publisher intends to transfer the information published in this book into data-base form. Since maintaining the stored information up to date is relatively easy and the production of diskettes can be kept at low cost, the readers will be offered an option to subscribe to the bi-annual update program. Transforming the information into a data-base format will also permit incorporation of additional entries from those companies that are not represented in this volume. 

Applicability conditions are often attached to the transformation rules. Transformational synthesis is obviously an outgrowth of program transformation (optimization) research. And, as hinted before, there is only a fine line—if any— between program synthesis and program transformation. 

Compared to transformational synthesis, there is no problem here about when to stop synthesis halts when the proof is completed. Transformational synthesis seems more appropriate for synthesis from specifications that are almost programs (in which case synthesis is more like an optimizing transformation), whereas proofs-as-programs synthesis seems more appropriate for synthesis from highly descriptive specifications. Note that program transformation may actually be performed by the transformation of synthesis proofs. 

Some of the early efforts were conducted at Imperial College of Science and Technology in Lx)ndon (UK). The developed synthesis mechanisms, called symbolic execution, were inspired by the foundational work on LISP program transformation of [Burstall and Darlington 77]. 

J. Darlington. An experimental program transformation and synthesis system. Artificial Intelligence 16(l) l-46,1981. Also in [Rich and Waters 86a], pp. 99-121. [De Boeck and Le Charlier 90]... 

M. S. Feather. A survey and classification of some program transformation ap-... 

H. Partsch and R. Steinbriiggen. Program transformation systems. Computing Surveys 15(3) 199-236, Sep. 1983. 

Another aspect that may be examined is how efficiently the program transforms its inputs into outputs. Table 9.5 provides an example of cost-efficiency analysis where the measure is the cost of delivering 1,000 calories via various school feeding programs. This is a fairly straightforward case with closely comparable outputs and inputs across different programs. 

In the step from the raw experimental data to data that can be treated by conventional computer programs, transformations are often necessary. For titrations, the raw data are EMF values as a function of titrant added (volume changes may be more or less important). These would typically be transformed to log[H ] (or pH), total acid concentration, and dilution factors (e.g., for FITEQL). With LAKE [32], raw data can be treated directly. An input file or the code itself must, in such a case, provide all the information necessary for the calculation of equilibria (e.g., LAKE must perform the transformations to obtain concentrations from the raw data). For the majority of eodes, however, pH or log[H ] as a function of titrant added is required. EMF values must be transformed to pH or log[H" ] using the apphed calibration procedures. Here, the calibration and, sometimes, assumptions in the data treatment may be important. Calibration can be performed on the eoneentration or on the activity scale. The concentration scale has the advantage that, a priori, no assumptions about activity coefficients are necessary the disadvantage is that such an approach is limited to one ionic medium (the constant ionic medium approach), although in work on suspensions, the variation of the ionic medium certainly is of importance. The activity scale requires assumptions concerning the treatment of activity coefficients it must be realized that sueh assumptions must lead to self-consistency between the finally presented experimental data and the model calculations. 

As a result of diese experiments, tbe fdlowing have been idmtified as impcntant features and criteria for a successful tool based on formal program transformations ... 

This study shows that by using an appropriate models we can represent interrupt-driven and concurrent programs within the (purely sequential) WSL language. With such models, reverse engineering techniques of [16] can be applied to extract the specification of the original program. Program transformations are sufficiently... 

---