Comini, MarcoGallardo, Maria-del-MarTitolo, LauraVillanueva, Alicia2020-10-212020-10-212017-050934-5043https://riunet.upv.es/handle/10251/152716[EN] The timed concurrent constraint language (tccp) is a timed extension of the concurrent constraint paradigm. tccp was defined to model reactive systems, where infinite behaviors arise naturally. In previous works, a semantic framework and abstract diagnosis method for the language have been defined. On the basis of that semantic framework, this paper proposes an abstract semantics that, together with a widening operator, is suitable for the definition of different analyses for tccp programs. The abstract semantics is correct and can be represented as a finite graph where each node represents a hypothetical (abstract) computational step of the program. The widening operator allows us to guarantee the convergence of the abstract fixpoint computation.Reserva de todos los derechosConcurrent constraint paradigmAbstract interpretationAbstract semanticsWidening operatorsLENGUAJES Y SISTEMAS INFORMATICOSArtículo10.1007/s00165-016-0409-8Abierto