- Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors Michel Raynal Julien Stainer Fri 02 March 2012
- Equivalence of deterministic one-counter automata is NL-complete Stanislav Böhm Stefan Göller Petr Jancar Fri 02 March 2012
- Fast approximation algorithms for the diameter and radius of sparse graphs Liam Roditty Virginia Vassilevska Williams Fri 02 March 2012
- Jalangi: a selective record-replay and dynamic analysis framework for JavaScript Koushik Sen Swaroop Kalasapur Tasneem Brutch Simon Gibbs Fri 02 March 2012
- Dependent Type Theory for Verification of Information Flow and Access Control Policies Aleksandar Nanevski Anindya Banerjee Deepak Garg Fri 02 March 2012
- Fast algorithms for Dyck-CFL-reachability with applications to alias analysis Qirun Zhang Michael R. Lyu Hao Yuan Zhendong Su Fri 02 March 2012
- Verifying higher-order programs with the dijkstra monad Nikhil Swamy Joel Weinberger Cole Schlesinger Juan Chen Benjamin Livshits Fri 02 March 2012
- Probabilistic Relational Reasoning for Differential Privacy Gilles Barthe Boris Köpf Federico Olmedo Santiago Zanella-Béguelin Fri 02 March 2012
- Automated feedback generation for introductory programming assignments Rishabh Singh Sumit Gulwani Armando Solar-Lezama Fri 02 March 2012
- Modular monadic meta-theory Benjamin Delaware Steven Keuchel Tom Schrijvers Bruno C.d.S. Oliveira Fri 02 March 2012
- Higher-order functional reactive programming without spacetime leaks Neelakantan R. Krishnaswami Fri 02 March 2012
- Hoare-style reasoning with (algebraic) continuations Germán Andrés Delbianco Aleksandar Nanevski Fri 02 March 2012
- PLDI 2002 Cormac Flanagan K. Rustan M. Leino Mark Lillibridge Greg Nelson James B. Saxe Raymie Stata Fri 02 March 2012
- Sensitivity analysis using type-based constraints Loris DtextquotesingleAntoni Marco Gaboardi Emilio Jesús Gallego Arias Andreas Haeberlen Benjamin Pierce Fri 02 March 2012
- Coq Andrew Kennedy Nick Benton Jonas B. Jensen Pierre-Evariste Dagand Fri 02 March 2012
- Most Tensor Problems Are NP-Hard Christopher J. Hillar Lek-Heng Lim Fri 02 March 2012
- Analysis of Recursively Parallel Programs Ahmed Bouajjani Michael Emmi Fri 02 March 2012
- Polymorphic functions with set-theoretic types Giuseppe Castagna Kim Nguyen Zhiwu Xu Hyeonseung Im Sergueï Lenglet Luca Padovani Fri 02 March 2012
- Parametric effect monads and semantics of effect systems Shin-ya Katsumata Fri 02 March 2012
- NetKAT Carolyn Jane Anderson Nate Foster Arjun Guha Jean-Baptiste Jeannin Dexter Kozen Cole Schlesinger David Walker Fri 02 March 2012
Library Size: 13G (12943 entries),
Last Updated: Apr 05, 2026, 21:58:59,
Build Time: N/A
