Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 2
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Estudio, informe, memoria (Report)

A Condensed Goal-Independent Bottom-Up Fixpoint Semantics Modeling the Behavior of tccp

  • Comini, Marco
  • Titolo, Laura
  • Villanueva, Alicia|||0000-0003-1090-5009
In this paper, we present a new compositional bottom-up semantics for the Timed Concurrent Constraint Language (tccp in short) which is defined for the full language. In particular, is able to deal with the non- monotonic characteristic of tccp, which constitutes a substantial addi- tional technical difficulty w.r.t. other compositional denotational seman- tics present in literature (which do not tackle the full language). The semantics is proved to be (correct and) fully abstract w.r.t. the full behavior of tccp, including infinite computations. This is particularly important since tccp has been defined to model reactive systems and they may not terminate with a purpose. The overall of these features makes our proposal particularly suitable as the basis for the definition of semantic-based program manipulation tools (like analyzers, debuggers or verifiers), especially in the context of reactive systems.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Estudio, informe, memoria (Report)

Abstract Diagnosis for tccp using a Linear Temporal Logic

  • Comini, Marco
  • Titolo, Laura
  • Villanueva, Alicia|||0000-0003-1090-5009
Automatic techniques for program verification usually suffer the well-known state explosion problem. Most of the classical approaches are based on browsing the structure of some form of model (which rep- resents the behavior of the program) to check if a given specification is valid. This implies that a part of the model has to be built, and some- times the needed fragment is quite huge. In this work, we provide an alternative automatic decision method to check whether a given property, specified in a linear temporal logic, is valid w.r.t. a tccp program. Our proposal (based on abstract interpreta- tion techniques) does not require to build any model at all. Our results guarantee correctness but, as usual when using an abstract semantics, completeness is lost.