Efficient Algorithms for Program Equivalence for Confluent Concurrent Constraint Programming

Luis Fernando Pino Duque 1, 2 Filippo Bonchi 3 Frank Valencia 1, 2
2 COMETE - Concurrency, Mobility and Transactions
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France, Polytechnique - X, CNRS - Centre National de la Recherche Scientifique : UMR7161
Abstract : Concurrent Constraint Programming (CCP) is a well-established declarative frame-work from concurrency theory. Its foundations and principles e.g., semantics, proof systems, axiomatizations, have been thoroughly studied for over the last two decades. In contrast, the development of algorithms and automatic verifica-tion procedures for CCP have hitherto been far too little considered. To the best of our knowledge there is only one existing verification algorithm for the standard notion of CCP program (observational) equivalence. In this paper we first show that this verification algorithm has an exponential-time complexity even for pro-grams from a representative sub-language of CCP; the summation-free fragment (CCP\+). We then significantly improve on the complexity of this algorithm by providing two alternative polynomial-time decision procedures for CCP\+ pro-gram equivalence. Each of these two procedures has an advantage over the other. One has a better time complexity. The other can be easily adapted for the full
Type de document :
Article dans une revue
Science of Computer Programming, Elsevier, 2015, 111, pp.135-155. 〈10.1016/j.scico.2014.12.003〉
Liste complète des métadonnées

Littérature citée [31 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01098502
Contributeur : Luis Fernando Pino Duque <>
Soumis le : jeudi 25 décembre 2014 - 21:28:32
Dernière modification le : vendredi 17 février 2017 - 16:13:59
Document(s) archivé(s) le : jeudi 26 mars 2015 - 10:15:29

Fichier

SCP14-HAL.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Luis Fernando Pino Duque, Filippo Bonchi, Frank Valencia. Efficient Algorithms for Program Equivalence for Confluent Concurrent Constraint Programming. Science of Computer Programming, Elsevier, 2015, 111, pp.135-155. 〈10.1016/j.scico.2014.12.003〉. 〈hal-01098502〉

Partager

Métriques

Consultations de
la notice

219

Téléchargements du document

163