WLPE 2013: Workshop Program

Saturday 24 August 2012

14:30: Opening

14:35 - 15:30: WLPE Invited Talk

• Samir Genaim. Ranking Functions for Linear-Constraint Loops.

  Ranking functions are a tool successfully used in termination analysis, complexity analysis, and program parallelization. There exist different techniques for finding different kinds of ranking functions. In this talk I will concentrate on ranking functions that are found by linear programming techniques, in particular I will review recent fundamental results regarding the search for ranking functions which are either linear or lexicographic-linear. These results include complete algorithms for synthesizing such functions in different settings, as well as complexity of the corresponding decision problems.

15:30 - 16:00: Session 1

• Michael Codish , Yoav Fekete and Amit Metodi. Compiling Finite Domain Constraints to SAT with BEE: the Director's Cut

16:30 - 17:30: Session 2

• Spyros Hadjichristodoulou, Donald E. Porter and David S. Warren. Efficiently Retrieving Function Dependencies in the Linux Kernel Using XSB.
• Alejandro Serrano, Pedro Lopez-Garcia and Manuel Hermenegildo. Towards an Abstract Domain for Resource Analysis of Logic Programs using Sized Types.

Sunday 25 August 2012

14:30 - 16:00: Session 3

• Jan Wielemaker and Michael Hendricks. Why It's Nice to be Quoted: Quasiquoting for Prolog.
• Carl Andersen, Brett Benyo, Miguel Calejo, Mike Dean, Paul Fodor, Benjamin Grosof, Michael Kifer, Senlin Liang and Terrance Swift. Debugging and Profiling Rulelog Computations in Silk
• Dragan Ivanovic. Implementing Constraint Handling Rules as a Domain-Specific Language Embedded in Java.

16:30 - 17:00: Session 4

• Marco Comini, Laura Titolo and Alicia Villanueva. Towards an Effective Decision Procedure for LTL formulas with Constraints.