A practical application of sharing and freeness inference

Abstract is not available

A practical approach to the global analysis of CLP programs

This paper presents and illustrates with an example a practical approach to the dataflow analysis of programs written in constraint logic programming (CLP) languages using abstract interpretation. It is first argued that, from the framework point of view, it sufnces to propose relatively simple extensions of traditional analysis methods which have already been proved useful and practical and for which efncient fixpoint algorithms have been developed. This is shown by proposing a simple but quite general extensión of Bruynooghe's traditional framework to the analysis of CLP programs. In this extensión constraints are viewed not as "suspended goals" but rather as new information in the store, following the traditional view of CLP. Using this approach, and as an example of its use, a complete, constraint system independent, abstract analysis is presented for approximating definiteness information. The analysis is in fact of quite general applicability. It has been implemented and used in the analysis of CLP(R) and Prolog-III applications. Results from the implementation of this analysis are also presented

Analyzing logic programs with dynamic scheduling

Traditional logic programming languages, such as Prolog, use a fixed left-to-right atom scheduling rule. Recent logic programming languages, however, usually provide more flexible scheduling in which computation generally proceeds leftto- right but in which some calis are dynamically "delayed" until their arguments are sufRciently instantiated to allow the cali to run efficiently. Such dynamic scheduling has a significant cost. We give a framework for the global analysis of logic programming languages with dynamic scheduling and show that program analysis based on this framework supports optimizations which remove much of the overhead of dynamic scheduling

Independence in constraint logic programs

Studying independence of literals, variables, and substitutions has proven very useful in the context of logic programming (LP). Here we study independence in the broader context of constraint logic programming (CLP). We show that a naive extrapolation of the LP definitions of independence to CLP is unsatisfactory (in fact, wrong) for two reasons. First, because interaction between variables through constraints is more complex than in the case of logic programming. Second, in order to ensure the efUciency of several optimizations not only must independence of the search space be considered, but also an orthogonal issue - "independence of constraint solving." We clarify these issues by proposing various types of search independence and constraint solver independence, and show how they can be combined to allow different independence-related optimizations, from parallelism to intelligent backtracking. Sufficient conditions for independence which can be evaluated "a-priori" at run-time are also proposed. Our results suggest that independence, provided a suitable definition is chosen, is even more useful in CLP than in LP

Bosonic and fermionic Weinberg-Joos (j,0)+ (0,j) states of arbitrary spins as Lorentz-tensors or tensor-spinors and second order theory

We propose a general method for the description of arbitrary single spin-j states transforming according to (j,0)+(0,j) carrier spaces of the Lorentz algebra in terms of Lorentz-tensors for bosons, and tensor-spinors for fermions, and by means of second order Lagrangians. The method allows to avoid the cumbersome matrix calculus and higher \partial^{2j} order wave equations inherent to the Weinberg-Joos approach. We start with reducible Lorentz-tensor (tensor-spinor) representation spaces hosting one sole (j,0)+(0,j) irreducible sector and design there a representation reduction algorithm based on one of the Casimir invariants of the Lorentz algebra. This algorithm allows us to separate neatly the pure spin-j sector of interest from the rest, while preserving the separate Lorentz- and Dirac indexes. However, the Lorentz invariants are momentum independent and do not provide wave equations. Genuine wave equations are obtained by conditioning the Lorentz-tensors under consideration to satisfy the Klein-Gordon equation. In so doing, one always ends up with wave equations and associated Lagrangians that are second order in the momenta. Specifically, a spin-3/2 particle transforming as (3/2,0)+ (0,3/2) is comfortably described by a second order Lagrangian in the basis of the totally antisymmetric Lorentz tensor-spinor of second rank, \Psi_[ \mu\nu]. Moreover, the particle is shown to propagate causally within an electromagnetic background. In our study of (3/2,0)+(0,3/2) as part of \Psi_[\mu\nu] we reproduce the electromagnetic multipole moments known from the Weinberg-Joos theory. We also find a Compton differential cross section that satisfies unitarity in forward direction. The suggested tensor calculus presents itself very computer friendly with respect to the symbolic software FeynCalc.Comment: LaTex 34 pages, 1 table, 8 figures. arXiv admin note: text overlap with arXiv:1312.581

Case Report on Primary Intratesticular Leiomyosarcoma of the Spermatic Cord

No Abstrac

The CIAO multiparadigm compiler and system: A progress report

Abstract is not available

HIV infection and domestic smoke exposure, but not human papillomavirus, are risk factors for esophageal squamous cell carcinoma in Zambia: a case-control study

(c) 2015 The Authors. Cancer Medicine published by John Wiley & Sons Ltd. This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited