Generalized semantics and abstract interpretation for constraint logic programs

Giacobazzi, Roberto; Debray, Saumya; Levi, Giorgio

doi:10.1016/0743-1066(95)00038-0

Cited by 51 publications

(47 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Following standard lines in (Giacobazzi et al 1995;Falaschi et al 1997a;Zaffanella et al 1997) we impose the following restrictions over α relating the cylindrification, diagonal and lub operators of C and A.…”

Section: Definition 11 (Descriptions)mentioning

confidence: 99%

See 1 more Smart Citation

Abstract interpretation of temporal concurrent constraint programs

Falaschi¹,

Olarte²,

Palamidessi³

2014

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

Timed Concurrent Constraint Programming (tcc) is a declarative model for concurrency offering a logic for specifying reactive systems, i.e. systems that continuously interact with the environment. The universal tcc formalism (utcc) is an extension of tcc with the ability to express mobility. Here mobility is understood as communication of private names as typically done for mobile systems and security protocols. In this paper we consider the denotational semantics for tcc, and we extend it to a "collecting" semantics for utcc based on closure operators over sequences of constraints. Relying on this semantics, we formalize a general framework for data flow analyses of tcc and utcc programs by abstract interpretation techniques. The concrete and abstract semantics we propose are compositional, thus allowing us to reduce the complexity of data flow analyses. We show that our method is sound and parametric with respect to the abstract domain. Thus, different analyses can be performed by instantiating the framework. We illustrate how it is possible to reuse abstract domains previously defined for logic programming to perform, for instance, a groundness analysis for tcc programs. We show the applicability of this analysis in the context of reactive systems. Furthermore, we make also use of the abstract semantics to exhibit a secrecy flaw in a security protocol. We also show how it is possible to make an analysis which may show that tcc programs are suspension free. This can be useful for several purposes, such as for optimizing compilation or for debugging.

show abstract

Section: Definition 11 (Descriptions)mentioning

confidence: 99%

“…Furthermore, following (Giacobazzi et al 1995), we extend the use of d xy to consider terms as in d xt . More precisely,…”

Section: Notation 1 (Sequences Of Constraints)mentioning

confidence: 99%

Abstract interpretation of temporal concurrent constraint programs

Falaschi¹,

Olarte²,

Palamidessi³

2014

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

show abstract

“…In [18] entailment closed 1 properties are considered. The main result is that it is impossible to develop a meaningful generalized semantics for CC languages in the style of [9], namely the only way to correctly abstract ask constraints in a domain independent fashion is a trivial approximation.…”

Section: Program Properties and Approximationsmentioning

confidence: 99%

Domain independent ask approximation in CCP

Zaffanella

1995

Principles and Practice of Constraint Programming — CP '95

View full text Add to dashboard Cite

The main difficulty in the definition of a static analysis framework for CC programs is probably related to the correct approximation of the entailment relation between constraints. This approximation is needed for the abstract evaluation of the ask guards and directly influences the overall precision of the analysis. In this paper we provide a solution to this problem by stating reasonable correctness conditions relating the abstract and the concrete domains of computation. The solution is domain independent in the sense that it can be applied to the class of downward closed observations. Properties falling in this class (e.g. freeness) have already been studied in the context of the analysis of sequential logic programs. We believe that the same abstract domains can be usefully applied to the CC context to provide meaningful ask approximations.

show abstract

“…Quantitative precision measures are difficult for determinacy inference because the number of predicates that the programmer intended to be determinate is, in general, unknown. To demonstrate the precision ) appears to be determinate and we conjecture that this can be inferred by replacing the groundness analysis used in the above experiments with a rigidity analysis [9] that is sensitive to the particular structure of the trees that arise in serialize.…”

Section: Experimental Evaluationmentioning

confidence: 99%

Determinacy Inference for Logic Programs

King

2005

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. This paper presents a determinacy inference analysis for logic programs. The analysis infers determinacy conditions that, if satisfied by a call, ensures that it computes at most one answer and that answer is generated only once. The principal component of the technique is a goalindependent analysis of individual clauses. This derives a condition for a call that ensures only one clause in the matching predicate possesses a successful derivation. Another key component of the analysis is backwards reasoning stage that strengthens these conditions to derive properties on a call that assure determinacy. The analysis has applications in program development, implementation and specialisation.

show abstract

Generalized semantics and abstract interpretation for constraint logic programs

Cited by 51 publications

References 22 publications

Abstract interpretation of temporal concurrent constraint programs

Abstract interpretation of temporal concurrent constraint programs

Domain independent ask approximation in CCP

Determinacy Inference for Logic Programs

Contact Info

Product

Resources

About