default search action
19. ESOP 2010: Paphos, Cyprus (Part of ETAPS 2010)
- Andrew D. Gordon:
Programming Languages and Systems, 19th European Symposium on Programming, ESOP 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings. Lecture Notes in Computer Science 6012, Springer 2010, ISBN 978-3-642-11956-9 - Sam Lindley, Philip Wadler:
The Audacity of Hope: Thoughts on Reclaiming the Database Dream. 1 - David A. Naumann, Anindya Banerjee:
Dynamic Boundaries: Information Hiding by Second Order Framing with First Order Assertions. 2-22 - Assalé Adjé, Stéphane Gaubert, Eric Goubault:
Coupling Policy Iteration with Semi-definite Relaxation to Compute Accurate Numerical Invariants in Static Analysis. 23-42 - Torben Amtoft, John Hatcliff, Edwin Rodríguez:
Precise and Automated Contract-Based Reasoning for Verification and Certification of Information Flow Properties of Programs with Arrays. 43-63 - Aslan Askarov, Andrew C. Myers:
A Semantic Framework for Declassification and Endorsement. 64-84 - Robert Atkey:
Amortised Resource Analysis with Separation Logic. 85-103 - Patrick Baillot, Marco Gaboardi, Virgile Mogbil:
A PolyTime Functional Language from Light Linear Logic. 104-124 - Jean-Philippe Bernardy, Patrik Jansson, Koen Claessen:
Testing Polymorphic Properties. 125-144 - Sandrine Blazy, Benoît Robillard, Andrew W. Appel:
Formal Verification of Coalescing Graph-Coloring Register Allocation. 145-164 - Gérard Boudol, Gustavo Petri:
A Theory of Speculative Computation. 165-184 - Vijay D'Silva:
Propositional Interpolation and Abstract Interpretation. 185-204 - Ugo Dal Lago, Ulrich Schöpp:
Functional Programming in Sublinear Space. 205-225 - Jyotirmoy V. Deshmukh, G. Ramalingam, Venkatesh Prasad Ranganath, Kapil Vaswani:
Logical Concurrency Control from Sequential Proofs. 226-245 - Isil Dillig, Thomas Dillig, Alex Aiken:
Fluid Updates: Beyond Strong vs. Weak Updates. 246-266 - Rodrigo Ferreira, Xinyu Feng, Zhong Shao:
Parameterized Memory Models and Concurrent Separation Logic. 267-286 - Jan Hoffmann, Martin Hofmann:
Amortized Resource Analysis with Polynomial Potential. 287-306 - Radha Jagadeesan, Corin Pitcher, James Riely:
Generative Operational Semantics for Relaxed Memory Models. 307-326 - Dave King, Susmit Jha, Divya Muthukumaran, Trent Jaeger, Somesh Jha, Sanjit A. Seshia:
Automating Security Mediation Placement. 327-344 - Adam Koprowski, Henri Binsztok:
TRX: A Formally Verified Parser Interpreter. 345-365 - Ivan Lanese, Cátia Vaz, Carla Ferreira:
On the Expressive Power of Primitives for Compensation Handling. 366-386 - Vincent Laviron, Bor-Yuh Evan Chang, Xavier Rival:
Separating Shape Graphs. 387-406 - K. Rustan M. Leino, Peter Müller, Jan Smans:
Deadlock-Free Channels and Locks. 407-426 - Andreas Lochbihler:
Verifying a Compiler for Java Threads. 427-447 - Kazutaka Matsuda, Shin-Cheng Mu, Zhenjiang Hu, Masato Takeichi:
A Grammar-Based Approach to Invertible Programs. 448-467 - Matthew L. Meola, David Walker:
Faulty Logic: Reasoning about Fault Tolerant Programs. 468-487 - Keiko Nakata, Tarmo Uustalu:
A Hoare Logic for the Coinductive Trace-Based Big-Step Semantics of While. 488-506 - Robert Soulé, Martin Hirzel, Robert Grimm, Bugra Gedik, Henrique Andrade, Vibhore Kumar, Kun-Lung Wu:
A Universal Calculus for Stream Processing Languages. 507-528 - Nikhil Swamy, Juan Chen, Ravi Chugh:
Enforcing Stateful Authorization and Information Flow Policies in Fine. 529-549 - Jesse A. Tov, Riccardo Pucella:
Stateful Contracts for Affine Types. 550-569 - Dimitrios Vardoulakis, Olin Shivers:
CFA2: A Context-Free Approach to Control-Flow Analysis. 570-589 - Alexander Wenner:
Weighted Dynamic Pushdown Networks. 590-609 - John Wickerson, Mike Dodds, Matthew J. Parkinson:
Explicit Stabilisation for Modular Rely-Guarantee Reasoning. 610-629
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.