|
July 18 |
Monday |
|||
|
|
LOPSTR |
|||
|
13:55 |
Opening of
the Symposium |
|||
|
14:00 – 15:30 |
Session 1 (O100) |
|||
|
T. Stroeder, P. Schneider-Kamp, J. Giesl, F. Emmes and C. Fuhs: A Linear
Operational Semantics for Termination and Complexity Analysis of ISO Prolog |
||||
|
O. Namet, M. Fernandez and H.
Kirchner: A strategy language for graph
rewriting |
||||
|
C. Dandois and W. Vanhoof: Clones in logic programs and how to detect them |
||||
|
15:30 |
COFFEE BREAK |
|||
|
16:00 – 17:30 |
Session 2 (O100) |
|||
|
P. Moura: Meta-Predicate Semantics |
||||
|
J. F. Morales, M. Hermenegildo and R. Haemmerlé: Modular
Extensions for Modular (Logic) Languages |
||||
|
N. Sultana: Work in progress: A prototype refactoring
tool based on a mechanically-verified core |
||||
|
18:00 |
SHUTTLE BUS |
|||
|
|
||||
|
July 19 |
Tuesday |
|||
|
8:00 / 8:20 |
SHUTTLE BUS |
|||
|
|
LOPSTR |
WFLP |
AAIP |
|
|
8:50 |
|
Welcome |
|
|
|
9:00 – 10:00 |
Invited Talk (O100) |
Session 1 (O96) |
Session 1 (O99) |
|
|
J. Gallagher: Program
Analysis With Regular Types |
B. Brassel, M. Hanus, B. Peemöller, F. Reck: KiCS2: A New
Compiler from Curry to Haskell |
|
||
|
Welcome |
||||
|
S. Antoy, M. Hanus: New Functional
Logic Design Pattern |
J.A. Bedoya-Puerta, J. Hernandez-Orallo, C. Ferri and M.-J. Ramirez-Quintana: Applying
distances between terms to both flat and hierarchical data |
|||
|
10:00 |
COFFEE BREAK |
|||
|
10:30 – 12:30 |
Session 3 (O100) |
Session 2 (O96) |
Invited Talk (O99) |
|
|
W. Vanhoof: On the
partial deduction of non-ground meta-interpreters |
J.M. Almendros-Jimenez, R. Caballero, Y. García-Ruiz, F. Saenz-Perez: XQuery in the Functional-Logic Language Toy |
R. Bodik: Inductive Program Synthesis using SAT and SMT Solving,
Programming by Sketching |
||
|
F. Fioravanti, A. Pettorossi, M. Proietti and V. Senni: Using Real
Relaxations During Program Specialization |
R. Peña, A.D. Delgado-Muñoz: Size Invariants and Ranking Functions Synthesis in a Functional
Language |
|||
|
H. Seki: Proving Properties of Co-logic
Programs by Unfold/Fold Transformations |
P. Wuille, T. Schrijvers, H. Samulowitz, G. Tack,
P. Stuckey: Memoizing a Monadic Mixin DSL |
Session 2 (O99) |
||
|
L. Diehl: Verified
Stack-Based Genetic Programming via Dependent Types |
||||
|
R. Caballero, A. Riesco, A. Verdejo and N. Marti-Oliet: Simplifying
Questions in Maude Declarative Debugger by Transforming Proof Trees |
|
|
||
|
12:30 |
LUNCH BREAK |
|||
|
14:00 – 15:30 |
Session 4 (O100) |
Session 3 (O96) |
Session 3 (O99) |
|
|
G. Bacci, M. Comini, M. A. Feliú and A.
Villanueva: Automatic
Synthesis of Specifications for Curry Programs |
V. Rodrigues, M. Florido,
S. Melo De Sousa: A Functional
Approach to Worst-Case Execution Time Analysis |
E. Kitzelmann: Two New Operators for IGOR2 to Increase Synthesis Efficiency |
||
|
J. Almendros-Jimenez, R. Caballero, Y. García-Ruiz and F.
Saenz-Perez: A Declarative Embedding of
XQuery in a
Functional-Logic Language |
C. Zinn: Building a Faceted
Browser in CouchDB Using Views on Views and Erlang Metaprogramming |
S. Katayama: An Analytical
Inductive Functional Programming System that Avoids Unintended
Programs |
||
|
S. Hidaka, Z. Hu, K. Inaba, H. Kato, K. Matsuda, K. Nakano and I. Sasano:
Marker-directed optimization of UnCAL graph transformations |
T.A. Majchrzak, H. Kuchen: Logic Java:
Combining Object-Oriented and Logic Programming |
S. Katayama: MagicHaskeller:
System Demonstration |
||
|
15:30 |
COFFEE BREAK |
|||
|
16:00 – 17:30 |
Session 5 (O100) |
Session 4 (O96) |
Discussion (O99) |
|
|
E. Albert, M. Gomez-Zamalloa and J.M.
Rojas Siles: Resource-driven
CLP-based Test Case Generation |
T. Sakata, N. Nishida, T. Sakabe:
On Proving Termination of Constrained
Term Rewrite Systems by Eliminating Edges from Dependency Graphs |
Future directions of inductive programming, collaborations,
future AAIP workshops |
||
|
J. Sneyers and D. De Schreye: Probabilistic
Termination of CHRiSM Programs |
J. Aguado, M. Mendler: Controlling
Streams |
|||
|
P. Pilozzi and D. De Schreye: Improved termination
analysis of CHR using self-sustainability analysis |
|
|
||
|
18:00 |
SHUTTLE BUS |
|||
|
19:00 |
WORKSHOP DINNER |
|||
|
|
||||
|
July 20 |
Wednesday |
|||
|
8:00 / 8:20 |
SHUTTLE BUS |
|||
|
|
LOPSTR / PPDP |
|||
|
9:00 – 10:00 |
Invited Talk |
|||
|
F. Henglein: Dynamic Symbolic
Computation for Domain-Specific Language Implementation |
||||
|
10:00 |
COFFEE BREAK |
|||
|
10:30 – 11:30 |
Invited Talk |
|||
|
V. Lagoon: The Challenges
of Constraint-Based Test Generation |
||||
|
|
LOPSTR |
PPDP |
||
|
11:30 – 12:30 |
Session 6 (O100) |
Session 1 (O96):
Verification & Specification |
||
|
P.Cabalar and S. Demri: Automata-based
Computation of Temporal Equilibrium Models |
F. Schernhammer and J. Meseguer: Incremental
Checking of Well-Founded Recursive Specifications Modulo Axioms |
|||
|
R. Demeyer and W. Vanhoof: Proper Granularity
for Atomic Sections in Concurrent Programs |
K. Inaba, S. Hidaka, Z. Hu, H. Kato
and K. Nakano: Graph-Transformation
Verification using Monadic Second-Order Logic |
|||
|
12:30 |
LUNCH BREAK |
|||
|
13:30 |
SHUTTLE BUS |
|||
|
15:30 |
EXCURSION & DINNER |
|||
|
|
||||
|
July 21 |
Thursday |
|||
|
8:00 / 8:20 |
SHUTTLE BUS |
|||
|
|
PPDP |
|||
|
9:00 – 10:00 |
Session 2 (O100):
Declarative Languages |
|||
|
Bellman's GAP - A
Declarative Language for Dynamic Programming |
||||
|
R. Del Vado Vírseda
and F. Pérez Morente: A Modular
Semantics for Higher-Order Declarative Programming with Constraints |
||||
|
10:00 |
COFFEE BREAK |
|||
|
10:30 – 12:30 |
Session 3 (O100):
Analysis |
|||
|
J. Christiansen and D. Seidel: Minimally Strict Polymorphic Functions |
||||
|
S. Escobar, D. Kapur, C. Lynch, C.
Meadows, J. Meseguer, P. Narendran
and R. Sasse: Protocol
Analysis in Maude-NPA Using Unification Modulo Homomorphic
Encryption |
||||
|
T. Bourdier and H. Cirstea:
Symbolic analysis of network security
policies using rewrite systems |
||||
|
Precision and
Complexity of XQuery Type Inference |
||||
|
12:30 |
LUNCH BREAK |
|||
|
14:00 – 15:00 |
Session 4 (O100):
Concurrency |
|||
|
D. Sabel and M. Schmidt-Schauss: A
Contextual Semantics for Concurrent Haskell with Futures |
||||
|
J. Christian Blanchette, T. Weber, M.
Batty, S. Owens, S. Sarkar: Nitpicking C++ Concurrency |
||||
|
15:00 |
COFFEE BREAK |
|||
|
15:30 – 16:30 |
Session 5 (O100): Logic
Programming and Constraints |
|||
|
V. Nigam, L. Jia, B. Thau Loo and A. Scedrov: Maintaining Distributed Logic Programs
Incrementally |
||||
|
R. Haemmerlé, P. Lòopez-Garcìa
and M. V. Hermenegildo: CLP Projection for Constraint Handling Rules |
||||
|
17:00 |
SHUTTLE BUS |
|||
|
|
||||
|
July 22 |
Friday |
|||
|
8:00 / 8:20 |
SHUTTLE BUS |
|||
|
|
PPDP |
|||
|
9:00 – 10:00 |
Invited Talk (O100) |
|||
|
A. Rybalchenko: Towards Automatic Synthesis of Software Verification Tools |
||||
|
10:00 |
COFFEE BREAK |
|||
|
10:30 – 12:30 |
Session 6 (O100):
Types and Lambda Calculus |
|||
|
M. Biernacka, D. Biernacki
and S. Lenglet: Typing
Control Operators in the CPS Hierarchy |
||||
|
B. Toninho, L. Caires
and F.Pfenning: Dependent
Session Types via Intuitionistic Linear Type Theory |
||||
|
S. Alves, M.Fernandez,
M. Florido and I. Mackie: Recursion in a linear typed lambda-calculus |
||||
|
N. Guenot : Nested Proof
Search as Reduction in the lambda-calculus |
||||
|
12:30 |
LUNCH BREAK & CLOSING |
|||