FLOC 2018: FEDERATED LOGIC CONFERENCE 2018
WST PROGRAM

Days: Wednesday, July 18th Thursday, July 19th

Wednesday, July 18th

View this program: with abstractssession overviewtalk overviewside by side with other conferences

09:00-10:30 Session 125Q: Invited talk
09:00
Termination Checking and Invariant Synthesis for Affine Programs (abstract)
10:30-11:00Coffee Break
11:00-12:30 Session 127Q: Program termination and orderings (I)
11:00
Procedure-Modular Termination Analysis (abstract)
11:30
GPO: A Path Ordering for Graphs (abstract)
12:00
Objective and Subjective Specifications (abstract)
12:30-14:00Lunch Break
14:00-15:30 Session 128Q: Program termination and orderings (II)
14:00
Comparing on Strings: Semantic Kachinuki Order (abstract)
14:30
Embracing Infinity - Termination of String Rewriting by Almost Linear Weight Functions (abstract)
15:00
Well-founded models in proofs of termination (abstract)
15:30-16:00Coffee Break
16:00-18:00 Session 130P: Termination Competition (report and short talks)

TERMCOMP 2018 - Report

Presentation of tool papers:

  • M. Brockschmidt, S. Dollase, F. Emrich, F. Frohn, C. Fuhs, J. Giesl, M. Hark, J. Hensel, D. Korzeniewski, M. Naaf, T. Ströder. AProVE at the Termination Competition 2018
  • Florian Messner and Christian Sternagel. TermComp 2018 Participant: TTT2
  • Dieter Hofbauer. MultumNonMulta at TermComp 2018
  • Raúl Gutiérrez and Salvador Lucas. MU-TERM at the 2018 Termination Competition
  • Jesús J. Doménech and Samir Genaim. iRankFinder
19:15-21:30 Workshops dinner at Magdalen College

Workshops dinner at Magdalen College. Drinks reception from 7.15pm, to be seated by 7:45 (pre-booking via FLoC registration system required; guests welcome).

Thursday, July 19th

View this program: with abstractssession overviewtalk overviewside by side with other conferences

10:30-11:00Coffee Break
11:00-12:30 Session 133J: Complexity
11:00
Complexity Analysis for Bitvector Programs (abstract)
11:30
A Perron-Frobenius Theorem for Jordan Blocks for Complexity Proving (abstract)
12:00
Inference of Linear Upper-Bounds on the Expected Cost by Solving Cost Relations (abstract)
12:30-14:00Lunch Break
14:00-15:30 Session 135I: Complexity / Applications
14:00
Control-Flow Refinement via Partial Evaluation (abstract)
14:30
Verification of Rewriting-based Query Optimizers (abstract)
15:00
TTT2 with Termination Templates for Teaching (abstract)
15:30-16:00Coffee Break
16:00-17:00 Session 137H: Higher-Order
16:00
Termination of Lambda-Pi modulo rewriting using the size-change principle (abstract)
16:30
Improving Static Dependency Pairs for Higher-Order Rewriting (abstract)