{"id":4577,"date":"2015-03-05T13:29:17","date_gmt":"2015-03-05T12:29:17","guid":{"rendered":"http:\/\/people.unica.it\/researchersinmotion\/?page_id=4577"},"modified":"2015-03-05T13:29:17","modified_gmt":"2015-03-05T12:29:17","slug":"cv-luis-fernando-pino-duque","status":"publish","type":"page","link":"https:\/\/people.unica.it\/researchersinmotion\/alumni-profiles\/luis-fernando-pino-duque\/cv-luis-fernando-pino-duque\/","title":{"rendered":"CV Luis Fernando Pino Duque"},"content":{"rendered":"<p><span style=\"color: #ff0000\"><strong>Current position:<\/strong><\/span><\/p>\n<p style=\"text-align: justify\">Since January 2015 I am a postdoctoral researcher at the University of Cagliari in Italy, I am hosted by the group of Trustworthy Computational Societies led by Prof. Massimo Bartoletti. My research is focused on the development of formal methods for the specification, analysis and verification of software and systems.<\/p>\n<p>&nbsp;<\/p>\n<p><span style=\"color: #ff0000\"><strong>Education:<\/strong><\/span><\/p>\n<p><strong>PhD in Computer Science <\/strong>at Ecole Polytechnique, France. <strong>2011-2014<\/strong><\/p>\n<p>Thesis: Efficient Verification and New Reasoning Techniques for Concurrent Constraint Programming.<\/p>\n<p>Supervisors: Frank Valencia and Catuscia Palamidessi.<\/p>\n<p>Graduated with the highest honors (mention tr`es honorable in French).<\/p>\n<p><strong>MSc in Computer Science <\/strong>at Ecole Polytechnique, France. <strong>2010-2011<\/strong><\/p>\n<p>Received cum laude honor (mention assez bien in French).<\/p>\n<p>Cumulative GPA: 12.75\/20.<\/p>\n<p><strong>BSc in Computer Science <\/strong>at Universidad del Valle, Colombia. <strong>2005-2010<\/strong><\/p>\n<p>Received summa cum laude honor (laureado in Spanish) and best of the class distinction.<\/p>\n<p>Cumulative GPA: 4.58\/5.<\/p>\n<p><strong>\u00a0<\/strong><\/p>\n<p><strong>PhD student at Ecole Polytechnique <\/strong>October 2011-September 2014 Palaiseau, France<\/p>\n<p>I did my PhD at the Computer Science Laboratory from Ecole Polytechnique. My research was mainly focused on formal methods for the analysis and verification of concurrent systems. The main contributions of my thesis include the development of novel reasoning techniques and algorithms for analyzing the behavior of concurrent constraint programs. A total of six articles were derived from my PhD dissertation which were published in leading journals, conferences, and workshops in Computer Science. I also attended several high-quality international conference and computer science courses, and interacted with some of the most recognized scientists in my areas of research.<\/p>\n<p><strong>Software Engineering PhD Intern at Google <\/strong>June-September 2014 Mountain View, United States<\/p>\n<p>The goal of this internship was to design and implement a domain specific language for describining and manipulating complex types of JavaScript programs. The key accomplishment was the replacement of convoluted logic in the compiler, used to deal with difficult cases where the type inference was ineffective, with simpler and more precise expressions. This project was developed in Java involving also JavaScript\/Closure.<\/p>\n<p><strong>Research Intern at Ecole Polytechnique <\/strong>March-July 2011 Palaiseau, France<\/p>\n<p>The key accomplishment of this internship was the development of a novel technique to prove program equivalence in the concurrent constraint programming (CCP) formalism. The outcome was part of my MSc thesis and it was published in the proceedings of the 14th Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2011, part of ETAPS 2011).<\/p>\n<p><strong>Research Intern at Ecole Polytechnique <\/strong>March-June 2010 Palaiseau, France<\/p>\n<p>The main goal of this internship was to analyze a reachability problem in a fragment of the calculus, a formalism for modeling concurrent systems. The problem consisted in determining whether a system of this kind, with a possibly infinite execution, is able (or not) to show certain (interesting) behavior. I also implemented an interpreter for the fragment considered using Mozart\/Oz. The outcome of this internship was part of my BSc thesis and it was one of the reasons to obtain the summa cum laude honor from Universidad del Valle.<\/p>\n<p><strong>Software Developer consulting for CORPRUVALLE <\/strong>January-May 2009 Cali, Colombia<\/p>\n<p>CORPRUVALLE is an association of teachers from Universidad del Valle. They provide recreational spaces and services for the associates and their families. As part of the final project of the web applications course, I was in charge of the development of their website. The goal was to improve the reach of the association and to provide a platform for the administration of their resources and services, e.g. management of the sports facilities. The website was developed in HTML\/JavaScript on the client-side, using the EXTJS library and the Google Visualization API for some UIs, and PHP\/PostgreSQL on the server-side.<\/p>\n<p><strong>Teaching Assistant at Universidad del Valle <\/strong>2006-2009 Cali, Colombia<\/p>\n<p>I was a teaching assistant on the following courses: Discrete Mathematics, Programming Languages and Compilers, Analysis and Design of Algorithms, Interactive Programming. For the programming languages course we used Scheme. For the algorithms course we used Java and C++. And for the interactive programming the focus was on Java.<\/p>\n<p><span style=\"color: #ff0000\"><strong>Distinctions:<\/strong><\/span><\/p>\n<p><strong>2011-2014 <\/strong>Doctoral Scholarship for a 3-year PhD studies from INRIA (French Institute for Research in Computer Science and Automation) and the DGA (French Defense Procurement Agency).<\/p>\n<p><strong>2010 <\/strong>Excellence Scholarship for a 1-year MSc studies from the Foundation of the Ecole Polytechnique.<\/p>\n<p><strong>2010<\/strong> Graduated with the highest honors from Universidad del Valle. Summa cum laude honor (given to 1 student per program per year), and highest GPA among the Computer Science graduates for which I was given the best of the class (Mejor Graduando, in Spanish) distinction.<\/p>\n<p><strong>2009<\/strong> Ranked top 1%, among approximately 8000 Computer Science graduates (nationwide) in 2008, at\u00a0the National Exam for Testing the Quality of Higher Education (SABER PRO in Spanish).<\/p>\n<p><strong>2008-2009<\/strong> Honorable Mention (two times) from the Association for Computer Machinery (ACM) for qualifying to the International College Programming Contest (ICPC) South America-North Regional Finals.<\/p>\n<p><strong>2008-2009<\/strong>In 2008 we reached the 25th position (out of 100 teams) and in 2009 we climbed to the 11th position (out of 110 teams).<\/p>\n<p><strong>\u00a0<\/strong><span style=\"color: #ff0000\"><strong>Additional Information:<\/strong><\/span><\/p>\n<p><strong>Programming Languages<\/strong>: Java, C++, JavaScript, PHP, HTML, Scheme, SQL, Mozart\/Oz.<\/p>\n<p><strong>S<\/strong><strong>oftware Engineering<\/strong>: OO Design, Design of Relational Databases, UML.<\/p>\n<p><strong>Others<\/strong>: Linux, LPSolve (Linear Programming), Eclipse, Netbeans, LaTeX.<\/p>\n<p><strong>Languages<\/strong>: Spanish (Native), English (Fluent), French (Fluent), Italian (Basic)<\/p>\n<p><strong>Research Interests:<\/strong><\/p>\n<p>My broad areas of interest are concurrency theory, programming languages and formal verification. More specifically, I am interested in process calculi and its use to model and verify concurrent programs, with emphasis on the algorithmic aspects. I am also interested in the interaction between concurrency theory and programming languages to produce more robust and reliable code.<\/p>\n<p><span style=\"color: #ff0000\"><strong>Publications:<\/strong><\/span><\/p>\n<p><strong>Journals:<\/strong><\/p>\n<p><strong>Pino<\/strong>, F. Bonchi, F. Valencia. Efficient Algorithms for Program Equivalence for Confluent Concurrent Constraint Programming. To appear in the Journal of Science of Computer Programming, 2015.<\/p>\n<p><strong>Pino<\/strong>, A. Aristizabal, F. Bonchi, F. Valencia, Weak CCP bisimilarity with strong procedures. Science of Computer Programming, 100(0):84-104, 2015.<\/p>\n<p><span style=\"color: #ff0000\"><strong>International Conferences:<\/strong><\/span><\/p>\n<p><strong>Pino<\/strong>, F. Bonchi, F. Valencia.<\/p>\n<p>A Behavioral Congruence for Concurrent Constraint Programming with Non-deterministic Choice.<br \/>\n11th International Colloquium on Theoretical Aspects of Computing (ICTAC 2014), volume 8687 of Lecture Notes in Computer Science, pages 351-368. Springer, 2014.<strong>Pino<\/strong>, F. Bonchi, F. Valencia.<\/p>\n<p>Efficient Computation of Program Equivalence for Confluent Concurrent Constraint Programming.<br \/>\n15th International Symposium on Principles and Practice of Declarative Programming (PPDP 2013), ACM, 2013, pp. 263-274.<\/p>\n<p>Aristizabal, F. Bonchi, <strong>L. Pino<\/strong>, F. Valencia.<\/p>\n<p>Partition Refinement for Bisimilarity in CCP.<br \/>\n27th Annual ACM Symposium on Applied Computing (SAC 2012), ACM, 2012, pp. 88-93.<\/p>\n<p>Aristizabal, F. Bonchi, C. Palamidessi, <strong>L. Pino<\/strong>, F. Valencia.<\/p>\n<p>Deriving Labels and Bisimilarity for Concurrent Constraint Programming.<br \/>\n14th International Conference on Foundations of Software Science and Computational Structures (FoSSaCS 2011), volume 6604 of Lecture Notes in Computer Science, Springer, 2011, pp. 138-152.<\/p>\n<p><span style=\"color: #ff0000\"><strong>InternationalWorkshops:<\/strong><\/span><\/p>\n<p>Aristizabal, F. Bonchi, <strong>L. Pino<\/strong>, F. Valencia.<\/p>\n<p>Reducing Weak to Strong Bisimilarity in CCP.<br \/>\n5th Interaction and Concurrency Experience (ICE 2012), volume 104 of Electronic Proceedings in Theoretical Computer Science, 2012, pp. 2-16.<\/p>\n<p><span style=\"color: #ff0000\"><strong>Extended Abstracts:<\/strong><\/span><\/p>\n<p><strong>Pino<\/strong>, F. Bonchi, F. Valencia.<\/p>\n<p>Efficient Computation of Program Equivalence for Confluent Concurrent Constraint Programming (Extended Abstract).<br \/>\n5th Young ResearchersWorkshop on Concurrency Theory (YR-CONCUR 2013).<\/p>\n<p><strong>\u00a0<\/strong><span style=\"color: #ff0000\"><strong>Organization:<\/strong><\/span><\/p>\n<p>Part of the organizing committee of the 12th International Colloquium on Theoretical Aspects of Computing (ICTAC 2015) to be held in Cali, Colombia.<\/p>\n<p><span style=\"color: #ff0000\"><strong>\u00a0<\/strong><strong>Hobbies:<\/strong><\/span><\/p>\n<p><strong>Programming Competitions<\/strong>:<\/p>\n<p>Google Codejam. <strong>2008-present<\/strong><\/p>\n<p>Facebook Hacker Cup. <strong>2011-present<\/strong><\/p>\n<p>ACM ICPC (International Collegiate Programming Contest). <strong>2008-2009<\/strong><\/p>\n<p><strong>\u00a0<\/strong><strong>Sports<\/strong>: I trained Wushu\/Kung Fu from 2004 to 2009. As part of Wushu team of my region I went to several national competitions and earned numerous medals including a gold medal in 2007 in the Nanquan category.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Current position: Since January 2015 I am a postdoctoral researcher at the University of Cagliari in Italy, I am hosted by the group of Trustworthy Computational Societies led by Prof. Massimo Bartoletti. My research is focused on the development of formal methods for the specification, analysis and verification of software and systems. &nbsp; Education: PhD in Computer Science at Ecole Polytechnique, France. 2011-2014 Thesis: Efficient Verification and New Reasoning Techniques for Concurrent Constraint Programming. Supervisors: Frank Valencia and Catuscia Palamidessi. Graduated with the highest honors (mention tr`es honorable in French). MSc in Computer Science at Ecole Polytechnique, France. 2010-2011 Received <a href='https:\/\/people.unica.it\/researchersinmotion\/alumni-profiles\/luis-fernando-pino-duque\/cv-luis-fernando-pino-duque\/' class='excerpt-more'>[&#8230;]<\/a><\/p>\n","protected":false},"author":366,"featured_media":0,"parent":4572,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"ngg_post_thumbnail":0,"footnotes":""},"class_list":["post-4577","page","type-page","status-publish","hentry","post-seq-1","post-parity-odd","meta-position-corners","fix"],"publishpress_future_action":{"enabled":false,"date":"2026-04-11 06:50:29","action":"change-status","newStatus":"draft","terms":[],"taxonomy":"frm_application","extraData":[]},"publishpress_future_workflow_manual_trigger":{"enabledWorkflows":[]},"_links":{"self":[{"href":"https:\/\/people.unica.it\/researchersinmotion\/wp-json\/wp\/v2\/pages\/4577","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/people.unica.it\/researchersinmotion\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/people.unica.it\/researchersinmotion\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/people.unica.it\/researchersinmotion\/wp-json\/wp\/v2\/users\/366"}],"replies":[{"embeddable":true,"href":"https:\/\/people.unica.it\/researchersinmotion\/wp-json\/wp\/v2\/comments?post=4577"}],"version-history":[{"count":1,"href":"https:\/\/people.unica.it\/researchersinmotion\/wp-json\/wp\/v2\/pages\/4577\/revisions"}],"predecessor-version":[{"id":4578,"href":"https:\/\/people.unica.it\/researchersinmotion\/wp-json\/wp\/v2\/pages\/4577\/revisions\/4578"}],"up":[{"embeddable":true,"href":"https:\/\/people.unica.it\/researchersinmotion\/wp-json\/wp\/v2\/pages\/4572"}],"wp:attachment":[{"href":"https:\/\/people.unica.it\/researchersinmotion\/wp-json\/wp\/v2\/media?parent=4577"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}