Researchers of the IMDEA Software Institute have given several talks at the 33rd International Conference on Logic Programming (ICLP'17), that was co-located with the 23rd International Conference on Principles and Practice of Constraint Programming (CP'17), and the 20th International Conference on Theory and Applications of Satisfiability Testing (SAT'17), held on August 28 - September 1, 2017, in Melbourne, Australia. ICLP is the top international venue in the area of Logic Programming.
IMDEA Software Institute’s faculty members Manuel Carro and Manuel Hermenegildo were members of the Program Committee.
Manuel Hermenegildo gave, jointly with Pascal Van Hentenryck, a plenary ICLP/CP/SAT talk dedicated to the work of Alain Colmerauer, the creator of the Prolog programming language and one of the founders of the field of constraint programming, who passed away this spring.
Nataliia Stulova presented at ICLP'17 her joint paper with José Francisco Morales y Manuel Hermenegildo entitled “Towards Run-time Checks Simplification via Term Hiding”, that presents a novel approach for reducing the overhead of some run-time verification techniques by several orders of magnitude based on considering the term visibility rules prior to instrumenting a program with run-time checks.
The 15th International Colloquium on Implementation of Constraint and LOgic Programming Systems (CICLOPS'17), also co-located with ICLP/CP/SAT, was co-organized by Nataliia Stulova y José Francisco Morales, who also chaired it.
Nataliia Stulova also presented a description of her dissertation research entitled “On Improving Run-time Checking in Dynamic Languages” at the ICLP/CP/SAT Doctoral Program that will be published in the ICLP'17 Technical Communications OASIcs series (volume 58), published by Dagstuhl.
Finally, and as reported in separate news, Pedro López gave an invited talk at CICLOPS'17 and Pedro López and Manuel Hermenegildo gave an invited talk at ICLP'17, on occasion of the 10 year Test of Time Award received for their paper entitled “User-Definable Resource Bounds Analysis for Logic Programs”.
