39. POPL 2012:
Philadelphia, Pennsylvania, USA
John Field, Michael Hicks (Eds.):
Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2012, Philadelphia, Pennsylvania, USA, January 22-28, 2012.
ACM 2012, ISBN 978-1-4503-1083-3 
Award presentation and interview
- Andrew P. Black, Peter W. O'Hearn:
Presentation of the SIGPLAN distinguished achievement award to Sir Charles Antony Richard Hoare, FRS, FREng, FBCS; and interview.
1-2
- Tony Hoare:
Message of thanks: on the receipt of the 2011 ACM SIGPLAN distinguished achievement award.
3-6
1.A:
verification
1.B:
semantics
2.A:
privacy and access control
2.B:
decision procedures
3.A:
security
3.B:
complexity for concurrency
Invited talk
4.A:
medley
4.B:
mMechanized proofs
- Krystof Hoder, Laura Kovács, Andrei Voronkov:
Playing in the grey area of proofs.
259-272
- Antonis Stampoulis, Zhong Shao:
Static and user-extensible proof checking.
273-284
- Casey Klein, John Clements, Christos Dimoulas, Carl Eastlund, Matthias Felleisen, Matthew Flatt, Jay A. McCarthy, Jon Rafkind, Sam Tobin-Hochstadt, Robert Bruce Findler:
Run your research: on the effectiveness of lightweight mechanization.
285-296
5.A:
concurrency
5.B:
type theory
6.A:
dynamic analysis
6.B:
names and binders
Invited talk 2
- J. Strother Moore:
Meta-level features in an industrial-strength theorem prover.
425-426
7.A:
verified transformations
7.B:
functional programming
8.A:
C/C++ semantics
8.B:
type systems
Last update Thu May 23 17:50:37 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
