Camilo Rueda

Departamento de Electrónica y Ciencias de la Computación
Ext. 8283
  • 1977: Degree in Electrical Engineering (DEE), Massachusetts Institute of Technology (MIT), Boston, Massachusetts, USA
  • 1974: Master of Science in Computer Science, Massachusetts Institute of Technology (MIT), Boston, Massachusetts, USA.
  • 1972: Bachelor of Systems and Computer Engineering, Universidad de Los Andes, Bogotá, Colombia.
  • 2014: Emeritus professor, Universidad Javeriana-Cali, Colombia.
  • 2008-2014: Full time professor, Universidad Javeriana-Cali, Colombia.
  • 2014: Invited professor, Federal University of Rio Grande Do Norte, Brasil. 
  • 2013: Invited professor, Université Pierre et Marie Curie, Paris, France. 
  • 2012-2013-2014: Invited researcher, Ecole Polytechnique, Paris, France.
  • 1990-1994, 1998, 2005, 2011, 2012: Invited researcher, Institut de Recherche/Coordination Acoustique-Musique (IRCAM), Paris, France.
  • 2011-2012: Invited researcher, Université de Bordeaux I, France. 
  • 2012: Invited researcher, University of Madeira, Portugal.

Professor Rueda’s research interests are mainly in the area of the use of formalisms and tools for modeling and verifying interactive systems. There are two main formalisms he privileges in his research, one derived from the “correct by construction” software development paradigm (essentially based on predicate calculus specification of system properties), and the other coming from concurrency theory, namely the formal calculi of concurrent processes.  

In the first, he is interested in finding ways to make the paradigm accessible to the mainstream software development practitioners by offering provably correct translations between a formal system model in the correct by construction paradigm and a fully specified computer program in some mainstream language.

In the second, the goal is being able to model and verify systems in very complex interaction contexts. Among the variety of calculi proposed for this, he is most interested in those capable of performing computation under partial information and having some formal logic equivalence, such as the so-called concurrent constraints calculi (CCP).  The application of this theoretical work I consider mostly is in the field of multimedia interaction, for example, the coordination of human and computers in musical performance, such as in a computers involved in music improvisation scenarios.

His third line of research is the use of languages and techniques derived from constraint programming for solving combinatorial problems. In particular, in approaching the declarative modeling convenience of constraint programming to the solution of real-world engineering problems.

  • M. Toro, M. Desainte-Catherine, C. Rueda. “Formal semantics for interactive music scores: a framework to design, specify properties and execute interactive scenarios”. Journal of Mathematics and Music, Vol 8(1), 2014.
  • N. Cataño, V. Rivera, C. Rueda, T. Wahls. “Translating B and Event-B Machines to Java and JML”.  Chapter 11 in: Formal Methods Applied to Industrial Systems, J-L. Boulanger (ed), Wiley, ISBN: 978-1-84821-709-6, New York, 2014.
  • C. Olarte, C. Rueda, F. D. Valencia: “Models and emerging trends of concurrent constraint programming”. Constraints, vol. 18(4). Springer, New York,  2013.
  • C. Olarte, E. Pimentel, C. Rueda, N. Cataño: “A linear concurrent constraint approach for the automatic verification of access permissions”. PPDP, ACM, Leuven, 2012. N. Cataño, S. Hanvey, C. Rueda: Poporo: “A Formal Methods Tool for Fast-Checking of Social Network Privacy Policies”. LNCS, vol. 7304, Springer, 2012.