


default search action
40th POPL 2013: Rome, Italy
- Roberto Giacobazzi, Radhia Cousot:

The 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '13, Rome, Italy - January 23 - 25, 2013. ACM 2013, ISBN 978-1-4503-1832-7
Keynote address
- Georges Gonthier:

Engineering mathematics: the odd order theorem proof. 1-2
Semantics
- Steffen Lösch, Andrew M. Pitts

:
Full abstraction for nominal Scott domains. 3-14 - Ross Tate:

The sequential semantics of producer effect systems. 15-26 - Andreas Abel, Brigitte Pientka, David Thibodeau, Anton Setzer

:
Copatterns: programming infinite structures by observations. 27-38
Verification & static analysis
- Guy E. Blelloch, Robert Harper:

Cache and I/O efficent functional algorithms. 39-50 - Amir M. Ben-Amram, Samir Genaim

:
On the linear ranking problem for integer linear-constraint loops. 51-62 - Richard Mayr, Lorenzo Clemente:

Advanced automata minimization. 63-74
Types
- Hiroshi Unno

, Tachio Terauchi
, Naoki Kobayashi
:
Automating relatively complete verification of higher-order functional programs. 75-86 - Robert Atkey

, Patricia Johann, Andrew Kennedy:
Abstraction and invariance for algebraically indexed types. 87-100 - Véronique Benzaken

, Giuseppe Castagna
, Kim Nguyen, Jérôme Siméon:
Static and dynamic semantics of NoSQL languages. 101-114
Abstract interpretation
- Pavol Cerný, Thomas A. Henzinger, Arjun Radhakrishna

:
Quantitative abstraction refinement. 115-128 - Azadeh Farzan, Zachary Kincaid

, Andreas Podelski:
Inductive data flow graphs. 129-142 - Vijay Victor D'Silva, Leopold Haller, Daniel Kroening

:
Abstract conflict driven learning. 143-154
Semantics
- Alexis Goyet:

The Lambda Lambda-Bar calculus: a dual calculus for unconstrained strategies. 155-166 - Ugo Dal Lago

, Barbara Petit:
The geometry of types. 167-178 - Sam Staton, Paul Blain Levy:

Universal properties of impure programming languages. 179-192
Proofs & verification
- Chung-Kil Hur, Georg Neis, Derek Dreyer, Viktor Vafeiadis

:
The power of parameterization in coinductive proof. 193-206 - Benjamin Delaware, Bruno C. d. S. Oliveira, Tom Schrijvers

:
Meta-theory à la carte. 207-218 - Jonghyun Park, Jeongbong Seo, Sungwoo Park:

A theorem prover for Boolean BI. 219-232
Keynote address
- Shriram Krishnamurthi

:
From principles to programming languages (and back). 233-234
Concurrency & design
- Mark Batty, Mike Dodds

, Alexey Gotsman:
Library abstraction for C/C++ concurrency. 235-248 - Ganesan Ramalingam, Kapil Vaswani:

Fault tolerance via idempotence. 249-262 - Marco Carbone, Fabrizio Montesi

:
Deadlock-freedom-by-design: multiparty asynchronous global programming. 263-274
Separation logic
- Luís Caires, João Costa Seco

:
The type discipline of behavioral separation. 275-286 - Thomas Dinsdale-Young, Lars Birkedal

, Philippa Gardner, Matthew J. Parkinson, Hongseok Yang:
Views: compositional reasoning for concurrent programs. 287-300 - Jonas Braband Jensen, Nick Benton, Andrew Kennedy:

High-level separation logic for low-level code. 301-314
Keynote address
- Andrew C. Myers:

How languages can save distributed computing. 315-316
Concurrency
- Thomas A. Henzinger, Christoph M. Kirsch, Hannes Payer, Ali Sezgin, Ana Sokolova

:
Quantitative relaxation of concurrent data structures. 317-328 - Delphine Demange

, Vincent Laporte, Lei Zhao, Suresh Jagannathan, David Pichardie, Jan Vitek:
Plan B: a buffered memory model for Java. 329-342 - Aaron Joseph Turon, Jacob Thamsborg, Amal Ahmed

, Lars Birkedal
, Derek Dreyer:
Logical relations for fine-grained concurrency. 343-356
Security
- Marco Gaboardi

, Andreas Haeberlen
, Justin Hsu
, Arjun Narayan, Benjamin C. Pierce:
Linear dependent types for differential privacy. 357-370 - Cédric Fournet, Nikhil Swamy, Juan Chen, Pierre-Évariste Dagand, Pierre-Yves Strub, Benjamin Livshits:

Fully abstract compilation to JavaScript. 371-384 - Benjamin Livshits, Stephen Chong:

Towards fully automatic placement of security sanitizers and declassifiers. 385-398
Keynote address
- Noah D. Goodman:

The principles and practice of probabilistic programming. 399-402
Models & semantics
- Andrew D. Gordon, Mihhail Aizatulin, Johannes Borgström, Guillaume Claret, Thore Graepel, Aditya V. Nori, Sriram K. Rajamani, Claudio V. Russo:

A model-learner pattern for bayesian reasoning. 403-416 - Kohei Suenaga

, Hiroyoshi Sekine, Ichiro Hasuo
:
Hyperstream processing systems: nonstandard modeling of continuous-time signals. 417-430 - Dimitrios Vytiniotis, Simon L. Peyton Jones, Koen Claessen, Dan Rosén:

HALO: haskell to logic through denotational semantics. 431-442
Synthesis & verification
- Matko Botincan, Domagoj Babic:

Sigma*: symbolic learning of input-output specifications. 443-456 - Filippo Bonchi

, Damien Pous
:
Checking NFA equivalence with bisimulations up to congruence. 457-468 - Ali Sinan Köksal, Yewen Pu, Saurabh Srivastava, Rastislav Bodík, Jasmin Fisher

, Nir Piterman
:
Synthesis of biological models from mutation experiments. 469-482
Compilation
- Ramakrishna Upadrasta

, Albert Cohen:
Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra. 483-496 - Tiark Rompf, Arvind K. Sujeeth, Nada Amin, Kevin J. Brown, Vojin Jovanovic, HyoukJoong Lee, Manohar Jonnalagedda, Kunle Olukotun

, Martin Odersky:
Optimizing data structures in high-level programs: new directions for extensible compilers based on staging. 497-510 - Michael D. Adams:

Principled parsing for indentation-sensitive languages: revisiting landin's offside rule. 511-522
Analysis & logics
- Aquinas Hobor, Jules Villard

:
The ramifications of sharing in data structures. 523-536 - Nishant Totla, Thomas Wies

:
Complete instantiation-based interpolation. 537-548 - Earl T. Barr

, Thanh Vo
, Vu Le, Zhendong Su
:
Automatic detection of floating-point exceptions. 549-560 - Ruy Ley-Wild, Aleksandar Nanevski:

Subjective auxiliary state for coarse-grained concurrency. 561-574

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














