Abstract is missing.
- Reconfigurable asynchronous logic automata: (RALA)Neil Gershenfeld, David Dalrymple, Kailiang Chen, Ara Knaian, Forrest Green, Erik D. Demaine, Scott Greenwald, Peter Schmidt-Nielsen. 1-6 [doi]
- On the verification problem for weak memory modelsMohamed Faouzi Atig, Ahmed Bouajjani, Sebastian Burckhardt, Madanlal Musuvathi. 7-18 [doi]
- Coarse-grained transactionsEric Koskinen, Matthew Parkinson, Maurice Herlihy. 19-30 [doi]
- Sequential verification of serializabilityHagit Attiya, Ganesan Ramalingam, Noam Rinetzky. 31-42 [doi]
- Compositional may-must program analysis: unleashing the power of alternationPatrice Godefroid, Aditya V. Nori, Sriram K. Rajamani, SaiDeep Tetali. 43-56 [doi]
- Continuity analysis of programsSwarat Chaudhuri, Sumit Gulwani, Roberto Lublinerman. 57-70 [doi]
- Program analysis via satisfiability modulo path programsWilliam R. Harris, Sriram Sankaranarayanan, Franjo Ivancic, Aarti Gupta. 71-82 [doi]
- A simple, verified validator for software pipeliningJean-Baptiste Tristan, Xavier Leroy. 83-92 [doi]
- A verified compiler for an impure functional languageAdam J. Chlipala. 93-106 [doi]
- Verified just-in-time compiler on x86Magnus O. Myreen. 107-118 [doi]
- Dependent types from counterexamplesTachio Terauchi. 119-130 [doi]
- Low-level liquid typesPatrick Maxim Rondon, Ming Kawaguchi, Ranjit Jhala. 131-144 [doi]
- Type inference for datalog with complex type hierarchiesMax Schäfer, Oege de Moor. 145-156 [doi]
- From Boolean to quantitative notions of correctnessThomas A. Henzinger. 157-158 [doi]
- Nominal system TAndrew M. Pitts. 159-170 [doi]
- A theory of indirection via approximationAquinas Hobor, Robert Dockins, Andrew W. Appel. 171-184 [doi]
- A relational modal logic for higher-order stateful ADTsDerek Dreyer, Georg Neis, Andreas Rossberg, Lars Birkedal. 185-198 [doi]
- Decision procedures for algebraic data types with abstractionsPhilippe Suter, Mirco Dotta, Viktor Kuncak. 199-210 [doi]
- Automatic numeric abstractions for heap-manipulating programsStephen Magill, Ming-Hsien Tsai, Peter Lee, Yih-Kuen Tsay. 211-222 [doi]
- Static determination of quantitative resource usage for higher-order programsSteffen Jost, Kevin Hammond, Hans-Wolfgang Loidl, Martin Hofmann. 223-236 [doi]
- Toward a verified relational database management systemJ. Gregory Malecha, Greg Morrisett, Avraham Shinnar, Ryan Wisnesky. 237-248 [doi]
- Counterexample-guided focusAndreas Podelski, Thomas Wies. 249-260 [doi]
- Structuring the verification of heap-manipulating programsAleksandar Nanevski, Viktor Vafeiadis, Josh Berdine. 261-274 [doi]
- Dependent types and program equivalenceLimin Jia, Jianzhou Zhao, Vilhelm Sjöberg, Stephanie Weirich. 275-286 [doi]
- Pure subtype systemsDeLesley S. Hutchins. 287-298 [doi]
- Modular session types for distributed object-oriented programmingSimon J. Gay, Vasco Thudichum Vasconcelos, António Ravara, Nils Gesbert, Alexandre Z. Caldeira. 299-312 [doi]
- From program verification to program synthesisSaurabh Srivastava, Sumit Gulwani, Jeffrey S. Foster. 313-326 [doi]
- Abstraction-guided synthesis of synchronizationMartin T. Vechev, Eran Yahav, Greta Yorsh. 327-338 [doi]
- Programming with angelic nondeterminismRastislav BodÃk, Satish Chandra, Joel Galenson, Doug Kimelman, Nicholas Tung, Shaon Barman, Casey Rodarmor. 339-352 [doi]
- Contracts made manifestMichael Greenberg, Benjamin C. Pierce, Stephanie Weirich. 353-364 [doi]
- Threesomes, with and without blameJeremy G. Siek, Philip Wadler. 365-376 [doi]
- Integrating typed and untyped code in a scripting languageTobias Wrigstad, Francesco Zappa Nardelli, Sylvain Lebresne, Johan Östlund, Jan Vitek. 377-388 [doi]
- Generating compiler optimizations from proofsRoss Tate, Michael Stepp, Sorin Lerner. 389-402 [doi]
- Automatically generating instruction selectors using declarative machine descriptionsJoão Dias, Norman Ramsey. 403-416 [doi]
- Semantics and algorithms for data-dependent grammarsTrevor Jim, Yitzhak Mandelbaum, David Walker. 417-430 [doi]
- Paralocks: role-based information flow control and beyondNiklas Broberg, David Sands. 431-444 [doi]
- Modular verification of security protocol code by typingKarthikeyan Bhargavan, Cédric Fournet, Andrew D. Gordon. 445-456 [doi]
- Dynamically checking ownership policies in concurrent c/c++ programsJean-Phillipe Martin, Michael Hicks, Manuel Costa, Periklis Akritidis, Miguel Castro. 457-470 [doi]
- Nested interpolantsMatthias Heizmann, Jochen Hoenicke, Andreas Podelski. 471-482 [doi]
- Monads in actionAndrzej Filinski. 483-494 [doi]
- Higher-order multi-parameter tree transducers and recursion schemes for program verificationNaoki Kobayashi, Naoshi Tabuchi, Hiroshi Unno. 495-508 [doi]