Nils Anders Danielsson | 1 Oct 18:43 2013

2nd CFP: PLPV 2014, Programming Languages meets Program Verification

                         Second call for papers:

                                PLPV 2014
             Programming Languages meets Program Verification
                            San Diego, CA, USA
                        Co-located with POPL 2014



The goal of PLPV is to foster and stimulate research at the intersection
of programming languages and program verification, by bringing together
experts from diverse areas like types, contracts, interactive theorem
proving, model checking and program analysis. Work in this area
typically attempts to reduce the burden of program verification by
taking advantage of particular semantic or structural properties of the
programming language. One example is provided by dependently typed
programming languages, which make it possible to specify and check rich
specifications using the languages' type systems. Another example is
provided by extended static checking systems, which incorporate
contracts with either static or dynamic contract checking.

We invite submissions on all aspects, both theoretical and practical, of
the integration of programming language and program verification
technology. To encourage interaction between different communities, we
seek a broad scope for PLPV. In particular, submissions may have diverse
foundations for verification (based on types, Hoare-logic, abstract
interpretation, etc.), target different kinds of programming languages
(Continue reading)