POPL A*

53 papers

YearTitle / Authors
2011A kripke logical relation between ML and assembly.
Chung-Kil Hur, Derek Dreyer
2011A parametric segmentation functor for fully automatic and scalable array content analysis.
Patrick Cousot, Radhia Cousot, Francesco Logozzo
2011A separation logic for refining concurrent objects.
Aaron Joseph Turon, Mitchell Wand
2011A shape analysis for optimizing parallel graph programs.
Dimitrios Prountzos, Roman Manevich, Keshav Pingali, Kathryn S. McKinley
2011A technique for the effective and automatic reuse of classical compiler optimizations on multithreaded code.
Pramod G. Joisha, Robert S. Schreiber, Prithviraj Banerjee, Hans-Juergen Boehm, Dhruva R. Chakrabarti
2011A typed store-passing translation for general references.
François Pottier
2011Automating string processing in spreadsheets using input-output examples.
Sumit Gulwani
2011Bisimulation for quantum processes.
Yuan Feng, Runyao Duan, Mingsheng Ying
2011Blame for all.
Amal Ahmed, Robert Bruce Findler, Jeremy G. Siek, Philip Wadler
2011Calling context abstraction with shapes.
Xavier Rival, Bor-Yuh Evan Chang
2011Complexity of pattern-based verification for multithreaded programs.
Javier Esparza, Pierre Ganty
2011Correct blame for contracts: no more scapegoating.
Christos Dimoulas, Robert Bruce Findler, Cormac Flanagan, Matthias Felleisen
2011Decidable logics combining heap structures and data.
P. Madhusudan, Gennaro Parlato, Xiaokang Qiu
2011Delay-bounded scheduling.
Michael Emmi, Shaz Qadeer, Zvonimir Rakamaric
2011Dynamic inference of static types for ruby.
Jong-hoon (David) An, Avik Chaudhuri, Jeffrey S. Foster, Michael Hicks
2011Dynamic multirole session types.
Pierre-Malo Deniélou, Nobuko Yoshida
2011EigenCFA: accelerating flow analysis with GPUs.
Tarun Prabhu, Shreyas Ramalingam, Matthew Might, Mary W. Hall
2011Expressive modular fine-grained concurrency specification.
Bart Jacobs, Frank Piessens
2011Formal verification of object layout for c++ multiple inheritance.
Tahina Ramananandro, Gabriel Dos Reis, Xavier Leroy
2011Fresh-register automata.
Nikos Tzevelekos
2011Generative type abstraction and type-level computation.
Stephanie Weirich, Dimitrios Vytiniotis, Simon L. Peyton Jones, Steve Zdancewic
2011Geometry of synthesis III: resource management through type inference.
Dan R. Ghica, Alex I. Smith
2011Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated.
Hagit Attiya, Rachid Guerraoui, Danny Hendler, Petr Kuznetsov, Maged M. Michael, Martin T. Vechev
2011Learning minimal abstractions.
Percy Liang, Omer Tripp, Mayur Naik
2011Loop transformations: convexity, pruning and optimization.
Louis-Noël Pouchet, Uday Bondhugula, Cédric Bastoul, Albert Cohen, J. Ramanujam, P. Sadayappan, Nicolas Vasilache
2011Making prophecies with decision predicates.
Byron Cook, Eric Koskinen
2011Mathematizing C++ concurrency.
Mark Batty, Scott Owens, Susmit Sarkar, Peter Sewell, Tjark Weber
2011Modular reasoning for deterministic parallelism.
Mike Dodds, Suresh Jagannathan, Matthew J. Parkinson
2011Multivariate amortized resource analysis.
Jan Hoffmann, Klaus Aehlig, Martin Hofmann
2011On interference abstractions.
Nishant Sinha, Chao Wang
2011Pick your contexts well: understanding object-sensitivity.
Yannis Smaragdakis, Martin Bravenboer, Ondrej Lhoták
2011Points-to analysis with efficient strong updates.
Ondrej Lhoták, Kwok-Chiang Andrew Chung
2011Practical affine types.
Jesse A. Tov, Riccardo Pucella
2011Precise reasoning for programs using containers.
Isil Dillig, Thomas Dillig, Alex Aiken
2011Predicate abstraction and refinement for verifying multi-threaded programs.
Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenko
2011Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, Austin, TX, USA, January 26-28, 2011
Thomas Ball, Mooly Sagiv
2011Regular expression containment: coinductive axiomatization and computational interpretation.
Fritz Henglein, Lasse Nielsen
2011Relaxed-memory concurrency and verified compilation.
Jaroslav Sevcík, Viktor Vafeiadis, Francesco Zappa Nardelli, Suresh Jagannathan, Peter Sewell
2011Resourceable, retargetable, modular instruction selection using a machine-independent, type-based tiling of low-level intermediate code.
Norman Ramsey, João Dias
2011Robin Milner 1934--2010: verification, languages, and concurrency.
Andrew D. Gordon, Robert Harper, John Harrison, Alan Jeffrey, Peter Sewell
2011Safe nondeterminism in a deterministic-by-default parallel language.
Robert L. Bocchino Jr., Stephen Heumann, Nima Honarmand, Sarita V. Adve, Vikram S. Adve, Adam Welc, Tatiana Shpeisman
2011Space overhead bounds for dynamic memory management with partial compaction.
Anna Bendersky, Erez Petrank
2011Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol.
Martin D. Schwarz, Helmut Seidl, Vesal Vojdani, Peter Lammich, Markus Müller-Olm
2011Static analysis of multi-staged programs via unstaging translation.
Wontae Choi, Baris Aktemur, Kwangkeun Yi, Makoto Tatsuta
2011Step-indexed kripke models over recursive worlds.
Lars Birkedal, Bernhard Reus, Jan Schwinghammer, Kristian Støvring, Jacob Thamsborg, Hongseok Yang
2011Streaming transducers for algorithmic verification of single-pass list-processing programs.
Rajeev Alur, Pavol Cerný
2011Symmetric lenses.
Martin Hofmann, Benjamin C. Pierce, Daniel Wagner
2011The design of kodu: a tiny visual programming language for children on the Xbox 360.
Matthew MacLaurin
2011The essence of compiling with traces.
Shu-Yu Guo, Jens Palsberg
2011The tree width of auxiliary storage.
P. Madhusudan, Gennaro Parlato
2011Vector addition system reachability problem: a short self-contained proof.
Jérôme Leroux
2011Verified squared: does critical software deserve verified tools?
Xavier Leroy
2011Verifying higher-order functional programs with pattern-matching algebraic data types.
C.-H. Luke Ong, Steven J. Ramsay