Zobrazeno 1 - 10
of 112
pro vyhledávání: '"Language extensions"'
Publikováno v:
Repositório Científico de Acesso Aberto de Portugal
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
info:eu-repo/grantAgreement/FCT/6817 - DCRRNI ID/UID%2FCEC%2F04516%2F2019/PT Modelling languages are frequently extended to include new constructs to be used together with the original syntax. New constructs may be proposed by adding textual informat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9d9b81f9a2ad81bba997740f6a197574
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Stefania Costantini, Andrea Formisano
Publikováno v:
Journal of Logic and Computation. 20:533-571
In this article, we propose an extension of Answer Set Programming (ASP) to support declarative reasoning on consumption and production of resources. We call the proposed extension RASP, standing for ‘Resourced ASP’. Resources are modeled by intr
Publikováno v:
Science of Computer Programming. 76:992-1014
Class inheritance and method overriding, as provided by standard class-based languages, are often not flexible enough to represent objects with some dynamic behavior. In this respect, object composition equipped with different forms of method body lo
Publikováno v:
Future generation computer systems 26 (2010): 1165–1179. doi:10.1016/j.future.2010.06.002
info:cnr-pdr/source/autori:A. Clematis, A. Corana, D. D'Agostino, A.Galizia, and A. Quarati/titolo:Job-resource matchmaking on grid through two-level benchmarking/doi:10.1016%2Fj.future.2010.06.002/rivista:Future generation computer systems/anno:2010/pagina_da:1165/pagina_a:1179/intervallo_pagine:1165–1179/volume:26
info:cnr-pdr/source/autori:A. Clematis, A. Corana, D. D'Agostino, A.Galizia, and A. Quarati/titolo:Job-resource matchmaking on grid through two-level benchmarking/doi:10.1016%2Fj.future.2010.06.002/rivista:Future generation computer systems/anno:2010/pagina_da:1165/pagina_a:1179/intervallo_pagine:1165–1179/volume:26
Grid environments must provide effective mechanisms able to select the most adequate resources satisfying application requirements. A description of applications and resources, grounded on a common and shared basis, is crucial to favour an effective
Publikováno v:
Fundamenta Informaticae. 105:1-33
In previous work we have proposed an extension to ASP (Answer Set Programming), called RASP, standing for ASP with Resources. RASP supports declarative reasoning on production and consumption of (amounts of) resources. The approach combines answer se
Publikováno v:
Electronic Notes in Theoretical Computer Science. 203(4):111-124
This paper describes an extension to Lustre to support the analysis of globally asynchronous, locally synchronous (GALS) architectures. This extension consists of constructs for directly specifying the timeout automata used to describe asynchronous c
Publikováno v:
Sampaio, S F M, Dong, C & Sampaio, P 2015, ' DQ2S-A framework for data quality-aware information management ', Expert Systems with Applications, vol. 42, no. 21, pp. 8304-8326 . https://doi.org/10.1016/j.eswa.2015.06.050
Design of a data quality-aware information management framework and system.Users measure data quality based on an extensible set of data profiling algorithms.Query language, system architecture and heuristic optimization approach developed.System des
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::73ef480aeca003abd7f7fb6c8d8fa2ca
https://pure.manchester.ac.uk/ws/files/22949514/POST-PEER-REVIEW-NON-PUBLISHERS.PDF
https://pure.manchester.ac.uk/ws/files/22949514/POST-PEER-REVIEW-NON-PUBLISHERS.PDF
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 188, Iss Proc. WWV 2015, Pp 23-32 (2015)
WWV
WWV
We study the problem of disentangling locked processes via code refactoring. We identify and characterise a class of processes that is not lock-free; then we formalise an algorithm that statically detects potential locks and propose refactoring proce
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::66dda1537926ed9ce23b8ae7ec55fd45
Kniha
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.