61,065 research outputs found

    Facilitating modular property-preserving extensions of programming languages

    Get PDF
    We will explore an approach to modular programming language descriptions and extensions in a denotational style. Based on a language core, language features are added stepwise on the core. Language features can be described separated from each other in a self-contained, orthogonal way. We present an extension semantics framework consisting of mechanisms to adapt semantics of a basic language to new structural requirements in an extended language preserving the behaviour of programs of the basic language. Common templates of extension are provided. These can be collected in extension libraries accessible to and extendible by language designers. Mechanisms to extend these libraries are provided. A notation for describing language features embedding these semantics extensions is presented

    Modular Composition of Language Features through Extensions of Semantic Language Models

    Get PDF
    Today, programming or specification languages are often extended in order to customize them for a particular application domain or to refine the language definition. The extension of a semantic model is often at the centre of such an extension. We will present a framework for linking basic and extended models. The example which we are going to use is the RSL concurrency model. The RAISE specification language RSL is a formal wide-spectrum specification language which integrates different features, such as state-basedness, concurrency and modules. The concurrency features of RSL are based on a refinement of a classical denotational model for process algebras. A modification was necessary to integrate state-based features into the basic model in order to meet requirements in the design of RSL. We will investigate this integration, formalising the relationship between the basic model and the adapted version in a rigorous way. The result will be a modular composition of the basic process model and new language features, such as state-based features or input/output. We will show general mechanisms for integration of new features into a language by extending language models in a structured, modular way. In particular, we will concentrate on the preservation of properties of the basic model in these extensions

    A generic framework for context-sensitive analysis of modular programs

    Get PDF
    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

    Semantic-driven matchmaking of web services using case-based reasoning

    Get PDF
    With the rapid proliferation of Web services as the medium of choice to securely publish application services beyond the firewall, the importance of accurate, yet flexible matchmaking of similar services gains importance both for the human user and for dynamic composition engines. In this paper, we present a novel approach that utilizes the case based reasoning methodology for modelling dynamic Web service discovery and matchmaking. Our framework considers Web services execution experiences in the decision making process and is highly adaptable to the service requester constraints. The framework also utilises OWL semantic descriptions extensively for implementing both the components of the CBR engine and the matchmaking profile of the Web services

    Heterotic/Type II Triality and Instantons on K3K_3

    Get PDF
    A detailed understanding of instanton effects for half-BPS couplings is pursued in theories with 16 supersymmetries. In particular, we investigate the duality between heterotic string on T4T^4 and type IIA on K3K_3 at the T4/Z2T^4/Z_2 orbifold point, as well as their higher and lower dimensional versions. We present a remarkably clean quantitative test of the duality at the level of F4F^4 couplings, by completely matching a purely one-loop heterotic amplitude to a purely tree-level type II result. The triality of SO(4,4) and several other miracles are shown to be crucial for the duality to hold. Exact non-perturbative new results for type I', F on K3K_3, M on K3K_3, and IIB on K3K_3 are found, and the general form of D-instanton contributions in type IIA or B on T4/Z2T^4/Z_2 is obtained. We also analyze the NS5-brane contributions in type II on K3ƗT2K_3\times T^2, and predict the value Ī¼(N)=āˆ‘dāˆ£N(1/d3)\mu (N)=\sum_{d|N} (1/d^3) for the bulk contribution to the index of the NS5-brane world-volume theory on K3ƗT2K_3 \times T^2.Comment: 52 pages, uses JHEP.cls; v2: minor corrections and 2 refs added. Final version for JHE
    • ā€¦
    corecore