Results 1  10
of
12
A Compact GoalIndependent BottomUp Fixpoint Modeling of the Behaviour of First Order Curry
"... This work is motivated by the fact that a “compact ” semantics for functional logic languages, which is essential for the development of efficacious semanticsbased program manipulation tools (e.g. automatic program analyzers and debuggers), does not exist. The operational or the rewriting logic sem ..."
Abstract

Cited by 5 (5 self)
 Add to MetaCart
(Show Context)
This work is motivated by the fact that a “compact ” semantics for functional logic languages, which is essential for the development of efficacious semanticsbased program manipulation tools (e.g. automatic program analyzers and debuggers), does not exist. The operational or the rewriting logic semantics that are most commonly considered in functional logic are unnecessarily oversized, as they contains many “semantically useless ” elements that can be retrieved from a smaller set of “basic” elements. Therefore, in this article, we present a compressed, goalindependent bottomup fixpoint semantics that is correct and minimal w.r.t. answers computed for Curry expressions. We believe that the compactness of the semantics makes it particularly suitable for applications. Actually, our semantics can be finite whereas the bigstep semantics is generally not, and even when both semantics are infinite, the fixpoint computation of our semantics produces fewer
Reducing Weak to Strong Bisimilarity in CCP
 ICE
, 2012
"... Concurrent constraint programming (ccp) is a wellestablished model for concurrency that singles out the fundamental aspects of asynchronous systems whose agents (or processes) evolve by posting and querying (partial) information in a global medium. Bisimilarity is a standard behavioural equivalence ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
Concurrent constraint programming (ccp) is a wellestablished model for concurrency that singles out the fundamental aspects of asynchronous systems whose agents (or processes) evolve by posting and querying (partial) information in a global medium. Bisimilarity is a standard behavioural equivalence in concurrency theory. However, only recently a wellbehaved notion of bisimilarity for ccp, and a ccp partition refinement algorithm for deciding the strong version of this equivalence have been proposed. Weak bisimiliarity is a central behavioural equivalence in process calculi and it is obtained from the strong case by taking into account only the actions that are observable in the system. Typically, the standard partition refinement can also be used for deciding weak bisimilarity simply by using Milner’s reduction from weak to strong bisimilarity; a technique referred to as saturation. In this paper we demonstrate that, because of its involved labeled transitions, the abovementioned saturation technique does not work for ccp. We give an alternative reduction from weak ccp bisimilarity to the strong one that allows us to use the ccp partition refinement algorithm for deciding this equivalence.
Models and Emerging Trends of Concurrent Constraint Programming
, 2013
"... Concurrent Constraint Programming (CCP) has been used over the last two decades as an elegant and expressive model for concurrent systems. It models systems of agents communicating by posting and querying partial information, represented as constraints over the variables of the system. This covers a ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
(Show Context)
Concurrent Constraint Programming (CCP) has been used over the last two decades as an elegant and expressive model for concurrent systems. It models systems of agents communicating by posting and querying partial information, represented as constraints over the variables of the system. This covers a vast variety of systems as those arising in biological phenomena, reactive systems, netcentric computing and the advent of social networks and cloud computing. In this paper we survey the main applications, developments and current trends of CCP.
Efficient Computation of Program Equivalence for Confluent Concurrent Constraint Programming∗
"... Concurrent Constraint Programming (ccp) is a wellestablished declarative framework 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 auto ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Concurrent Constraint Programming (ccp) is a wellestablished declarative framework 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 verification 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 exponentialtime complexity even for programs from a representative sublanguage of ccp; the summationfree fragment (ccp{+}). We then significantly improve on the complexity of this algorithm by providing two alternative polynomialtime decision procedures for ccp{+} program equivalence. Each of these two procedures
devant le jury composé de:
, 2013
"... Je voudrais d’abord remercier chaleureusement mes directeurs de thèse Roberto et Patrick de m’avoir encadré tout au long de ces trois années de recherche et, sembletil, guidé vers une bonne fin! Je remercie Roberto pour sa présence constante et Patrick pour son soutien continu. Je voudrais égaleme ..."
Abstract
 Add to MetaCart
Je voudrais d’abord remercier chaleureusement mes directeurs de thèse Roberto et Patrick de m’avoir encadré tout au long de ces trois années de recherche et, sembletil, guidé vers une bonne fin! Je remercie Roberto pour sa présence constante et Patrick pour son soutien continu. Je voudrais également remercier Ugo Dal Lago et JeanYves Marion de s’être intéressés à mon travail depuis mes premiers exposés et d’avoir relu mon manuscrit avec minutie. Merci également à Virgile Mogbil et François Pottier d’avoir accepté de participer à mon jury. Merci à Aloïs pour sa collaboration enthousiaste et fructueuse. Pour le très agréable cadre de travail qui y règne, je remercie tous les chercheurs du laboratoire PPS. Merci à Odile de toujours être à nos petits soins. Pour le très détendu cadre de vie (et de travail) qui y règne, merci à mes cothésards du bureau 6C10, à Stéphane et ses mains pleines de fusain, à Thibaut pour son partage optimal de la science, à Fabien ou le poulet, à Jonas pour son humeur toujours oplax et à Gabriel pour son style par passagedescience. Merci également aux anciens, aux nouveaux, à ceux d’en face: Mehdi, Alexis, Guillaume, Shain, Kuba, Johanna, et tous les autres... Un merci spécial à Beniamino pour les déambulations nocturnes dans les ruelles parisiennes. Merci également à tous les aventuriers de l’Oregon (Matthias, Andrei, Clément, Aloïs) et aux musiciens geeks (Sam, David, Vincent, Damiano, Matthieu).
ProjectTeam comete Concurrency, Mobility and Transactions
, 2010
"... c t i v i t y te p o r ..."
(Show Context)
A Behavioral Congruence for Concurrent Constraint Programming with Nondeterministic Choice?
"... Abstract. Concurrent constraint programming (ccp) is a wellestablished model of concurrency for reasoning about systems of multiple agents that interact with each other by posting and querying partial information on a shared space. (Weak) bisimilarity is one of the most representative notions of be ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. Concurrent constraint programming (ccp) is a wellestablished model of concurrency for reasoning about systems of multiple agents that interact with each other by posting and querying partial information on a shared space. (Weak) bisimilarity is one of the most representative notions of behavioral equivalence for models of concurrency. A notion of weak bisimilarity, called weak saturated bisimilarity (≈̇sb), was recently proposed for ccp. This equivalence improves on previous bisimilarity notions for ccp that were too discriminating and it is a congruence for the choicefree fragment of ccp. In this paper, however, we show that ≈̇sb is not a congruence for ccp with nondeterministic choice. We then introduce a new notion of bisimilarity, called weak full bisimilarity (≈f), and show that it is a congruence for the full language of ccp. We also show the adequacy of≈f by establishing that it coincides with the congruence induced by closing ≈̇sb under all contexts. The advantage of the new definition is that, unlike the congruence induced by ≈̇sb, it does not require quantifying over infinitely many contexts. 1