Ponències/Comunicacions de congressos
Recent Submissions
-
Ordocoordinación: cómo organizar 700 estudiantes en un nuevo campus (y no morir en el intento)
(Asociación de Enseñantes Universitarios de la Informática (AENUI), 2018)
Conference report
Open AccessSince Autumn Term 2017 the Department of Computer Science of the Universitat Politecnica de Catalunya UPC-BarcelonaTech is in charge of teaching ”Fundamentals of Programming” in the new DiagonalBeso ´s Campus, at EEBE ... -
Anotaciones de Merlín, comportamiento de universos y semántica algebraica
(E.T.S.I. de Telecomunicación, 1985)
Conference report
Open AccessEn este trabajo se presentan las ideas básicas seguidas para el diseño de un lenguaje de anotaciones para el lenguaje de programación Merlín. En concreto, las anotaciones se prevén en forma de especificaciones ecuacionales ... -
Speeding up the constraint-based method in difference logic
(2016)
Conference report
Open AccessOver the years the constraint-based method has been successfully applied to a wide range of problems in program analysis, from invariant generation to termination and non-termination proving. Quite often the semantics of ... -
Look-ahead with mini-bucket heuristics for MPE
(AAAI Press (Association for the Advancement of Artificial Intelligence), 2016)
Conference lecture
Open AccessThe paper investigates the potential of look-ahead in the con-text of AND/OR search in graphical models using the Mini-Bucket heuristic for combinatorial optimization tasks (e.g., MAP/MPE or weighted CSPs). We present and ... -
Limited discrepancy AND/OR search and its application to optimization tasks in graphical models
(AAAI Press (Association for the Advancement of Artificial Intelligence), 2016)
Conference report
Open AccessMany combinatorial problems are solved with a Depth-First search (DFS) guided by a heuristic and it is well-known that this method is very fragile with respect to heuristic mistakes. One standard way to make DFS more robust ... -
Compositional safety verification with Max-SMT
(2015)
Conference report
Open AccessWe present an automated compositional program verification technique for safety properties based on conditional inductive invariants. For a given program part (e.g., a single loop) and a postcondition, we show how to, using ... -
Termination competition (termCOMP 2015)
(Springer, 2015)
Conference report
Open AccessThe termination competition focuses on automated termination analysis for all kinds of programming paradigms, including categories for term rewriting, imperative programming, logic programming, and functional programming. ... -
The fractal dimension of SAT formulas
(Springer, 2014)
Conference report
Restricted access - publisher's policyModern SAT solvers have experienced a remarkable progress on solving industrial instances. Most of the techniques have been developed after an intensive experimental process. It is believed that these techniques exploit ... -
Decomposing utility functions in Bounded Max-Sum for distributed constraint optimization
(Springer, 2014)
Conference report
Open AccessBounded Max-Sum is a message-passing algorithm for solving distributed Constraint Optimization Problems (DCOP) able to compute solutions with a guaranteed approximation ratio. In this paper we show that the introduction ... -
The IntSat method for integer linear programming
(Springer, 2014)
Conference report
Open AccessConflict-Driven Clause-Learning (CDCL) SAT solvers can automatically solve very large real-world problems. To go beyond, and in particular in order to solve and optimize problems involving linear arithmetic constraints, ... -
Proving non-termination using max-SMT
(Springer, 2014)
Conference report
Open AccessWe show how Max-SMT-based invariant generation can be exploited for proving non-termination of programs. The construction of the proof of non-termination is guided by the generation of quasi-invariants - properties such ... -
Minimal-model-guided approaches to solving polynomial constraints and extensions
(Springer, 2014)
Conference report
Open AccessIn this paper we present new methods for deciding the satisfiability of formulas involving integer polynomial constraints. In previous work we proposed to solve SMT(NIA) problems by reducing them to SMT(LIA): non-linear ...