Search

Your search keyword '"Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group)"' showing total 11 results
Start Over Author "Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group)" Topic theoretical computer science
11 results on '"Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group)"'

1. The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy - Essays Dedicated to Catuscia Palamidessi on the Occasion of Her 60th Birthday

Author

Mário S. Alvim, Frank D. Valencia, Carlos Olarte, Konstantinos Chatzikokolakis, Computer Science Department [Belo Horizonte] (DCC), Universidade Federal de Minas Gerais, Concurrency, Mobility and Transactions (COMETE), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), National and Kapodistrian University of Athens (NKUA), Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group), Pontificia Universidad Javeriana (PUJ), Universidade Federal do Rio Grande do Norte [Natal] (UFRN), Mário S. Alvim, Konstantinos Chatzikokolakis, Carlos Olarte, Frank Valencia, Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
Theoretical computer science, Unification, Logic Programming, Computer science, Semantics (computer science), Concurrency Theory, Concurrency, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Epistemic modal logic, Computer Science::Logic in Computer Science, 0202 electrical engineering, electronic engineering, information engineering, Constraint programming, Logic programming, Bisimulation, Probabilistic logic, 020207 software engineering, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, 010201 computation theory & mathematics, Privacy, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, Security, Computer Science::Programming Languages, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
Abstract

Concurrency -- Variations of the Itai-Rodeh Algorithm for Computing Anonymous Ring Size -- Axiomatizing Team Equivalence for Finite-State Machines -- Asynchronous pi-calculus at work: the call-by-need strategy -- Deadlock Analysis of Wait-Notify Coordination -- Enhancing reaction systems: a process algebraic approach -- Checking the Expressivity of Firewall Languages -- Polymorphic Session Processes as Morphisms -- Guess Who's Coming: Runtime Inclusion of Participants in Choreographies -- A Complete Axiomatizion of Branching Bisimulation for a Simple Process Language with Probabilistic Choice -- Walking Through the Semantics of Exclusive and Event-Based Gateways in BPMN Choreographies -- Stronger Validity Criteria for Encoding Synchrony -- Confluence of the Chinese Monoid -- Logic and Constraint Programming -- A coalgebraic approach to unification semantics of logic programming -- Polyadic Soft Constraints -- Security and Privacy -- Core-concavity, Gain Functions and Axioms for Information Leakage -- Formalisation of Probabilistic Testing Semantics in Coq -- Fully Syntactic Uniform Continuity Formats for Bisimulation Metrics -- Fooling the Parallel Or Tester with Probability 8/27 -- Categorical information flow -- Statistical Epistemic Logic -- Approximate model counting, sparse XOR constraints and minimum distance -- Verification and Control of Turn-Based Probabilistic Real-Time Games -- Refinement Metrics for Quantitative Information Flow -- Models and Puzzles -- Toward a Formal Model for Group Polarization in Social Networks -- Make Puzzles Great Again.

Published
2019

2. Semantic Structures for Spatially-Distributed Multi-Agent Systems

Author

Frank D. Valencia, Concurrency, Mobility and Transactions (COMETE), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group), Pontificia Universidad Javeriana (PUJ), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Theoretical computer science, Computer science, Process calculus, 0102 computer and information sciences, 02 engineering and technology, Semantics, 01 natural sciences, lcsh:QA75.5-76.95, F.4.3, D.3.2, Computer Science::Logic in Computer Science, 0202 electrical engineering, electronic engineering, information engineering, Computer Science - Multiagent Systems, Group (mathematics), Multi-agent system, lcsh:Mathematics, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 020207 software engineering, lcsh:QA1-939, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, Logic in Computer Science (cs.LO), Computer Science::Other, Constraint (information theory), Modal, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Computer Science - Distributed, Parallel, and Cluster Computing, 010201 computation theory & mathematics, [INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA], Computer Science::Programming Languages, lcsh:Electronic computers. Computer science, Distributed, Parallel, and Cluster Computing (cs.DC), [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Multiagent Systems (cs.MA)
Abstract

Spatial constraint systems (scs) are semantic structures for reasoning about spatial and epistemic information in concurrent systems. They have been used to reason about beliefs, lies, and group epistemic behaviour inspired by social networks. They have also been used for proving new results about modal logics and giving semantics to process calculi. In this paper we will discuss the theory and main results about scs., In Proceedings EXPRESS/SOS 2019, arXiv:1908.08213. This is an invited contribution to EXPRESS/SOS 2019 based on my invited talk

Published
2019

3. Models and emerging trends of concurrent constraint programming

Author

Camilo Rueda, Frank D. Valencia, Carlos Olarte, Departamento de Electrónica, Pontificia Universidad Javeriana, Pontificia Universidad Javeriana (PUJ), Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group), Concurrency, Mobility and Transactions (COMETE), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), and École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)

Subjects
ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Concurrent constraint logic programming, Theoretical computer science, Computer science, Concurrency, Distributed computing, Cloud computing, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Artificial Intelligence, 0202 electrical engineering, electronic engineering, information engineering, Constraint programming, Discrete Mathematics and Combinatorics, Reactive system, [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC], business.industry, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], Constraint satisfaction, Variety (cybernetics), Concurrent object-oriented programming, Computational Theory and Mathematics, 010201 computation theory & mathematics, 020201 artificial intelligence & image processing, Concurrent Constraint Programming, business, Software
Abstract

International audience; 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, net- centric computing and the advent of social networks and cloud computing. In this paper we survey the main applications, developments and current trends of CCP.

Published
2013

4. An Algebraic View of Space/Belief and Extrusion/Utterance for Concurrency/Epistemic Logic

Author

Stefan Haar, Salim Perchy, Camilo Rueda, Frank D. Valencia, Modeling and Exploitation of Interaction and Concurrency (MEXICO), Laboratoire Spécification et Vérification [Cachan] (LSV), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS), Concurrency, Mobility and Transactions (COMETE), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Pontificia universidad Javeriana, Cali, Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group), Pontificia Universidad Javeriana (PUJ), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Elvira Albert, Moreno Falaschi, ANR-12-IS02-0001,PACE,Processus non-standard: Analyse, Coinduction, Expressivité(2012), ANR-11-LABX-0045,DIGICOSME,Mondes numériques: Données, programmes et architectures distribués(2011), ANR-11-IDEX-0003,IPS,Idex Paris-Saclay(2011), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, and École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)

Subjects
Theoretical computer science, Computer science, Process (engineering), Concurrency, Space, Space (commercial competition), [INFO.INFO-SI]Computer Science [cs]/Social and Information Networks [cs.SI], Epistemic modal logic, [MATH.MATH-GN]Mathematics [math]/General Topology [math.GN], Point (geometry), Mobility, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.3: Logic and constraint programming, Lies, business.industry, Extrusion, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic, 16. Peace & justice, Rotation formalisms in three dimensions, Constraint (information theory), [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], Social Networks, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.5: Modal logic, Artificial intelligence, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], business, Utterance
Abstract

International audience; We enrich spatial constraint systems with operators to specify information and processes moving from a space to another. We shall refer to these news structures as spatial constraint systems with extrusion. We shall investigate the properties of this new family of constraint systems and illustrate their applications. From a computational point of view the new operators provide for pro-cess/information extrusion, a central concept in formalisms for mobile communication. From an epistemic point of view extrusion corresponds to a notion we shall call utterance; a piece of information that an agent communicates to others but that may be inconsistent with the agent's beliefs. Utterances can then be used to express instances of epistemic notions, which are common place in social media, such as hoaxes or intentional lies. Spatial constraint systems with extrusion can be seen as complete Heyting algebras equipped with maps to account for spatial and epistemic specifications

Published
2015

5. Spatial and Epistemic Modalities in Constraint-Based Process Calculi

Author

Sophia Knight, Frank D. Valencia, Catuscia Palamidessi, Prakash Panangaden, Concurrency, Mobility and Transactions (COMETE), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group), Pontificia Universidad Javeriana (PUJ), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Maciej Koutny and Irek Ulidowski, ANR-09-BLAN-0169,PANDA(2009), European Project: 295261,EC:FP7:PEOPLE,FP7-PEOPLE-2011-IRSES,MEALS(2011), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), and École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)

Subjects
Theoretical computer science, Concurrency, Process calculus, Modal Logic, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Constraint Programming, Epistemic Logic, Epistemic modal logic, Computer Science::Logic in Computer Science, Common knowledge, 0202 electrical engineering, electronic engineering, information engineering, Cloud Storage, Spatial analysis, Mathematics, business.industry, Modal logic, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], Epistemic modality, Epistemology, Constraint (information theory), Computer Science::Multiagent Systems, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Knowledge, Social Networks, 010201 computation theory & mathematics, 020201 artificial intelligence & image processing, Artificial intelligence, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], business, F.4.1, D.1.3
Abstract

International audience; We introduce spatial and epistemic process calculi for reasoning about spatial information and knowledge distributed among the agents of a system. We introduce domain-theoretical structures to represent spatial and epistemic information. We provide operational and denotational techniques for reasoning about the potentially infinite behaviour of spatial and epistemic processes. We also give compact representations of infinite objects that can be used by processes to simulate announcements of common knowledge and global information

Published
2012

6. Reducing Weak to Strong Bisimilarity in CCP

Author

Andrés Aristizábal, Frank D. Valencia, Luis Pino, Filippo Bonchi, Concurrency, Mobility and Transactions (COMETE), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS), Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group), Pontificia Universidad Javeriana (PUJ), DGA, Marco Carbone, Ivan Lanese, Alexandra Silva, Ana Sokolova, ANR-09-BLAN-0169,PANDA(2009), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), and École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL)

Subjects
FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Theoretical computer science, Computer science, Concurrency, F.4, Bisimiliarity, 02 engineering and technology, lcsh:QA75.5-76.95, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], 0202 electrical engineering, electronic engineering, information engineering, Constraint programming, Equivalence (formal languages), Equivalence (measure theory), Computer Science - Programming Languages, lcsh:Mathematics, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 020207 software engineering, Observable, lcsh:QA1-939, Logic in Computer Science (cs.LO), Partition refinement, 020201 artificial intelligence & image processing, lcsh:Electronic computers. Computer science, Concurrent Constraint Programming, Algorithm, Software, Programming Languages (cs.PL)
Abstract

Concurrent constraint programming (ccp) is a well-established 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 well-behaved 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 above-mentioned 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., In Proceedings ICE 2012, arXiv:1212.3458. arXiv admin note: text overlap with arXiv:1212.1548

Published
2012

7. Partition Refinement for Bisimilarity in CCP

Author

Andrés Aristizábal, Frank D. Valencia, Luis Pino, Filippo Bonchi, Concurrency, Mobility and Transactions (COMETE), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS), Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group), Pontificia Universidad Javeriana (PUJ), ANR-09-BLAN-0169,PANDA(2009), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), and École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL)

Subjects
FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Theoretical computer science, Computer science, Concurrency, 02 engineering and technology, Partition Refinement, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], 0202 electrical engineering, electronic engineering, information engineering, Constraint programming, Equivalence (formal languages), Equivalence (measure theory), F.4.3, D.3.2, ComputingMilieux_THECOMPUTINGPROFESSION, bisimilarity, concurrent constraint programming, partition refinement, Software, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 020207 software engineering, Logic in Computer Science (cs.LO), Formalism (philosophy of mathematics), Bisimilarity, Partition refinement, TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, 020201 artificial intelligence & image processing, Concurrent Constraint Programming, Algorithm
Abstract

Saraswat's concurrent constraint programming (ccp) is a mature formalism for modeling processes (or programs) that interact by telling and asking constraints in a global medium, called the store. Bisimilarity is a standard behavioural equivalence in concurrency theory, but a well-behaved notion of bisimilarity for ccp has been proposed only recently. When the state space of a system is finite, the ordinary notion of bisimilarity can be computed via the well-known partition refinement algorithm, but unfortunately, this algorithm does not work for ccp bisimilarity. In this paper, we propose a variation of the partition refinement algorithm for verifying ccp bisimilarity. To the best of our knowledge this is the first work providing for the automatic verification of program equivalence for ccp, 27th ACM Symposium On Applied Computing, Trento : Italy (2012)

Published
2012

8. Deriving Labels and Bisimilarity for Concurrent Constraint Programming

Author

Catuscia Palamidessi, Frank D. Valencia, Filippo Bonchi, Luis Fernando Pino, Andrés Aristizábal, Concurrency, Mobility and Transactions (COMETE), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group), Pontificia Universidad Javeriana (PUJ), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS), Martin Hofmann, Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), and Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)

Subjects
Computer science, Concurrency, Process calculus, Theoretical Computer Science, Computer Science (all), 0102 computer and information sciences, 02 engineering and technology, computer.software_genre, 01 natural sciences, Standard definition, 0202 electrical engineering, electronic engineering, information engineering, Constraint programming, Observational equivalence, Equivalence (formal languages), F.4.3, D.3.2, ComputingMilieux_THECOMPUTINGPROFESSION, Programming language, 020207 software engineering, Process Calculi, Bisimilarity, 010201 computation theory & mathematics, Labelled Semantics, TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, Concurrent Constraint Programming, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], computer
Abstract

International audience; Concurrent constraint programming (ccp) is a well-established model for concurrency that builds upon operational and algebraic notions from process calculi and first-order logic. Bisimilarity is one of the central reasoning techniques in concurrency. The standard definition of bisimilarity, however, is not completely satisfactory for ccp since it yields an equivalence that is too fine grained. By building upon recent foundational investigations, we introduce a labelled transition semantics and a novel notion of bisimilarity that is fully abstract w.r.t. the typical observational equivalence in ccp. This way we provide ccp with a new proof technique for ccp coherent with existing ones

Published
2011

9. Compositional modelling of signalling pathways in timed concurrent constraint programming

Author

Catuscia Palamidessi, Moreno Falaschi, Davide Chiarugi, Carlos Olarte, Department of Mathematics and Computer Science / Dipartimento di Scienze Matematiche e Informatiche 'Roberto Magari' (DSMI), Università degli Studi di Siena = University of Siena (UNISI), Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group), Pontificia Universidad Javeriana (PUJ), Concurrency, Mobility and Transactions (COMETE), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
0303 health sciences, Biological data, Molecular interactions, Theoretical computer science, Computer science, Small number, 0102 computer and information sciences, [SDV.BIBS]Life Sciences [q-bio]/Quantitative Methods [q-bio.QM], 01 natural sciences, Set (abstract data type), Constraint (information theory), 03 medical and health sciences, Order (biology), 010201 computation theory & mathematics, Constraint programming, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], Signalling pathways, 030304 developmental biology
Abstract

International audience; The biological data regarding the signalling pathways often consider single pathways or a small number of them. We propose a methodology for composing this kind of data in a coherent framework, in order to be able to investigate a bigger number of signalling pathways. We specify a biological system by means of a set of stoichiometric-like equations resembling the essential features of molecular interactions. We represent these equations by a timed concurrent constraint (ntcc) language, which can deal with partial information and the time for a reaction to occur. We describe a freely available prototypical implementation of our framework.

Published
2010

10. Concurrent and Reactive Constraint Programming

Author

Frank D. Valencia, Maurizio Gabbrielli, Catuscia Palamidessi, AGOSTINO DOVIER, ENRICO PONTELLI, M.Gabbrielli, C.Palamidessi, F. D. Valencia, Dipartimento di Scienze dell'Informazione [Bologna] (DISI), Alma Mater Studiorum Università di Bologna [Bologna] (UNIBO), Foundations of Component-based Ubiquitous Systems (FOCUS), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Dipartimento di Informatica - Scienza e Ingegneria [Bologna] (DISI), Alma Mater Studiorum Università di Bologna [Bologna] (UNIBO)-Alma Mater Studiorum Università di Bologna [Bologna] (UNIBO), Concurrency, Mobility and Transactions (COMETE), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group), Pontificia Universidad Javeriana (PUJ), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Agostino Dovier and Enrico Pontelli, École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), and École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)

Subjects
Concurrent constraint logic programming, Theoretical computer science, Computer science, Functional logic programming, Programming language, Concurrency Theory, 020207 software engineering, 0102 computer and information sciences, 02 engineering and technology, Constraint satisfaction, computer.software_genre, 01 natural sciences, Process Calculi, Concurrent object-oriented programming, 010201 computation theory & mathematics, Constraint logic programming, 0202 electrical engineering, electronic engineering, information engineering, Constraint programming, Reactive programming, D.3.2, F.4.3, Concurrent Constraint Programming, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], computer, Logic programming
Abstract

The Italian Logic Programming community has given several contributions to the theory of Concurrent Constraint Programming. In particular, in the topics of semantics, verification, and timed extensions. In this paper we review the main lines of research and contributions of the community in this field.

Published
2010

11. Declarative diagnosis of temporal concurrent constraint programs

Author

Catuscia Palamidessi, Frank D. Valencia, Carlos Olarte, Moreno Falaschi, Department of Mathematics and Computer Science / Dipartimento di Scienze Matematiche e Informatiche 'Roberto Magari' (DSMI), Università degli Studi di Siena = University of Siena (UNISI), Concurrency, Mobility and Transactions (COMETE), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Ambientes VISuales de Progamación Aplicativa (AVISPA Resarch Group), Pontificia Universidad Javeriana (PUJ), Verónica Dahl and Ilkka Niemelä, Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
Theoretical computer science, Correctness, Computer science, Programming language, media_common.quotation_subject, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 0102 computer and information sciences, 02 engineering and technology, Abstract interpretation, computer.software_genre, 01 natural sciences, Denotational semantics of the Actor model, Nondeterministic algorithm, Algorithmic program debugging, Denotational semantics, Linear temporal logic, Debugging, 010201 computation theory & mathematics, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, computer, media_common
Abstract

International audience; We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous) immediate consequence operator, TD, which models the process behaviour associated with a program D given in terms of sequences of constraints. Then, we show that, given the intended specification of D, it is possible to check the correctness of D by a single step of TD. In order to develop an effective debugging method, we approximate the denotational semantics of D. We formalize this method by abstract interpretation techniques, and we derive a finitely terminating abstract diagnosis method, which can be used statically. We define an abstract domain which allows us to approximate the infinite sequences by a finite ‘cut'. As a further development we show how to use a specific linear temporal logic for deriving automatically the debugging sequences. Our debugging framework does not require the user to either provide error symptoms in advance or answer questions concerning program correctness. Our method is compositional, that may allow to master the complexity of the debugging methodology.

Catalog

Books, media, physical & digital resources
See catalog results