Mostrar el registro sencillo del ítem
dc.contributor.author | Comini, Marco | es_ES |
dc.contributor.author | Titolo, Laura | es_ES |
dc.contributor.author | Villanueva García, Alicia | es_ES |
dc.date.accessioned | 2013-06-26T06:43:10Z | |
dc.date.available | 2013-06-26T06:43:10Z | |
dc.date.issued | 2011 | |
dc.identifier.issn | 1471-0684 | |
dc.identifier.uri | http://hdl.handle.net/10251/30115 | |
dc.description.abstract | The timed concurrent constraint language (tccp in short) is a concurrent logic language based on the simple but powerful concurrent constraint paradigm of Saraswat. In this paradigm, the notion of store-as-value is replaced by the notion of store-as-constraint, which introduces some differences w.r.t. other approaches to concurrency. In this paper, we provide a general framework for the debugging of tccp programs. To this end, we first present a new compact, bottom-up semantics for the language that is well suited for debugging and verification purposes in the context of reactive systems. We also provide an abstract semantics that allows us to effectively implement debugging algorithms based on abstract interpretation. Given a tccp program and a behavior specification, our debugging approach automatically detects whether the program satisfies the specification. This differs from other semi-automatic approaches to debugging and avoids the need to provide symptoms in advance. We show the efficacy of our approach by introducing two illustrative examples. We choose a specific abstract domain and show how we can detect that a program is erroneous. © 2011 Cambridge University Press. | es_ES |
dc.language | Inglés | es_ES |
dc.publisher | Cambridge University Press | es_ES |
dc.relation.ispartof | Theory and Practice of Logic Programming | es_ES |
dc.rights | Reserva de todos los derechos | es_ES |
dc.subject | Abstract diagnosis | es_ES |
dc.subject | Abstract interpretation | es_ES |
dc.subject | Concurrent constraint paradigm | es_ES |
dc.subject | Denotational semantics | es_ES |
dc.subject | Abstract domains | es_ES |
dc.subject | Abstract interpretations | es_ES |
dc.subject | Abstract semantics | es_ES |
dc.subject | Behavior specifications | es_ES |
dc.subject | Concurrent constraint | es_ES |
dc.subject | Concurrent logic language | es_ES |
dc.subject | Debugging algorithms | es_ES |
dc.subject | Illustrative examples | es_ES |
dc.subject | Reactive system | es_ES |
dc.subject | Semi-automatics | es_ES |
dc.subject | Abstracting | es_ES |
dc.subject | Program debugging | es_ES |
dc.subject | Semantics | es_ES |
dc.subject | Specifications | es_ES |
dc.subject | Program diagnostics | es_ES |
dc.subject.classification | LENGUAJES Y SISTEMAS INFORMATICOS | es_ES |
dc.title | Abstract diagnosis for timed concurrent constraint programs | es_ES |
dc.type | Artículo | es_ES |
dc.identifier.doi | 10.1017/S1471068411000135 | |
dc.rights.accessRights | Abierto | es_ES |
dc.contributor.affiliation | Universitat Politècnica de València. Departamento de Sistemas Informáticos y Computación - Departament de Sistemes Informàtics i Computació | es_ES |
dc.description.bibliographicCitation | Comini, M.; Titolo, L.; Villanueva García, A. (2011). Abstract diagnosis for timed concurrent constraint programs. Theory and Practice of Logic Programming. 11:487-502. doi:10.1017/S1471068411000135 | es_ES |
dc.description.accrualMethod | S | es_ES |
dc.relation.publisherversion | http://dx.doi.org/ 10.1017/S1471068411000135 | es_ES |
dc.description.upvformatpinicio | 487 | es_ES |
dc.description.upvformatpfin | 502 | es_ES |
dc.type.version | info:eu-repo/semantics/publishedVersion | es_ES |
dc.description.volume | 11 | es_ES |
dc.relation.senia | 212628 |