Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Lennart Beringer
2010 – today
- 2013
[j8]Lennart Beringer, Robert Grabowski, Martin Hofmann: Verifying pointer and string analyses with region type systems. Computer Languages, Systems & Structures 39(2): 49-65 (2013)- 2012
- [c20]
- [c19]Gordon Stewart, Lennart Beringer, Andrew W. Appel: Verified heap theorem prover by paramodulation. ICFP 2012: 3-14
- [c18]Torben Amtoft, Josiah Dodds, Zhi Zhang, Andrew W. Appel, Lennart Beringer, John Hatcliff, Xinming Ou, Andrew Cousino: A Certificate Infrastructure for Machine-Checked Proofs of Conditional Information Flow. POST 2012: 369-389
- [c17]Lennart Beringer, Randall Brukardt, Thomas Plum, S. Tucker Taft: Panel on compiler certification: should we trust our compiler? HILT 2012: 103-104
- [e1]Lennart Beringer, Amy P. Felty (Eds.): Interactive Theorem Proving - Third International Conference, ITP 2012, Princeton, NJ, USA, August 13-15, 2012. Proceedings. Lecture Notes in Computer Science 7406, Springer 2012, ISBN 978-3-642-32346-1
- 2011
- [c16]
- 2010
- [j7]
- [c15]Lennart Beringer, Robert Grabowski, Martin Hofmann: Verifying Pointer and String Analyses with Region Type Systems. LPAR (Dakar) 2010: 82-102
2000 – 2009
- 2009
- [c14]Robert Grabowski, Lennart Beringer: Noninterference with Dynamic Security Domains and Policies. ASIAN 2009: 54-68
- [c13]Hans-Wolfgang Loidl, Kenneth MacKenzie, Steffen Jost, Lennart Beringer: A Proof-Carrying-Code Infrastructure for Resources. LADC 2009: 127-134
- [c12]Nick Benton, Andrew Kennedy, Lennart Beringer, Martin Hofmann: Relational semantics for effect-based program transformations: higher-order store. PPDP 2009: 301-312
- 2008
- [j6]Lennart Beringer, Martin Hofmann: Secure information flow and program logics. Archive of Formal Proofs 2008 (2008)
- [j5]Lennart Beringer, Martin Hofmann: A Bytecode Logic for JML and Types. Archive of Formal Proofs 2008 (2008)
- 2007
- [j4]Lennart Beringer: Functional Elimination of Phi-instructions. Electr. Notes Theor. Comput. Sci. 176(3): 3-20 (2007)
- [j3]David Aspinall, Lennart Beringer, Alberto Momigliano: Optimisation Validation. Electr. Notes Theor. Comput. Sci. 176(3): 37-59 (2007)
- [j2]David Aspinall, Lennart Beringer, Martin Hofmann, Hans-Wolfgang Loidl, Alberto Momigliano: A program logic for resources. Theor. Comput. Sci. 389(3): 411-445 (2007)
- [c11]
- [c10]Lennart Beringer, Martin Hofmann, Mariela Pavlova: Certification Using the Mobius Base Logic. FMCO 2007: 25-51
- [c9]Nick Benton, Andrew Kennedy, Lennart Beringer, Martin Hofmann: Relational semantics for effect-based program transformations with dynamic allocation. PPDP 2007: 87-96
- 2006
- [c8]Nick Benton, Andrew Kennedy, Martin Hofmann, Lennart Beringer: Reading, Writing and Relations. APLAS 2006: 114-130
- [c7]
- [c6]Gilles Barthe, Lennart Beringer, Pierre Crégut, Benjamin Grégoire, Martin Hofmann, Peter Müller, Erik Poll, Germán Puebla, Ian Stark, Eric Vétillard: MOBIUS: Mobility, Ubiquity, Security. TGC 2006: 10-29
- 2005
- [c5]Donald Sannella, Martin Hofmann, David Aspinall, Stephen Gilmore, Ian Stark, Lennart Beringer, Hans-Wolfgang Loidl, Kenneth MacKenzie, Alberto Momigliano, Olha Shkaravska: Mobile Resource Guarantees (project evaluation paper). Trends in Functional Programming 2005: 211-226
- 2004
- [c4]Lennart Beringer, Martin Hofmann, Alberto Momigliano, Olha Shkaravska: Automatic Certification of Heap Consumption. LPAR 2004: 347-362
- [c3]David Aspinall, Lennart Beringer, Martin Hofmann, Hans-Wolfgang Loidl, Alberto Momigliano: A Program Logic for Resource Verification. TPHOLs 2004: 34-49
- 2003
- [j1]Lennart Beringer, Kenneth MacKenzie, Ian Stark: Grail: a functional form for imperative mobile code. Electr. Notes Theor. Comput. Sci. 85(1): 3-23 (2003)
- [c2]
- 2001
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-22 21:53 CEST by the dblp team