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.
Martin Hofmann
Author information
- LMU München
Other persons with the same name
- Martin Hofmann 0002
- Martin Hofmann 0003
- Martin Hofmann 0005
- Martin Hofmann 0006
- Martin Hofmann 0007
- Martin Hofmann 0008 — University of Bamberg, Germany
- Martin Hofmann 0009 — Fraunhofer Institute for Algorithms and Scientific Computing, Germany
- Martin Hofmann 0010
- Martin Hofmann 0011 — TU München
- Martin Hofmann 0012 — Pädagogische Hochschule des Kantons St.Gallen
- Martin Hofmann 0013 — Institute of Sports Science, University of Magdeburg
- Martin Hofmann 0014 — University of Würzburg, Institute of Mathematics
- Martin Hofmann 0015 — Karlsruhe
2010 – today
- 2013
[j34]Lennart Beringer, Robert Grabowski, Martin Hofmann: Verifying pointer and string analyses with region type systems. Computer Languages, Systems & Structures 39(2): 49-65 (2013)- [c71]Martin Hofmann, Dulma Rodriguez: Automatic Type Inference for Amortised Heap-Space Analysis. ESOP 2013: 593-613
- [c70]Andrej Bauer, Martin Hofmann, Aleksandr Karbyshev: On Monadic Parametricity of Second-Order Functionals. FoSSaCS 2013: 225-240
- [c69]Martin Hofmann, Ramyaa Ramyaa, Ulrich Schöpp: Pure Pointer Programs and Tree Isomorphism. FoSSaCS 2013: 321-336
- [c68]Nick Benton, Martin Hofmann, Vivek Nigam: Proof-Relevant Logical Relations for Name Generation. TLCA 2013: 48-60
- 2012
- [j33]Jan Hoffmann, Klaus Aehlig, Martin Hofmann: Multivariate amortized resource analysis. ACM Trans. Program. Lang. Syst. 34(3): 14 (2012)
- [c67]
- [c66]
- [c65]
- [c64]
- [i3]Nick Benton, Martin Hofmann, Vivek Nigam: Abstract Effects and Proof-Relevant Logical Relations. CoRR abs/1212.5692 (2012)
- 2011
- [j32]Ugo Dal Lago, Martin Hofmann: Realizability models and implicit complexity. Theor. Comput. Sci. 412(20): 2029-2047 (2011)
- [c63]Robert Grabowski, Martin Hofmann, Keqin Li: Type-Based Enforcement of Secure Programming Guidelines - Code Injection Prevention at SAP. Formal Aspects in Security and Trust 2011: 182-197
- [c62]Jan Hoffmann, Klaus Aehlig, Martin Hofmann: Multivariate amortized resource analysis. POPL 2011: 357-370
- [c61]
- [e5]Martin Hofmann (Ed.): Foundations of Software Science and Computational Structures - 14th International Conference, FOSSACS 2011, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2011, Saarbrücken, Germany, March 26-April 3, 2011. Proceedings. Lecture Notes in Computer Science 6604, Springer 2011, ISBN 978-3-642-19804-5
- 2010
- [j31]Ugo Dal Lago, Martin Hofmann: Bounded Linear Logic, Revisited. Logical Methods in Computer Science 6(4) (2010)
- [j30]Ugo Dal Lago, Martin Hofmann: A Semantic Proof of Polytime Soundness of Light Affine Logic. Theory Comput. Syst. 46(4): 673-689 (2010)
- [j29]Martin Hofmann, Ulrich Schöpp: Pure pointer programs with iteration. ACM Trans. Comput. Log. 11(4) (2010)
- [c60]Jan Hoffmann, Martin Hofmann: Amortized Resource Analysis with Polymorphic Recursion and Partial Big-Step Operational Semantics. APLAS 2010: 172-187
- [c59]Jan Hoffmann, Martin Hofmann: Amortized Resource Analysis with Polynomial Potential. ESOP 2010: 287-306
- [c58]Martin Hofmann, Aleksandr Karbyshev, Helmut Seidl: What Is a Pure Functional? ICALP (2) 2010: 199-210
- [c57]Lennart Beringer, Robert Grabowski, Martin Hofmann: Verifying Pointer and String Analyses with Region Type Systems. LPAR (Dakar) 2010: 82-102
- [c56]Steffen Jost, Kevin Hammond, Hans-Wolfgang Loidl, Martin Hofmann: Static determination of quantitative resource usage for higher-order programs. POPL 2010: 223-236
- [c55]
- [c54]Martin Hofmann, Aleksandr Karbyshev, Helmut Seidl: Verifying a Local Generic Solver in Coq. SAS 2010: 340-355
- [e4]Martin Wirsing, Martin Hofmann, Axel Rauschmayer (Eds.): Trustworthly Global Computing - 5th International Symposium, TGC 2010, Munich, Germany, February 24-26, 2010, Revised Selected Papers. Lecture Notes in Computer Science 6084, Springer 2010, ISBN 978-3-642-15639-7
2000 – 2009
- 2009
- [c53]Martin Hofmann, Dulma Rodriguez: Efficient Type-Checking for Amortised Heap-Space Analysis. CSL 2009: 317-331
- [c52]Steffen Jost, Hans-Wolfgang Loidl, Kevin Hammond, Norman Scaife, Martin Hofmann: "Carbon Credits" for Resource-Bounded Computations Using Amortised Analysis. FM 2009: 354-369
- [c51]
- [c50]Nick Benton, Andrew Kennedy, Lennart Beringer, Martin Hofmann: Relational semantics for effect-based program transformations: higher-order store. PPDP 2009: 301-312
- [c49]
- 2008
- [j28]Lennart Beringer, Martin Hofmann: Secure information flow and program logics. Archive of Formal Proofs 2008 (2008)
- [j27]Lennart Beringer, Martin Hofmann: A Bytecode Logic for JML and Types. Archive of Formal Proofs 2008 (2008)
- [j26]David Aspinall, Martin Hofmann, Michal Konecný: A type system with usage aspects. J. Funct. Program. 18(2): 141-178 (2008)
- [c48]Masahito Hasegawa, Martin Hofmann, Gordon D. Plotkin: Finite Dimensional Vector Spaces Are Complete for Traced Symmetric Monoidal Categories. Pillars of Computer Science 2008: 367-385
- [c47]
- [c46]Ugo Dal Lago, Martin Hofmann: A Semantic Proof of Polytime Soundness of Light Affine Logic. CSR 2008: 134-145
- [c45]Amal Ahmed, Nick Benton, Martin Hofmann, Greg Morrisett: 08061 Executive Summary -- Types, Logics and Semantics for State. Types, Logics and Semantics for State 2008
- [c44]Amal Ahmed, Nick Benton, Martin Hofmann, Greg Morrisett: 08061 Abstracts Collection -- Types, Logics and Semantics for State. Types, Logics and Semantics for State 2008
- [c43]
- [e3]Amal Ahmed, Nick Benton, Martin Hofmann, Greg Morrisett (Eds.): Types, Logics and Semantics for State, 03.02. - 08.02.2008. Dagstuhl Seminar Proceedings 08061, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008
- [i2]Ulrich Schöpp, Martin Hofmann: Pointer Programs and Undirected Reachability. Electronic Colloquium on Computational Complexity (ECCC) 15(090) (2008)
- 2007
- [j25]David Aspinall, Lennart Beringer, Martin Hofmann, Hans-Wolfgang Loidl, Alberto Momigliano: A program logic for resources. Theor. Comput. Sci. 389(3): 411-445 (2007)
- [c42]
- [c41]Lennart Beringer, Martin Hofmann, Mariela Pavlova: Certification Using the Mobius Base Logic. FMCO 2007: 25-51
- [c40]Nick Benton, Andrew Kennedy, Lennart Beringer, Martin Hofmann: Relational semantics for effect-based program transformations with dynamic allocation. PPDP 2007: 87-96
- [c39]
- [e2]Martin Hofmann, Matthias Felleisen (Eds.): Proceedings of the 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2007, Nice, France, January 17-19, 2007. ACM 2007, ISBN 1-59593-575-4
- 2006
- [j24]Martin Hofmann, Jaap van Oosten, Thomas Streicher: Well-foundedness in Realizability. Arch. Math. Log. 45(7): 795-805 (2006)
- [j23]Anna Bucalo, Furio Honsell, Marino Miculan, Ivan Scagnetto, Martin Hofmann: Consistency of the theory of contexts. J. Funct. Program. 16(3): 327-372 (2006)
- [j22]
- [c38]Nick Benton, Andrew Kennedy, Martin Hofmann, Lennart Beringer: Reading, Writing and Relations. APLAS 2006: 114-130
- [c37]
- [c36]
- [c35]Christian Dax, Martin Hofmann, Martin Lange: A Proof System for the Linear Time µ-Calculus. FSTTCS 2006: 273-284
- [c34]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
- [c33]Kevin Hammond, Christian Ferdinand, Reinhold Heckmann, Roy Dyckhoff, Martin Hofmann, Steffen Jost, Hans-Wolfgang Loidl, Greg Michaelson, Robert F. Pointon, Norman Scaife, Jocelyn Sérot, Andy Wallace: Towards Formally Verifiable WCET Analysis for a Functional Programming Language. WCET 2006
- 2005
- [j21]Martin Hofmann, Pawel Urzyczyn: Typed Lambda Calculi and Applications 2003, Selected Papers. Fundam. Inform. 65(1-2) (2005)
- [c32]
- [c31]
- [c30]Kevin Hammond, Roy Dyckhoff, Christian Ferdinand, Reinhold Heckmann, Martin Hofmann, Steffen Jost, Hans-Wolfgang Loidl, Greg Michaelson, Robert F. Pointon, Norman Scaife, Jocelyn Sérot, Andy Wallace: The Embounded project (project start paper). Trends in Functional Programming 2005: 195-210
- [c29]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
- [i1]Ugo Dal Lago, Martin Hofmann: Quantitative Models and Implicit Complexity. CoRR abs/cs/0506079 (2005)
- 2004
- [j20]Martín Hötzel Escardó, Martin Hofmann, Thomas Streicher: On the non-sequential nature of the interval-domain model of real-number computation. Mathematical Structures in Computer Science 14(6): 803-814 (2004)
- [j19]Klaus Aehlig, Ulrich Berger, Martin Hofmann, Helmut Schwichtenberg: An arithmetic for non-size-increasing polynomial-time computation. Theor. Comput. Sci. 318(1-2): 3-27 (2004)
- [j18]Martin Hofmann, Philip J. Scott: Realizability models for BLL-like languages. Theor. Comput. Sci. 318(1-2): 121-137 (2004)
- [c28]David Aspinall, Stephen Gilmore, Martin Hofmann, Donald Sannella, Ian Stark: Mobile Resource Guarantees for Smart Devices. CASSIS 2004: 1-26
- [c27]
- [c26]Lennart Beringer, Martin Hofmann, Alberto Momigliano, Olha Shkaravska: Automatic Certification of Heap Consumption. LPAR 2004: 347-362
- [c25]David Aspinall, Lennart Beringer, Martin Hofmann, Hans-Wolfgang Loidl, Alberto Momigliano: A Program Logic for Resource Verification. TPHOLs 2004: 34-49
- 2003
- [j17]Martin Hofmann: Linear types and non-size-increasing polynomial time computation. Inf. Comput. 183(1): 57-85 (2003)
- [j16]
- [c24]
- [c23]Martin Hofmann, Steffen Jost: Static prediction of heap space usage for first-order functional programs. POPL 2003: 185-197
- [e1]Martin Hofmann (Ed.): Typed Lambda Calculi and Applications, 6th International Conference, TLCA 2003, Valencia, Spain, June 10-12, 2003, Proceedings. Lecture Notes in Computer Science 2701, Springer 2003, ISBN 3-540-40332-9
- 2002
- [j15]
- [j14]Martin Hofmann, Thomas Streicher: Completeness of Continuation Models for lambda-mu-Calculus. Inf. Comput. 179(2): 332-355 (2002)
- [j13]Stephen Bellantoni, Martin Hofmann: A New "Feasible" Arithmetic. J. Symb. Log. 67(1): 104-116 (2002)
- [c22]
- [c21]
- 2001
- [c20]Thorsten Altenkirch, Peter Dybjer, Martin Hofmann, Philip J. Scott: Normalization by Evaluation for Typed Lambda Calculus with Coproducts. LICS 2001: 303-310
- [c19]Martin Hofmann: The Strength of Non-size-increasing Computation (Introduction and Summary). MFCS 2001: 58-61
- [c18]Martin Hofmann: From Bounded Arithmetic to Memory Management: Use of Type Theory to Capture Complexity Classes and Space Behaviour. TLCA 2001: 2-3
- 2000
- [j12]Martin Hofmann: Safe recursion with higher types and BCK-algebra. Ann. Pure Appl. Logic 104(1-3): 113-166 (2000)
- [j11]Martin Hofmann: A Type System for Bounded Space and Functional In-Place Update. Nord. J. Comput. 7(4): 258-289 (2000)
- [j10]
- [c17]Martin Hofmann: A Type System for Bounded Space and Functional In-Place Update--Extended Abstract. ESOP 2000: 165-179
- [c16]Martin Hofmann, Francis Tang: Implementing a Program Logic of Objects in a Higher-Order Logic Theorem Prover. TPHOLs 2000: 268-282
1990 – 1999
- 1999
- [j9]
- [j8]Thierry Coquand, Martin Hofmann: A new method for establishing conservativity of classical systems over their intuitionistic version. Mathematical Structures in Computer Science 9(4): 323-333 (1999)
- [j7]Martin Hofmann, Giuseppe Rosolini, Dusko Pavlovic: Preface. Electr. Notes Theor. Comput. Sci. 29: 1 (1999)
- [c15]
- [c14]Martin Hofmann: Linear Types and Non-Size-Increasing Polynomial Time Computation. LICS 1999: 464-473
- 1998
- [j6]Martin Hofmann, Wolfgang Naraschewski, Martin Steffen, Terry Stroup: Inheritance of Proofs. TAPOS 4(1): 51-69 (1998)
- 1997
- [b1]Martin Hofmann: Extensional constructs in intensional type theory. CPHC/BCS distinguished dissertations, Springer 1997, ISBN 978-3-540-76121-1, pp. I-XII, 1-214
- [j5]Martin Hofmann: An application of category-theoretic semantics to the characterisation of complexity classes using higher-order function algebras. Bulletin of Symbolic Logic 3(4): 469-486 (1997)
- [c13]Martin Hofmann: A Mixed Modal/Linear Lambda Calculus with Applications to Bellantoni-Cook Safe Recursion. CSL 1997: 275-294
- [c12]Martin Hofmann, Thomas Streicher: Continuation Models are Universal for Lambda-Mu-Calculus. LICS 1997: 387-395
- 1996
- [j4]
- [j3]Martin Hofmann, Donald Sannella: On Behavioural Abstraction and Behavioural Satisfaction in Higher-Order Logic. Theor. Comput. Sci. 167(1&2): 3-45 (1996)
- [c11]Thorsten Altenkirch, Martin Hofmann, Thomas Streicher: Reduction-Free Normalisation for a Polymorphic System. ISTCS 1996: 146
- [c10]Thorsten Altenkirch, Martin Hofmann, Thomas Streicher: Reduction-Free Normalisation for a Polymorphic System. LICS 1996: 98-106
- 1995
- [j2]Martin Hofmann, Benjamin C. Pierce: A Unifying Type-Theoretic Framework for Objects. J. Funct. Program. 5(4): 593-635 (1995)
- [j1]Martin Hofmann: Sound and Complete Axiomatisations of Call-by-Value Control Operators. Mathematical Structures in Computer Science 5(4): 461-482 (1995)
- [c9]Thorsten Altenkirch, Martin Hofmann, Thomas Streicher: Categorical Reconstruction of a Reduction Free Normalization Proof. Category Theory and Computer Science 1995: 182-199
- [c8]
- [c7]Martin Hofmann, Donald Sannella: On Behavioral Abstraction and Behavioural Satisfaction in Higher-Order Logic. TAPSOFT 1995: 247-261
- [c6]
- [c5]Martin Hofmann: Conservativity of Equality Reflection over Intensional Type Theory. TYPES 1995: 153-164
- 1994
- [c4]Martin Hofmann: On the Interpretation of Type Theory in Locally Cartesian Closed Categories. CSL 1994: 427-441
- [c3]Martin Hofmann, Thomas Streicher: The Groupoid Model Refutes Uniqueness of Identity Proofs. LICS 1994: 208-212
- [c2]Martin Hofmann, Benjamin C. Pierce: A Unifying Type-Theoretic Framework for Objects. STACS 1994: 251-262
- 1993
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-17 21:27 CEST by the dblp team