Programa PROLE

Los tiempos para las exposiciones de los trabajos son los siguientes:

  • 40 minutos: tutoriales.
  • 20 minutos: resto de trabajos.

Lunes, 2 de septiembre de 2019

  • Sesión 1: Modelado – 09:00 – 10:30 – Sala Ateneo. Chair: Fernando Orejas
    • María-Del-Mar Gallardo and Laura Panizo. Modelling and Specifying Software Systems with Alloy (tutorial)
    • Marco Comini, Francesco Saverio Comisso and Alicia Villanueva. A bottom-up fixpoint semantics that models the behavior of PROMELA programs
    • Alexander Bolotov, Montserrat Hermo and Paqui Lucio. Extending Fairness Expressibility of ECTL+: A Tree-Style One-Pass Tableau Approach
  • Sesión 2: Logic Programming – 15:00 – 16:30 – Sala Ateneo. Chair: Jesús M. Almendros-Jiménez
    • Joaquin Arias and Manuel Carro. Incremental Evaluation of Lattice-Based Aggregates in Logic Programming Using Modular TCLP
    • Maximiliano Klemen, Nataliia Stulova, Pedro Lopez-Garcia, Manuel V. Hermenegildo and José Morales. Static Performance Guarantees for Programs with Run-time Checks
    • Joaquin Arias and Manuel Carro. Modeling and Reasoning in Event Calculus Using Constraint Answer Set Programming
  • Sesión 3: Testing and Debugging – 17:00 – 18:00 – Sala Ateneo. Chair: Alicia Villanueva
    • Ivan Lanese, Adrian Palacios and German Vidal. Causal-Consistent Replay Debugging for Message Passing Programs
    • Sergio Pérez, Josep Sílva and Salvador Tamarit. Automatic Testing of Program Slicers

Martes, 3 de septiembre de 2019

  • Sesión 4: Boolean Satisfiability- 09:00 – 10:30 – Sala Ateneo. Chair: Santiago Escobar
    • Maria Luisa Bonet. Satisfiability Solvers based on Resolution and Cutting Planes Proof Systems (tutorial)
    • Ricardo Peña, Jaime Sánchez-Hernández, Miguel Garrido and Javier Sagredo. SMT-based Test-Case Generation with Complex Preconditions
    • Raúl Gutiérrez and Salvador Lucas. infChecker: A Tool for Checking Infeasibility
  • Sesión 5: Datalog Query Languages – 12:45 – 13:45 – Sala Ateneo. Chair: Ginés Moreno
    • Fernando Saenz-Perez. Experiencing Intuitionistic Logic Programming in SQL Puzzles (Work in Progress)
    • Jesus M. Almendros-Jimenez and Antonio Becerra-Teron. Ontology and Constraint Reasoning Based Analysis of SPARQL Queries
  • Sesión 6: Fuzzy Logic Programming – 15:15 – 16:45 – Sala Ateneo. Chair: María-Del-Mar Gallardo
    • Pascual Julian-Iranzo and Fernando Saenz-Perez. Integrating WordNet into Bousi~Prolog (Work in Progress)
    • Gines Moreno, Jesús Pérez and José Antonio Riaza Valverde. Tuning Neural Networks in a Fuzzy Logic Programming Environment
    • Jesus M. Almendros-Jimenez, Antonio Becerra-Teron, Gines Moreno and Jose Antonio Riaza Valverde. Tuning Fuzzy SPARQL Queries in a Fuzzy Logic Programming Environment
  • Sesión 7: Concurrencia y Paralelismo – 17:15 – 18:15 – Sala Ateneo. Chair: Manuel Carro
    • Cristina Zoltan, Edelmira Pasarella, Julian Araoz and Maria-Esther Vidal. The Dynamic Pipeline Paradigm
    • Álvaro Fernández Díaz, Clara Benac Earle and Lars-Ake Fredlund. Pitfalls of Jason Concurrency

Miércoles, 4 de septiembre de 2019

  • Sesión 8: RWL – 09:00 – 10:30 – Sala Ateneo. Chair: Ricardo Peña
    • Francisco Durán, Steven Eker, Santiago Escobar, Narciso Marti-Oliet, Jose Meseguer and Carolyn Talcott. Associative Unification and Symbolic Reasoning Modulo Associativity in Maude (tutorial)
    • Rubén Rubio, Narciso Marti-Oliet, Isabel Pita and Alberto Verdejo. Model-checking strategy-controlled rewriting systems
    • Antonio Gonzalez-Burgueño, Damian Aparicio, Santiago Escobar, Catherine Meadows and Jose Meseguer. Formal verification of the YubiKey and YubiHSM APIs in Maude-NPA
  • Sesión 9: Model-driven Development – 12:30 – 13:30 – Sala Ateneo. Chair: Narciso Martí-Oliet
    • Elvira Pino, Marisa Navarro and Fernando Orejas. Incremental Concurrent Synchronization with Conflict Resolution
    • Alejandro Pérez-Vereda, Carlos Canal and Ernesto Pimentel. Formalización de una arquitectura de computación móvil basada en Linda
  • Sesión 10: Program analysis – 15:00 – 16:00 – Sala Ateneo. Chair: Pascual Julián-Iranzo
    • Salvador Lucas. Using Well-Founded Relations for Proving Operational Termination
    • Salvador Lucas. Proving Program Properties as First-Order Satisfiability