The talks will (shortly) address the theoretical background
of the work done, and the constructed implementations.
The presentations will last 15 minutes with 5 minutes discussion/question time.
The time schedule is as follows:
11.15
Ravi Krishna,
implementation of a parser for Prolog-Syntax in Java,
and Basic Classes for Lambda Calculus.
11.35
Vinay Middha
Implementation of reachability analysis for C-programs
having only boolean variables through PDS.
11.55
Lav Rai
Implementation of Recursive Path Orders + Basic Paramodulation
in Waldmeister.