Modular Localization and the Bootstrap-Formfactor Program

We extend the ''modular localization'' principle from free to interacting theories and test its power for the special class of d=1+1 factorizing models.Comment: 27 pages of Late

A generic framework for context-sensitive analysis of modular programs

Context-sensitive analysis provides information which is potentially more accurate than that provided by context-free analysis. Such information can then be applied in order to validate/debug the program and/or to specialize the program obtaining important improvements. Unfortunately, context-sensitive analysis of modular programs poses important theoretical and practical problems. One solution, used in several proposals, is to resort to context-free analysis. Other proposals do address context-sensitive analysis, but are only applicable when the description domain used satisfies rather restrictive properties. In this paper, we argüe that a general framework for context-sensitive analysis of modular programs, Le., one that allows using all the domains which have proved useful in practice in the non-modular setting, is indeed feasible and very useful. Driven by our experience in the design and implementation of analysis and specialization techniques in the context of CiaoPP, the Ciao system preprocessor, in this paper we discuss a number of design goals for context-sensitive analysis of modular programs as well as the problems which arise in trying to meet these goals. We also provide a high-level description of a framework for analysis of modular programs which does substantially meet these objectives. This framework is generic in that it can be instantiated in different ways in order to adapt to different contexts. Finally, the behavior of the different instantiations w.r.t. the design goals that motivate our work is also discussed

M.S.L.A.P. Modular Spectral Line Analysis Program documentation

MSLAP is a software for analyzing spectra, providing the basic structure to identify spectral features, to make quantitative measurements of this features, and to store the measurements for convenient access. MSLAP can be used to measure not only the zeroth moment (equivalent width) of a profile, but also the first and second moments. Optical depths and the corresponding column densities across the profile can be measured as well for sufficiently high resolution data. The software was developed for an interactive, graphical analysis where the computer carries most of the computational and data organizational burden and the investigator is responsible only for all judgement decisions. It employs sophisticated statistical techniques for determining the best polynomial fit to the continuum and for calculating the uncertainties

Structural Analysis and Matrix Interpretive System /SAMIS/

SAMIS digital computer program simplifies automated structural analysis and eliminates reprogramming for problem changes. Program objectives are achieved by standardizing, by providing a modular program, and by programming for intermediate-size problems

On some modular contractions of the moduli space of stable pointed curves

The aim of this paper is to study some modular contractions of the moduli space of stable pointed curves. These new moduli spaces, which are modular compactifications of the moduli space of smooth pointed curves, are related with the minimal model program for the moduli space of stable pointed curves and have been introduced in a previous work of the authors. We interpret them as log canonical models of adjoints divisors and we then describe the Shokurov decomposition of a region of boundary divisors on the moduli space of stable pointed curves.Comment: 30 pages, 1 figure. To appear on Algebra and Number Theor

A Denotational Semantics for SPARC TSO

The SPARC TSO weak memory model is defined axiomatically, with a non-compositional formulation that makes modular reasoning about programs difficult. Our denotational approach uses pomsets to provide a compositional semantics capturing exactly the behaviours permitted by SPARC TSO. It uses buffered states and an inductive definition of execution to assign an input-output meaning to pomsets. We show that our denotational account is sound and complete relative to the axiomatic account, that is, that it captures exactly the behaviours permitted by the axiomatic account. Our compositional approach facilitates the study of SPARC TSO and supports modular analysis of program behaviour

On classification of modular categories by rank

The feasibility of a classification-by-rank program for modular categories follows from the Rank-Finiteness Theorem. We develop arithmetic, representation theoretic and algebraic methods for classifying modular categories by rank. As an application, we determine all possible fusion rules for all rank=$5$ modular categories and describe the corresponding monoidal equivalence classes.Comment: arXiv admin note: substantial text overlap with arXiv:1310.705