iPRA 2014 - Interpolation: From Proofs to Applications

Craig interpolation enjoys a continuing popularity in computer science. Historically, Craig's interpolation theorem has received ample attention in proof theory and mathematical logic as well as in complexity theory. Recently, interpolants are increasingly used in automated verification, synthesis, and description logics. The aim of the workshop is to bring together theoreticians and practitioners from these different fields.
The topics of interest comprise but are not limited to:
Interpolating decision procedures
Proof theoretic approaches to interpolation
Proof systems and calculi for interpolation
Proof transformation techniques
Inductive Proofs
Logical Abduction
Interpolation techniques based on constraint solving, linear programming, …
Alternative techniques for interpolation
Interpolation theorems (for theories and extensions, non-classical logic, …)
Interpolation-based/Inductive invariant generation
Program analysis and verification
Tools for interpolation
Applications of Craig interpolation (verification, synthesis, description logics, …)
Forgetting, variable elimination, and uniform interpolation
Complexity results and limitations
…
We solicit submissions in form of an abstract of at most one page in PDF format. The authors of accepted abstracts are required to present their work at the workshop. There will be no published proceedings.
We encourage submissions presenting work in progress, tools under development, as well as research of PhD students, such that the workshop can become a forum for active dialog between the groups involved in different applications of interpolation. We particularly encourage contributions from outside the verification community.
The submission of abstracts describing recently published papers is allowed and encouraged.
You may also be interested in the program of the First IPRA Workshop in St. Petersburg