CIC Wiki grupos:avispa

grupos:avispa:31st_latinamerican_conference_on_informatics_clei_2005

2011-01-24T15:30:28-05:00

Program:

grupos:avispa:avispa

2012-03-07T11:19:56-05:00

[ The AVISPA Research Group Logo] News Presentation AVISPA aims at defining computational models that allow to understand the nature and the behavior of complex systems as the observation of the evolution and interaction of their processes. From a more practical standpoint, AVISPA seeks to verify the effectiveness of the proposed models by building applications intended to solve real problems in

grupos:avispa:ccp-wikipedia-new

2011-03-16T13:43:24-05:00

Concurrent Constraint Programming (CCP) is a process calculus where concurrent processes interact through a shared store of partial information. The store is represented by a set of constraints and it represents the current state of the system. Processes can change the state of the system by telling information to the store (i.e., adding constraints to the store). Processes can also synchronize by asking if some information (constraint) can be deduced from the current store. As an example, the…

grupos:avispa:ccp-wikipedia

2009-11-13T11:57:59-05:00

Concurrent Constraint Programming (CCP) is a process calculus originally developed by Vijay A. Saraswat as a powerful paradigm for concurrency tied to logic. CCP extends and subsumes both concurrent logic programming and constraint logic programming. A fundamental issue in CCP is the specification of concurrent systems by means of constraints. A constraint (e.g. x + y ≥ 10) represents partial information about certain variables. During the computation, the current state of the system is spec…

grupos:avispa:colloquium_tribute_to_robin_milner

2010-04-29T13:36:29-05:00

Overview Robin Milner was a great computer scientist whose research has been fundamental basis for the understanding of computational processes. He was prized with the ACM Turing Award in 1991 (one of the highest distinctions in computer science) and his major contributions include: (1) the development of the ML programming language, (2) the creation of a theoretical framework for concurrent systems called CCS, (3) an extension of CCS for mobile systems called the Pi-calculus, and (4) the compo…

grupos:avispa:colloquium_tribute_to_robin_milner_2010

2011-01-24T15:30:28-05:00

El Departamento de Ciencias e Ingeniería de la Computación y el grupo Avispa los invita al Coloquio “Tributo a Robin Milner” que se realizará el próximo Miércoles 28 de Abril de 2:00 pm a 6:00 pm en el Auditorio 4 del Samán. Robin Milner fue un gran científico de la computación cuyas investigaciones han proveído bases fundamentales para el entendimiento de procesos computacionales. Ha sido reconocido con el premio ACM Turing en 1991 (una de las mayores distinciones que se pueden recibir en cien…

grupos:avispa:crear

2011-01-24T15:30:28-05:00

CREAR See this page for information.

grupos:avispa:denotational_semantics_of_ccp

2009-11-13T11:24:34-05:00

The semantics of tcc is deﬁned as a function which associates to each process a set of infinite sequences of constraints. We use Cω to denote the set of infinite sequence of constraints in an underlying constraint system. The semantic equations are described below:

grupos:avispa:forces

2008-02-12T11:05:06-05:00

Formalisms from Concurrency for Emergent Systems: Motivation Concurrent Constraint Programming (CCP) is a mature formalism from Concurrency Theory which combines the traditional operational view of process calculi with a declarative one of processes based upon logic. Some of the members of the teams in this proposal developed and have been using NTCC [NPV02], a timed CCP calculus, to predict the behavior of several systems from emergent areas in computer science such as Security Protocols [L…

grupos:avispa:gelisp

2011-01-24T15:30:28-05:00

A portable and efficient wrapper for the Generic Constraints Development Environment (GECODE) library to Common Lisp. Provides a high level interface and a low level interface. Additionally, it provides an interface to the music environment OpenMusic. Gelisp can be found at

grupos:avispa:geoz

2011-11-03T13:12:53-05:00

The GeOz Project ---------- Objective The main goal of this project is to integrate Gecode as the Mozart constraint services provider, namely, to replace the Mozart constraint layer with Gecode and take advantage of its advanced features like batch recomputation.

grupos:avispa:geoz_profiling

2011-01-24T15:30:28-05:00

The GeOz programming aims to integrate Gecode as the constraint service provider for Mozart. Currently, there is a testing, feature complete, version of this project. However it is necessary to perform an exhaustive analysis on its design to detect possible improvements that leads to better running times or less memory usage.

grupos:avispa:here

2010-08-31T17:31:07-05:00

* 31st Latinamerican Conference on Informatics CLEI, 2005 * PUJ Colloquium in Concurrency, 2008 * 2nd FORCES Workshop in Concurrency, 2009 * Colloquium Tribute to Robin Milner, 2010

grupos:avispa:introductory_material

2011-06-23T10:20:20-05:00

This page provides a summary of readings and links that might be of interest to AVISPA members. Return to the AVISPA Website. Readings Constraint Programing, Constraint Solving * [Constraint Programming: Strategic Directions] by P. Van Hentenryck and V. Saraswat. A nicely written introduction to CP; some interesting application areas are explained. This paper appeared in the Journal Constraints. * [Constraint Programming: In Pursuit of the Holy Grail] by Roman Bartak. See also his Online …

grupos:avispa:mozart-gecode

2011-01-24T15:30:28-05:00

Mozart-Gecode is a software result of the GeOz project. It consists of a Mozart version that uses Gecode as the underlying constraint engine. Plans In the mid term we plan Mozart-Gecode to be integrated in the official release of Mozart. To achieve that there is a lot of work to do and we encourage people to get involved in this project.

grupos:avispa:mozart

2010-10-28T15:03:49-05:00

Mozart/Gecode The main goal of this project is to integrate Gecode as the Mozart constraint services provider, namely, to replace the Mozart constraint layer with Gecode and take advantage of its advanced features like batch recomputation. See this page to get more information.

grupos:avispa:mozart_and_openmp

2011-01-24T15:30:28-05:00

Nowadays dual core and quad core computers are very common. Existing software must be analyzed to realize which operations can exploit the parallelism provided by hardware and can lead to less running time computations. Mozart is a programming system that implements a concurrent language. However, it was designed without taking into account multiprocessors parallel architectures.

grupos:avispa:mozart_gecode

2011-01-24T15:30:28-05:00

Mozart The main goal of this project is to integrate Gecode as the Mozart constraint services provider, namely, to replace the Mozart constraint layer with Gecode and take advantage of its advanced features like batch recomputation. See this page to get more information.

grupos:avispa:ntccsim

2008-06-04T15:57:30-05:00

A simulation tool for timed concurrent processes developed by the AVISPA Research Group Description ntccSim is a simulation tool developed in the concurrent constraint programming (CCP) language Mozart-Oz in order to run program specifications in ntcc, a timed CCP process calculus. In brief, ntcc is a description language which allows the description of reactive systems involving discrete time, non-determinism and partial information as constraints. A complete reference to the theory and appli…

grupos:avispa:operational_semantics_of_tcc

2009-11-12T19:27:37-05:00

The following table summarizes the internal and observable transition relations for tcc. Let us describe the internal reduction rules: * The rule RTell says that the process tell( c ) adds c to the current store d, via conjunction, and evolves into skip. * The rule RPar is the standard interleaving rule for parallel composition. * Let Q = local (x;c) P in Rule RLoc. The global store is d and the local store is c. We distinguish between the external (corresponding to Q) and the inte…

grupos:avispa:publications_repository

2011-02-24T10:56:52-05:00

This list of publications points to the abstracts and to the bibtex entries of each publication. Return to the AVISPA Research Group page. Copyright Notice. The documents distributed have been provided by the contributing authors as a means to ensure timely dissemination of technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, not withstanding that they have offered their works here electronically. It is understoo…

grupos:avispa:react-plus

2012-01-22T19:54:37-05:00

Robust theories for Emerging Applications in Concurrency Theory: Processes and Logic Used in Emergent Systems A joint research effort between the AVISPA Research Group (Universidad Javeriana and Universidad del Valle at Cali, Colombia), the Musical Representations Team at IRCAM and the INRIA Team Comète (LIX, École Polytechnique de Paris, France).

grupos:avispa:react

2007-12-09T08:26:01-05:00

Robust theories for Emerging Applications in Concurrency Theory A joint research effort between the AVISPA Research Group (Universidad Javeriana at Cali, Colombia), the Musical Representations Team at IRCAM and the INRIA Team Comète (LIX, École Polytechnique de Paris, France).

grupos:avispa:repository_abstracts

2010-08-09T18:31:07-05:00

You can also check this list of publications without abstracts, or get the full bibtex file. Return to the AVISPA Research Group page. Copyright Notice. The documents distributed have been provided by the contributing authors as a means to ensure timely dissemination of technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, not withstanding that they have offered their works here electronically. It is understood tha…

grupos:avispa:repository_bib

2010-08-09T18:39:04-05:00

You can also see the list of publications in two flavours: with abstracts and without abstracts ----------

grupos:avispa:researchproposals

2007-09-27T03:58:51-05:00

This pages aims at gathering potential research topics to be carried out within the group. Potential students (at all levels) are encouraged to propose new topics or to refine existing ones. Members of the group are encouraged to provide concise, clearly written proposals (in a standardized format) and to follow those interested students.

grupos:avispa:seminar

2011-10-24T14:47:03-05:00

Check the forthcoming talks or the log of past talks. 2011 Talks Learning During Search Speaker: Alejandro Arbeláez [Slides] Abstract: Autonomous Search is a new emerging area in Constraint Programming, motivated by the demonstrated importance of the application of Machine Learning techniques to the Algorithm Selection Problem, and with potential applications ranging from planning and configuring to scheduling. This area aims at developing automatic tools to improve the performance of s…

grupos:avispa:soft_constraints

2011-01-24T15:30:28-05:00

Constraint Satisfaction Problems (CSPs) often deal with quantitative criteria such as preferences. Such criteria are important as they provide information about the context of the problem that is not captured by the constraints model. Such additional information could be fundamental in finding good solutions. Moreover, quantitative criteria are fundamental in over-constrained problems where there is no solution that respects all the constraints stated in the given CSP. Soft constraints are one w…

grupos:avispa:thesis_proposals

2011-01-24T15:30:28-05:00

Security A Unified Visual Language for the Specification of Security Protocols Motivation In a world with a growing connectivity between numerous entities all over the world, the security of information has been positioned as one of the most important issues in communication networks. Formerly, the analysis of security was done using rather primitive mechanisms, often based on intuitions to find flaws in a security system. However, recently the complexity of the topic have evidenced the need …

grupos:avispa:xri

2011-01-24T15:30:28-05:00

Soon to come.