Overview

Decision procedures are key components within many formal verification and automated reasoning tools. Their performance, capacity, and scalability are vital to the tools that depend on them. Furthermore, new extensions may allow the formal verification or automated reasoning tools to use decision procedures more effectively.

The goal of PDPAR is to bring together researchers interested in both the theoretical and the pragmatical aspects of decision procedures, giving them a forum for presenting and discussing not only theoretical and algorithmic issues, but also implementation and evaluation techniques, with the ultimate goal of making new decision procedures possible and old decision procedures more powerful and more useful.

PDPAR topics bridge the automated reasoning and formal verification communities. Sample topics of interest include (but are not limited to):

• New decision procedures
• New methods of implementing decision procedures
• New ways of using of the infrastructure common to decision procedures
• Applications andcase studies

Program

• PDPAR program
• PDPAR accepted papers
• PDPAR pre-proceedings

Invited Talks

• Monday, August 21st, 09:30‑10:30
  Peter O'Hearn (Queen Mary, University of London)
  Proof Procedures for Separated Heap Abstractions
• Monday, August 21st, 14:00‑15:00
  Koen Claessen (Chalmers University of Technology and Jasper Design Automation)
  The Power of Finite Model Finding [ppt]

Proceedings

Given the informal style of the workshop, only informal (non-archival) proceedings will be distributed at the workshop. A selected subset of the submitted papers will be published as post-proceedings in a special volume of the Electronic Notes in Theoretical Computer Science (ENTCS) (unless the authors prefer not to).

Program Chairs

Program Committee

History