International Conferences
- F. Gadducci, F. Santini, L. Pino and F. Valencia. A Labelled Semantics for Soft Concurrent Constraint Programming. Proceedings of the 16th IFIP WG 6.1 International Conference on Coordination Models and Languages (COORDINATION 2015), Held as Part of the 9th International Federated Conferences on Distributed Computing Techniques (DisCoTec 2015), volume 9037 of Lecture Notes in Computer Science, pages 133-149. Springer, 2015. [PDF | DOI]
- L. Pino, F. Bonchi, F. Valencia. A Behavioral Congruence for Concurrent Constraint Programming with Non-deterministic Choice. Proceedings of the 11th International Colloquium on Theoretical Aspects of Computing (ICTAC 2014), volume 8687 of Lecture Notes in Computer Science, pages 351-368. Springer, 2014. [PDF | DOI]
- L. Pino, F. Bonchi, F. Valencia. Efficient Computation of Program Equivalence for Confluent Concurrent Constraint Programming. Proceedings of the 15th International Symposium on Principles and Practice of Declarative Programming (PPDP 2013), ACM, 2013, pp. 263-274. [PDF | DOI]
- A. Aristizabal, F. Bonchi, L. Pino, F. Valencia. Partition Refinement for Bisimilarity in CCP. Proceedings of the 27th Annual ACM Symposium on Applied Computing (SAC 2012), ACM, 2012, pages 88-93. [DOI]
- A. Aristizabal, F. Bonchi, C. Palamidessi, L. Pino, F. Valencia. Deriving Labels and Bisimilarity for Concurrent Constraint Programming. Proceedings of the 14th International Conference on Foundations of Software Science and Computational Structures (FoSSaCS 2011), volume 6604 of Lecture Notes in Computer Science, Springer, 2011, pages 138-152. [PDF | DOI]
- A. Aristizabal, F. Bonchi, L. Pino, F. Valencia. Reducing Weak to Strong Bisimilarity in CCP. Proceedings of the 5th Interaction and Concurrency Experience (ICE 2012), volume 104 of Electronic Proceedings in Theoretical Computer Science, 2012, pages 2-16. [PDF | DOI]
Short papers
- L. Pino, F. Bonchi, F. Valencia. Efficient Computation of Program Equivalence for Confluent Concurrent Constraint Programming (Extended Abstract). (Informal) Proceedings 5th Young Researchers Workshop on Concurrency Theory (YR-CONCUR 2013). [PDF]
- Luis Fernando Pino Duque. Efficient Verification and New Reasoning Techniques for Concurrent Constraint Programming. PhD thesis, LIX, Ecole Polytechnique, Palaiseau, France. Supervised by Frank D. Valencia and Catuscia Palamidessi. [PDF | Webpage]
- Luis Fernando Pino Duque. Deriving Labels and Bisimilarity for Concurrent Constraint Programming. MSc thesis, LIX, Ecole Polytechnique, Palaiseau, France. Supervised by Frank D. Valencia. [PDF]
- Luis Fernando Pino Duque. Analysis of the reachability problem in fragments of the pi-calculus. BSc thesis, LIX, École Polytechnique, France and EISC, Universidad del Valle, Colombia. Co-supervised by Frank D. Valencia (École Polytechnique) and Juan Francisco Diaz (Universidad del Valle). [PDF]
"Research is to see what everybody else has seen, and to think what nobody else has thought." -- Albert Szent-Gyorgyi