|
Papers |
|
Papers (co-)authored by Andrés Aristizábal
[1]
|
Andrés Aristizabal, Filippo Bonchi, Luis Pino, and Frank D. Valencia.
Reducing Weak to Strong Bisimilarity in CCP.
In Fifth Interaction and Concurrency Experience, pages 2-16,
Stockholm, Sweden, December 2012.
EPTCS.
[ bib |
http ]
|
[2]
|
Andrés Aristizabal.
Techniques de Bisimulation et Algorithmes pour la Programmation
Concurrente par Contraintes.
PhD thesis, Ecole Polytechnique X, October 2012.
[ bib |
http ]
|
[3]
|
Andrés Aristizabal, Filippo Bonchi, Luis Pino, and Frank D. Valencia.
Partition Refinement for Bisimilarity in CCP.
In 27th ACM Symposium On Applied Computing, Trento, Italy,
2012.
[ bib |
http ]
|
[4]
|
Andrés Aristizabal, Filippo Bonchi, Luis Pino, and Frank D. Valencia.
Partition Refinement for Bisimilarity in CCP.
In Proceedings of the 27th ACM Symposium On Applied Computing to
be held in Riva del Garda (Trento), Italy. March 26-30, 2012. ACM, 2012.
[ bib |
http ]
|
[5]
|
Andrés Aristizabal, Filippo Bonchi, Catuscia Palamidessi, Luis Pino, and
Frank D. Valencia.
Deriving Labels and Bisimilarity for Concurrent Constraint
Programming.
In Martin Hofmann, editor, Proceedings of the 14th
International Conference on Foundations of Software Science an Computation
Structures (FOSSACS 2011). , volume 6604 of Lecture Notes in Computer
Science, pages 138-152, Saarbrücken, Germany, 2011. Springer.
[ bib |
http ]
|
[6]
|
Andrés A. Aristizabal P.
Bisimilarity in concurrent constraint programming.
In Manuel V. Hermenegildo and Torsten Schaub, editors, Technical
Communications of the 26th International Conference on Logic Programming
(ICLP 2010), volume 7 of Leibniz International Proceedings in
Informatics, pages 236-240, Edinburgh, United Kingdom, July 2010. Schloss
Dagstuhl - Leibniz-Zentrum fuer Informatik.
Short paper accepted at the Doctoral Programme of ICLP'2010.
[ bib |
http ]
|
This file has been generated by
bibtex2html 1.74
Back
Page maintainer:
Catuscia Palamidessi
|