Principles of Programming Languages - researchr conference series publications

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 100 from 1704

2017

Dijkstra monads for freeDanel Ahman, Catalin Hritcu, Kenji Maillard, Guido Martinez, Gordon D. Plotkin, Jonathan Protzenko, Aseem Rastogi, Nikhil Swamy. POPL 2017: 515-529 [doi]

Ogre and Pythia: an invariance proof method for weak consistency modelsJade Alglave, Patrick Cousot. POPL 2017: 3-18 [doi]

LMS-Verify: abstraction without regret for verified systems programming Nada Amin, Tiark Rompf. POPL 2017: 859-873 [doi]

Type soundness proofs with definitional interpreters Nada Amin, Tiark Rompf. POPL 2017: 666-679 [doi]

Computational higher-dimensional type theoryCarlo Angiuli, Robert Harper, Todd Wilson. POPL 2017: 680-693 [doi]

Hypercollecting semantics and its application to static analysis of information flowMounir Assaf, David A. Naumann, Julien Signoles, Eric Totel, Frédéric Tronel. POPL 2017: 874-887 [doi]

Coupling proofs are probabilistic product programsGilles Barthe, Benjamin Grégoire, Justin Hsu, Pierre-Yves Strub. POPL 2017: 161-174 [doi]

On verifying causal consistencyAhmed Bouajjani, Constantin Enea, Rachid Guerraoui, Jad Hamza. POPL 2017: 626-638 [doi]

Typed self-evaluation via intensional type functionsMatt Brown, Jens Palsberg. POPL 2017: 415-428 [doi]

Serializability for eventual consistency: criterion, analysis, and applicationsLucas Brutschy, Dimitar Dimitrov, Peter Müller 0001, Martin T. Vechev. POPL 2017: 458-472 [doi]

Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, January 18-20, 2017Giuseppe Castagna, Andrew D. Gordon, editors, ACM, 2017. [doi]

Type systems as macrosStephen Chang, Alex Knauth, Ben Greenman. POPL 2017: 694-705 [doi]

Stochastic invariants for probabilistic terminationKrishnendu Chatterjee, Petr Novotný, Dorde Zikelic. POPL 2017: 145-160 [doi]

Rigorous floating-point mixed-precision tuningWei-Fan Chiang, Mark Baranowski, Ian Briggs, Alexey Solovyev, Ganesh Gopalakrishnan, Zvonimir Rakamaric. POPL 2017: 300-315 [doi]

Automatically generating the dynamic semantics of gradually typed languagesMatteo Cimini, Jeremy G. Siek. POPL 2017: 789-803 [doi]

Modules, abstraction, and parametric polymorphismKarl Crary. POPL 2017: 100-113 [doi]

Monadic second-order logic on finite sequencesLoris D'Antoni, Margus Veanes. POPL 2017: 232-245 [doi]

A semantic account of metric preservationArthur Azevedo de Amorim, Marco Gaboardi, Justin Hsu, Shin-ya Katsumata, Ikram Cherigui. POPL 2017: 545-556 [doi]

Polymorphism, subtyping, and type inference in MLsubStephen Dolan, Alan Mycroft. POPL 2017: 60-72 [doi]

Intersection type calculi of bounded dimensionAndrej Dudenhefner, Jakob Rehof. POPL 2017: 653-665 [doi]

Component-based synthesis for complex APIsYu Feng, Ruben Martins, Yuepeng Wang 0001, Isil Dillig, Thomas W. Reps. POPL 2017: 599-612 [doi]

Mixed-size concurrency: ARM, POWER, C/C++11, and SCShaked Flur, Susmit Sarkar, Christopher Pulte, Kyndylan Nienhuis, Luc Maranget, Kathryn E. Gray, Ali Sezgin, Mark Batty, Peter Sewell. POPL 2017: 429-442 [doi]

A posteriori environment analysis with Pushdown Delta CFAKimball Germane, Matthew Might. POPL 2017: 19-31 [doi]

Java generics are turing completeRadu Grigore. POPL 2017: 73-85 [doi]

Thread modularity at many levels: a pearl in compositional verificationJochen Hoenicke, Rupak Majumdar, Andreas Podelski. POPL 2017: 473-485 [doi]

Towards automatic resource bound analysis for OCamlJan Hoffmann, Ankush Das, Shu-Chun Weng. POPL 2017: 359-373 [doi]

The exp-log normal form of types: decomposing extensional equality and representing terms compactlyDanko Ilik. POPL 2017: 387-399 [doi]

Sums of uncertainty: refinements go gradualKhurram A. Jafery, Joshua Dunfield. POPL 2017: 804-817 [doi]

A promising semantics for relaxed-memory concurrencyJeehoon Kang, Chung-Kil Hur, Ori Lahav, Viktor Vafeiadis, Derek Dreyer. POPL 2017: 175-189 [doi]

Stream fusion, to completenessOleg Kiselyov, Aggelos Biboudis, Nick Palladinos, Yannis Smaragdakis. POPL 2017: 285-299 [doi]

On the relationship between higher-order recursion schemes and higher-order fixpoint logicNaoki Kobayashi, Étienne Lozes, Florian Bruse. POPL 2017: 246-259 [doi]

A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithmsIgor V. Konnov, Marijana Lazic, Helmut Veith, Josef Widder. POPL 2017: 719-734 [doi]

LOIS: syntax and semanticsEryk Kopczynski, Szymon Torunczyk. POPL 2017: 586-598 [doi]

Coming to terms with quantified reasoningLaura Kovács, Simon Robillard, Andrei Voronkov. POPL 2017: 260-270 [doi]

Interactive proofs in higher-order concurrent separation logicRobbert Krebbers, Amin Timany, Lars Birkedal. POPL 2017: 205-217 [doi]

A relational model of types-and-effects in higher-order concurrent separation logicMorten Krogh-Jespersen, Kasper Svendsen, Lars Birkedal. POPL 2017: 218-231 [doi]

Parallel functional arraysAnanya Kumar, Guy E. Blelloch, Robert Harper. POPL 2017: 706-718 [doi]

The geometry of parallelism: classical, probabilistic, and quantum effectsUgo Dal Lago, Claudia Faggian, Benoît Valiron, Akira Yoshimizu. POPL 2017: 833-845 [doi]

Beginner's luck: a language for property-based generatorsLeonidas Lampropoulos, Diane Gallois-Wong, Catalin Hritcu, John Hughes, Benjamin C. Pierce, Li-yao Xia. POPL 2017: 114-129 [doi]

Fencing off go: liveness and safety for channel-based programmingJulien Lange, Nicholas Ng, Bernardo Toninho, Nobuko Yoshida. POPL 2017: 748-761 [doi]

Gradual refinement typesNico Lehmann, Éric Tanter. POPL 2017: 775-788 [doi]

Type directed compilation of row-typed algebraic effectsDaan Leijen. POPL 2017: 486-499 [doi]

Contextual isomorphismsPaul Blain Levy. POPL 2017: 400-414 [doi]

Semantic-directed clumping of disjunctive abstract statesHuisong Li, Francois Berenger, Bor-Yuh Evan Chang, Xavier Rival. POPL 2017: 32-45 [doi]

Dynamic race detection for C++11Christopher Lidbury, Alastair F. Donaldson. POPL 2017: 443-457 [doi]

Do be do be doSam Lindley, Conor McBride, Craig McLaughlin. POPL 2017: 500-514 [doi]

Analyzing divergence in bisimulation semanticsXinxin Liu, Tingting Yu, Wenhui Zhang. POPL 2017: 735-747 [doi]

Contract-based resource verification for higher-order functions with memoizationRavichandhran Madhavan, Sumith Kulal, Viktor Kuncak. POPL 2017: 330-343 [doi]

Learning nominal automataJoshua Moerman, Matteo Sammartino, Alexandra Silva 0001, Bartek Klin, Michal Szynwelski. POPL 2017: 613-625 [doi]

Hazelnut: a bidirectionally typed structure editor calculusCyrus Omar, Ian Voysey, Michael Hilton, Jonathan Aldrich, Matthew A. Hammer. POPL 2017: 86-99 [doi]

QWIRE: a core language for quantum circuitsJennifer Paykin, Robert Rand 0001, Steve Zdancewic. POPL 2017: 846-858 [doi]

Deciding equivalence with sums and the empty typeGabriel Scherer. POPL 2017: 374-386 [doi]

A program optimization for automatic database result cachingZiv Scully, Adam Chlipala. POPL 2017: 271-284 [doi]

Stateful manifest contractsTaro Sekiyama, Atsushi Igarashi. POPL 2017: 530-544 [doi]

Exact Bayesian inference by symbolic disintegrationChung-chieh Shan, Norman Ramsey. POPL 2017: 130-144 [doi]

Fast polyhedra abstract domainGagandeep Singh, Markus Püschel, Martin T. Vechev. POPL 2017: 46-59 [doi]

Cantor meets scott: semantic foundations for probabilistic networksSteffen Smolka, Praveen Kumar, Nate Foster, Dexter Kozen, Alexandra Silva 0001. POPL 2017: 557-571 [doi]

Complexity verification using guided theorem enumerationAkhilesh Srikanth, Burak Sahin, William R. Harris. POPL 2017: 639-652 [doi]

Genesis: synthesizing forwarding tables in multi-tenant networksKausik Subramanian, Loris D'Antoni, Aditya Akella. POPL 2017: 572-585 [doi]

Rust: from POPL to practice (keynote)Aaron Turon. POPL 2017: 2 [doi]

Big types in little runtime: open-world soundness and collaborative blame for gradual type systems Michael M. Vitousek, Cameron Swords, Jeremy G. Siek. POPL 2017: 762-774 [doi]

The influence of dependent types (keynote)Stephanie Weirich. POPL 2017: 1 [doi]

Automatically comparing memory consistency modelsJohn Wickerson, Mark Batty, Tyler Sorensen, George A. Constantinides. POPL 2017: 190-204 [doi]

Invariants of quantum programs: characterisations and generationMingsheng Ying, Shenggang Ying, Xiaodi Wu. POPL 2017: 818-832 [doi]

Context-sensitive data-dependence analysis via linear conjunctive language reachabilityQirun Zhang, Zhendong Su. POPL 2017: 344-358 [doi]

LightDP: towards automating differential privacy proofsDanfeng Zhang, Daniel Kifer. POPL 2017: 888-901 [doi]

Relational cost analysisEzgi Çiçek, Gilles Barthe, Marco Gaboardi, Deepak Garg 0001, Jan Hoffmann. POPL 2017: 316-329 [doi]

2016

Principal type inference for GADTsSheng Chen 0008, Martin Erwig. POPL 2016: 416-428 [doi]

Type theory in type theory using quotient inductive typesThorsten Altenkirch, Ambrus Kaposi. POPL 2016: 18-29 [doi]

Printing floating-point numbers: a faster, always correct methodMarc Andrysco, Ranjit Jhala, Sorin Lerner. POPL 2016: 555-567 [doi]

SMO: an integrated approach to intra-array and inter-array storage optimizationSomashekaracharya G. Bhaskaracharya, Uday Bondhugula, Albert Cohen 0001. POPL 2016: 526-538 [doi]

Fabular: regression formulas as probabilistic programmingJohannes Borgström, Andrew D. Gordon, Long Ouyang, Claudio V. Russo, Adam Scibior, Marcin Szymczak. POPL 2016: 271-283 [doi]

Model checking for symbolic-heap separation logic with inductive predicatesJames Brotherston, Nikos Gorogiannis, Max I. Kanovich, Reuben Rowe. POPL 2016: 84-96 [doi]

Breaking through the normalization barrier: a self-interpreter for f-omegaMatt Brown, Jens Palsberg. POPL 2016: 5-17 [doi]

System f-omega with equirecursive types for datatype-generic programmingYufei Cai, Paolo G. Giarrusso, Klaus Ostermann. POPL 2016: 30-43 [doi]

The gradualizer: a methodology and algorithm for generating gradual type systemsMatteo Cimini, Jeremy G. Siek. POPL 2016: 443-455 [doi]

A theory of effects and resources: adjunction models and polarised calculiPierre-Louis Curien, Marcelo P. Fiore, Guillaume Munch-Maccagnoni. POPL 2016: 44-56 [doi]

PSync: a partially synchronous language for fault-tolerant distributed algorithmsCezara Dragoi, Thomas A. Henzinger, Damien Zufferey. POPL 2016: 400-415 [doi]

Symbolic abstract data type inferenceMichael Emmi, Constantin Enea. POPL 2016: 513-525 [doi]

Example-directed synthesis: a type-theoretic interpretationJonathan Frankle, Peter-Michael Osera, David Walker, Steve Zdancewic. POPL 2016: 802-815 [doi]

Abstracting gradual typingRonald Garcia, Alison M. Clark, Éric Tanter. POPL 2016: 429-442 [doi]

Pushdown control-flow analysis for freeThomas Gilray, Steven Lyde, Michael D. Adams 0001, Matthew Might, David Van Horn. POPL 2016: 691-704 [doi]

Kleenex: compiling nondeterministic transducers to deterministic streaming transducersNiels Bjørn Bugge Grathwohl, Fritz Henglein, Ulrik Terp Rasmussen, Kristoffer Aalund Søholm, Sebastian Paaske Tørholm. POPL 2016: 284-297 [doi]

Abstraction refinement guided by a learnt probabilistic modelRadu Grigore, Hongseok Yang. POPL 2016: 485-498 [doi]

Unboundedness and downward closures of higher-order pushdown automataMatthew Hague, Jonathan Kochems, C.-H. Luke Ong. POPL 2016: 151-163 [doi]

Monitors and blame assignment for higher-order session typesLimin Jia, Hannah Gommerstadt, Frank Pfenning. POPL 2016: 582-594 [doi]

Estimating types in binaries using predictive modelingOmer Katz, Ran El-Yaniv, Eran Yahav. POPL 2016: 313-326 [doi]

The hardness of data packingRahman Lavaee. POPL 2016: 232-242 [doi]

Chapar: certified causally consistent distributed key-value storesMohsen Lesani, Christian J. Bell, Adam Chlipala. POPL 2016: 357-370 [doi]

String solving with word equations and transducers: towards a logic for analysing mutation XSSAnthony Widjaja Lin, Pablo Barceló. POPL 2016: 123-136 [doi]

Automatic patch generation by learning correct codeFan Long, Martin Rinard. POPL 2016: 298-312 [doi]

Sound type-dependent syntactic language extensionFlorian Lorenzen, Sebastian Erdweg. POPL 2016: 204-216 [doi]

Programming the world of uncertain things (keynote)Kathryn S. McKinley. POPL 2016: 1-2 [doi]

Synthesis of reactive controllers for hybrid systems (keynote)Richard M. Murray. POPL 2016: 3 [doi]

Effects as sessions, sessions as effectsDominic A. Orchard, Nobuko Yoshida. POPL 2016: 568-581 [doi]

Learning programs from noisy dataVeselin Raychev, Pavol Bielik, Martin T. Vechev, Andreas Krause. POPL 2016: 761-774 [doi]

Newtonian program analysis via tensor productThomas W. Reps, Emma Turetsky, Prathmesh Prabhu. POPL 2016: 663-677 [doi]

Environmental bisimulations for probabilistic higher-order languagesDavide Sangiorgi, Valeria Vignudelli. POPL 2016: 595-607 [doi]

Is sound gradual typing dead?Asumu Takikawa, Daniel Feltey, Ben Greenman, Max S. New, Jan Vitek, Matthias Felleisen. POPL 2016: 456-468 [doi]

Confluences in programming languages research (keynote)David Walker. POPL 2016: 4 [doi]

Links

Filter by Year

[-]
OR AND NOT 1

Filter by Tag

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top terms

[+]
OR AND NOT 1

Principles of Programming Languages (POPL)

Viewing Publication 1 - 100 from 1704

2017

2016

Links

Filter by Year [-]OR AND NOT 1

Filter by Tag [+]OR AND NOT 1

Filter by Author [+]OR AND NOT 1

Filter by Top terms [+]OR AND NOT 1

Principles of Programming Languages (POPL)

Viewing Publication 1 - 100 from 1704

2017

2016

Filter by Year

[-]
OR AND NOT 1

Filter by Tag

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top terms

[+]
OR AND NOT 1