output
20032015
most citedFrom time series to complex networks: the visibility graph

1.8k citations

Showing cs.PLShow all

9 papers · 1 filter

cs.PL201213 cited

Lightweight compilation of (C)LP to JavaScript

Jose F. Morales, Rémy Haemmerlé, Manuel Carro +1

We present and evaluate a compiler from Prolog (and extensions) to JavaScript which makes it possible to use (constraint) logic programming to develop the client side of web applic…

cs.PL20124 cited

Diagrammatic confluence for Constraint Handling Rules

Rémy Haemmerlé

Confluence is a fundamental property of Constraint Handling Rules (CHR) since, as in other rewriting formalisms, it guarantees that the computations are not dependent on rule appli…

cs.PL20128 cited

Reachability-based Acyclicity Analysis by Abstract Interpretation

Samir Genaim, Damiano Zanardini

In programming languages with dynamic use of memory, such as Java, knowing that a reference variable x points to an acyclic data structure is valuable for the analysis of terminati…

cs.PL20116 cited

Observational equivalences for linear logic CC languages

Rémy Haemmerlé

Linear logic Concurrent Constraint programming (LCC) is an extension of concurrent constraint programming (CC) where the constraint system is based on Girard's linear logic instead…

cs.PL2010

Certificate size reduction in Abstraction-Carrying Code

Elvira Albert, Puri Arenas, Germán Puebla +1

Carrying Code (ACC) has recently been proposed as a framework for mobile code safety in which the code supplier provides a program together with an abstraction (or abstract model o…

cs.PL201033 cited

Test Case Generation for Object-Oriented Imperative Languages in CLP

Miguel Gómez-Zamalloa, Elvira Albert, Germán Puebla

Testing is a vital part of the software development process. Test Case Generation (TCG) is the process of automatically generating a collection of test cases which are applied to a…