Exploració per tema "Llenguatges formals"

Ara es mostren els items 1-14 de 14

    • A polynomial-time algorithm for the Lambek calculus with brackets of bounded order 

      Kanovich, Max; Kuznetsov, Stepan; Morrill, Glyn; Scedrov, Andre (Dagstuhl Publishing, 2017)
      Text en actes de congrés
      Accés obert
      Lambek calculus is a logical foundation of categorial grammar, a linguistic paradigm of grammar as logic and parsing as deduction. Pentus (2010) gave a polynomial-time algorithm for determining provability of bounded depth ...

    • A stronger null hypothesis for crossing dependencies 

      Ferrer Cancho, Ramon (2014-12-04)
      Article
      Accés obert
      The syntactic structure of a sentence can be modeled as a tree where vertices are words and edges indicate syntactic dependencies between words. It is well known that those edges normally do not cross when drawn over the ...

    • Algebraic definition of iStar2.0 models 

      Franch Gutiérrez, Javier; López Cuesta, Lidia; Marco Gómez, Jordi (CEUR-WS.org, 2019)
      Text en actes de congrés
      Accés obert
      iStar2.0 was delivered in 2016 with the intention of becoming a standard de facto for the i* community. It includes a lightweight definition of the language adorned with a metamodel (in the form of a UML class diagram) ...

    • Automatic performance model transformation from UML to C++ 

      Pllana, Sabri; Benkner, Siegfried; Xhafa Xhafa, Fatos; Barolli, Leonard (Institute of Electrical and Electronics Engineers (IEEE), 2008)
      Text en actes de congrés
      Accés obert
      We address the issue of the development of performance models for programs that may be executed on large-scale computing systems. The commonly used approaches apply non-standard notations for model specification and often ...

    • Computational coverage of TLG: nonlinearity 

      Morrill, Glyn; Valentín Fernández Gallart, José Oriol (2015)
      Text en actes de congrés
      Accés obert
      We study nonlinear connectives (exponentials) in the context of Type Logical Grammar (TLG). We devise four conservative extensions of the displacement calculus with brackets, Db!, Db!?, Db!b and Db!b?r which contain the ...

    • Els Límits de la computació : indecidibilitat i NP-completesa 

      Serna Iglesias, María José; Álvarez Faura, M. del Carme; Cases Muñoz, Rafel; Lozano Boixadors, Antoni (Edicions UPC, 2001)
      Llibre
      Accés restringit a la comunitat UPC
      Aquest text presenta una introducció a les teories de la calculabilitat i la complexitat a l'abast d'un estudiant de primer cicle d'una enginyeria informàtica. A partir de la justificació de la necessitat d'un model formal ...

    • Formal analysis of model transformations based on triple graph grammars 

      Hermann, Frank; Ehrig, Hartmut; Golas, Ulrike; Orejas Valdés, Fernando (2014-08-01)
      Article
      Accés obert
      Triple graph grammars (TGGs) are a well-established concept for the specification and execution of bidirectional model transformations within model driven software engineering. Their main advantage is an automatic generation ...

    • Formalising ERP selection criteria 

      Burgués Illa, Xavier; Franch Gutiérrez, Javier; Pastor Collado, Juan Antonio (Institute of Electrical and Electronics Engineers (IEEE), 2000)
      Text en actes de congrés
      Accés obert
      We present a proposal for selecting enterprise resource planning (ERP) products from a formal description of their relevant characteristics. The work is based on a previous and successfull collaboration with a midsize ...

    • Funciones de complejidad y su relación con las familias abstractas de lenguajes 

      Gabarró, Joaquim (Universitat Politècnica de Catalunya, 1983-01-01)
      Tesi
      Accés obert

    • Model synchronization based on triple graph grammars: correctness, completeness and invertibility 

      Hermann, Frank; Ehrig, Hartmut; Orejas Valdés, Fernando; Czarnecki, Krzysztof; Diskin, Zinovy; Xiong, Yingfei; Gottmann, Susann; Engel, Thomas (2015-02-01)
      Article
      Accés obert
      Triple graph grammars (TGGs) have been used successfully to analyze correctness and completeness of bidirectional model transformations, but a corresponding formal approach to model synchronization has been missing. This ...

    • Putting non-functional requirements into software architecture 

      Franch Gutiérrez, Javier; Botella López, Pere (Institute of Electrical and Electronics Engineers (IEEE), 1998)
      Text en actes de congrés
      Accés obert
      This paper presents an approach for incorporating non-functional information of software system into software architectures. To do so, components present two distinguished slots: their non-functional specification, where ...

    • Reasoning about policy behavior in logic-based trust management systems: Some complexity results and an operational framework 

      Pasarella Sánchez, Ana Edelmira; Lobo, Jorge (Institute of Electrical and Electronics Engineers (IEEE), 2015)
      Text en actes de congrés
      Accés obert
      In this paper we show that the logical framework proposed by Becker et al. [1] to reason about security policy behavior in a trust management context can be captured by an operational framework that is based on the language ...

    • The HOM problem is EXPTIME-complete 

      Creus López, Carles; Gascon Caro, Adrian; Godoy Balil, Guillem; Ramos Garrido, Lander (2016)
      Article
      Accés obert
      We define a new class of tree automata with constraints and prove decidability of the emptiness problem for this class in exponential time. As a consequence, we obtain several EXPTIME-completeness results for problems on ...

    • Unification and matching on compressed terms 

      Gascón Caro, Adrià; Godoy Balil, Guillem; Schmidt-Schauß, Manfred (2011-07-29)
      Article
      Accés restringit per política de l'editorial
      Term unification plays an important role in many areas of computer science, especially in those related to logic. The universal mechanism of grammar-based compression for terms, in particular the so-called singleton tree ...