 |
|
|
|
| Papers |
|
Papers (co-)authored by Luis Fernando Pino Duque
| [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, 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 ] |
| [3] |
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 ] |
| [4] |
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 ] |
| [5] |
Luis Pino.
Analysis of the reachability problem in fragments of the pi-calculus.
Technical report, Universidad del Valle, Colombia, 2010.
BSc Thesis from Universidad del Valle, Colombia. [ bib | http ] |
This file has been generated by bibtex2html 1.74
Back
Page maintainer: Catuscia Palamidessi