PLPV 2012:
Philadelphia,
Pennsylvania,
USA
Koen Claessen, Nikhil Swamy (Eds.):
Proceedings of the sixth workshop on Programming Languages meets Program Verification, PLPV 2012, Philadelphia, PA, USA, January 24, 2012.
ACM 2012, ISBN 978-1-4503-1125-0 
Technical presentations
- Benjamin C. Pierce:
Verification challenges of pervasive information flow.
1-2
- Peter-Michael Osera, Vilhelm Sjöberg, Steve Zdancewic:
Dependent interoperability.
3-14
- Garrin Kimmell, Aaron Stump, Harley D. Eades III, Peng Fu, Tim Sheard, Stephanie Weirich, Chris Casinghino, Vilhelm Sjöberg, Nathan Collins, Ki Yung Ahn:
Equational reasoning about programs with general recursion and call-by-value semantics.
15-26
- Reynald Affeldt, David Nowak, Yutaka Oiwa:
Formal network packet processing with minimal fuss: invertible syntax descriptions at work.
27-36
- Manuel Gesell, Klaus Schneider:
A hoare calculus for the verification of synchronous languages.
37-48
- Alan Jeffrey:
LTL types FRP: linear-time temporal logic propositions as types, proofs as functional reactive programs.
49-60
- Vladimir Komendantsky:
Reflexive toolbox for regular expression matching: verification of functional programs in Coq+Ssreflect.
61-70
- Afshin Amighi, Stefan Blom, Marieke Huisman, Marina Zaharieva-Stojanovski:
The VerCors project: setting up basecamp.
71-82
Last update Fri May 25 08:32:30 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
