Programming Languages meets Program Verification (PLPV) 2007

Affiliated with ICFP 2007.


Topic. PLPV is concerned with language-based approaches to program verification. These approaches integrate programming language semantics and verification techniques in a tighter way than is typically done in traditional verification. An example is dependently typed programming, where types provide rich specifications, and programs may contain proof terms to establish type equivalences or satisfy pre-conditions. The motivation for this approach is to reduce the burden of program verification by taking greater advantage of semantic properties (like type properties) of the program during verification.

Paper Topics. Research on language-based approaches to program correctness spans compilers, programming languages, and computational logic. Possible paper topics include: Submissions. Submissions should be new research papers, prepared with article format in LaTeX, of at most 15 pages in length (not counting appendices, which reviewers will not be asked to review). Research papers describing preliminary results or work in progress are preferred. Electronic submission of PostScript or PDF files will be done via the EasyChair system (a link will be provided here when the deadline is closer).

Review Process. Each submission will receive three reviews. The co-chairs will not submit papers, but the PC may submit papers. Reviewing will be managed using the EasyChair system, which prevents PC members from accessing discussions of their own papers.

Publication. PLPV is requesting publication of the workshop proceedings with ACM.

Important Dates. Invited Speaker: TBD

Organizers. Program Committee.
Previous PLPVs: