Grammar Engineering Support for Precedence Rule Recovery and Compatibility Checking

A wide range of parser generators are used to generate parsers for programming languages. The grammar formalisms that come with parser generators provide different approaches for defining operator precedence. Some generators (e.g. YACC) support precedence declarations, others require the grammar to be unambiguous, thus encoding the precedence rules. Even if the grammar formalism provides precedence rules, a particular grammar might not use it. The result is grammar variants implementing the same language. For the C language, the GNU Compiler uses YACC with precedence rules, the C-Transformers uses SDF without priorities, while the SDF library does use priorities. For PHP, Zend uses YACC with precedence rules, whereas PHP-front uses SDF with priority and associativity declarations.The variance between grammars raises the question if the precedence rules of one grammar are compatible with those of another. This is usually not obvious, since some languages have complex precedence rules. Also, for some parser generators the semantics of precedence rules is defined operationally, which makes it hard to reason about their effect on the defined language. We present a method and tool for comparing the precedence rules of different grammars and parser generators. Although it is undecidable whether two grammars define the same language, this tool provides support for comparing and recovering precedence rules, which is especially useful for reliable migration of a grammar from one grammar formalism to another. We evaluate our method by the application to non-trivial mainstream programming languages, such as PHP and C.     

Evaluation of the effects of two alternative participatory ergonomics intervention strategies for construction companies

To improve the use of ergonomics tools by construction workers, the effect of two guidance strategies – a face-to-face strategy (F2F) and an e-guidance strategy (EG) – of a participatory ergonomics intervention was studied. Twelve construction companies were randomly assigned to the F2F group or the EG group. The primary outcome measure, the percentage of workers using ergonomics tools, and secondary outcome measures – work ability, physical functioning and limitations due to physical problems – were assessed using surveys at baseline and after 6 months. Additionally, a cost-benefit analysis was performed on company level. No differences in primary and secondary outcomes were found with the exception of the use of ergonomics tools to adjust working height (F2F +1%; EG +10%; p?=?.001). Newly-implemented tools were used by 23% (F2F) and 42% (EG) of the workers (p?=?.271). Costs were mainly determined by guidance costs (F2F group) or purchase costs (EG group).

Practitioner Summary: Participatory strategies aim to stimulate behavioural change of stakeholders to increase the use of ergonomics tools. Two guidance strategies – face-to-face or e-mail interventions – among construction companies were studied. Both guidance strategies led to an increase in the use of new ergonomics tools.     

Standardized code quality benchmarking for improving software maintainability

We provide an overview of the approach developed by the Software Improvement Group for code analysis and quality consulting focused on software maintainability. The approach uses a standardized measurement model based on the ISO/IEC 9126 definition of maintainability and source code metrics. Procedural standardization in evaluation projects further enhances the comparability of results. Individual assessments are stored in a repository that allows any system at hand to be compared to the industry-wide state of the art in code quality and maintainability. When a minimum level of software maintainability is reached, the certification body of TüV Informationstechnik GmbH issues a Trusted Product Maintainability certificate for the software product.     

A Method for Conceptualising Legal Domains. An Example from the Dutch Unemployment Benefits Act

There has been much talk of the need to build intermediate models of the expertise required preparatory to constructing a knowledge-based system in the legal domain. Such models offer advantages for verification, validation, maintenance and reuse. As yet, however, few such models have been reported at a useful level of detail. In this paper we describe a method for conceptualising legal domains as well as its application to a substantial fragment of the Dutch Unemployment Benefits Act (DUBA).We first discuss the intermediate models (called expertise models), then present a three-stage method for their construction, drawing on the CommonKADS work in knowledge acquisition, conceptual models of statute law, and the KANT method of knowledge analysis. Subsequently, we describe how these techniques were applied to the DUBA, and provide detailed examples of the resulting model. Finally, conclusions on the framework and guidelines are given as well as means of recording and presenting the various design choices.     

Strongly Typed Rewriting For Coupled Software Transformation

Coupled transformations occur in software evolution when multiple artifacts must be modified in such a way that they remain consistent with each other. An important example involves the coupled transformation of a data type, its instances, and the programs that consume or produce it. Previously, we have provided a formal treatment of transformation of the first two: data types and instances. The treatment involved the construction of type-safe, type-changing strategic rewrite systems. In this paper, we extend our treatment to the transformation of corresponding data processing programs.The key insight underlying the extension is that both data migration functions and data processors can be represented type-safely by a generalized abstract data type (GADT). These representations are then subjected to program calculation rules, harnessed in type-safe, type-preserving strategic rewrite systems. For ease of calculation, we use point-free representations and corresponding calculation rules.Thus, coupled transformations are carried out in two steps. First, a type-changing rewrite system is applied to a source type to obtain a target type together with (representations of) migration functions between source and target. Then, a type-preserving rewrite system is applied to the composition of a migration function and a data processor on the source (or target) type to obtain a data processor on the target (or source) type. All rewrites are type-safe.     

Intensive combined modality therapy including low-dose TBI in high-risk Ewing's Sarcoma Patients

Twenty-four high-risk Ewing's sarcoma patients were treatedf on an intensive combined modality protocol including low-dose fractionated total body irradiation (TBI) and autologous bone marrow infusion (ABMI). Twenty patients (83%) achieved a complete clinical response to the primary and/or metastatic sites following induction therapy. The median disease-free interval was 18 months, and nine patients remain disease-free with a follow-up of 22 to 72 months. Local failure as a manifestation of initial relapse occurred in only three patients (15%), each having synchronous distant failure. Eight patients failed initially with only distant metastases, usually within 1-2 years following a complete clinical response. Two patients with a single metastasis were again rendered disease-free and remain free from second relapse with 18 and 30 months follow-up. No other relapsed patient was able to be rendered disease-free, and most died of progressive disease within 6 to 12 months of relapse. Two patterns of granulocyte recovery following consolidative therapy (include TBI) and ABMI were recognized. Seventeen patients reached a total granulocyte count of >500 cells/mm3 within 4 weeks of ABMI (early graulocyte recovery), while seven patients required >4 weeks from ABMI (late granulocyte recovery). The time of platelet recovery (>50,000/mm3) was different for the groups with early and late granulocyte recovery (25 days vs. 54 days, p <.001). Six of seven patients with late granulocyte recovery received locl high-dose irratiation to >1/2 pelvis prior to bone marrow storage. Patients with late recovery did not tolerate maintenance chemotherapy. However, there was no difference in disease-free and overall survival, when compaing the groups with early and late granulocyte recovery. We conclude that these high-risk Ewing's sarcoma patients remain a poor-prognosis group in spite of intensive combined modality therapy include low-dose TBI. The control of microscopic systemic disease remains the major challenge to improving the cure rate. A new combined modality protocol with high-dose 'therapeutic' TBI (800 rad/2 fractions) is being used and the protocol design is outlined.     

Model checking rational agents

Agent-oriented programming techniques seem appropriate for developing systems that operate in complex, dynamic, and unpredictable environments. We aim to address this requirement by developing model-checking techniques for the (automatic or semiautomatic) verification of rational-agent systems written in a logic-based agent-oriented programming language. Typically, developers apply model-checking techniques to abstract models of a system rather than the system implementation. Although this is important for detecting design errors at an early stage, developers might still introduce errors during coding. In contrast, developers can directly apply our model-checking techniques to systems implemented in an agent-oriented programming language, automatically verifying agent systems without the usual gap between design and implementation. We developed our techniques for AgentSpeak, a rational-agent programming language based on the AgentSpeak (L) abstract agent-oriented programming language. AgentSpeak shares many features of the agent-oriented programming paradigm. Similarly, we've developed techniques for automatically translating AgentSpeak programs into the model specification language of existing model-checking systems. In this way, we reduce the problem of verifying that an AgentSpeak system has certain BDI logic properties to a conventional LTL model-checking problem.     

Distributed associative memory for use in scene analysis

A distributed associative memory system which is ideal for scene analysis is described. Recall of associated patterns using incomplete originals is made possible by the use of a distributed storage mechanism and a novel recall procedure. The memory is shown to store associations between patterns more efficiently than a conventional file store. The paper describes the memory structure, the recall process and its storage abilities, as well as an example of its implementation in hardware.