Jan Hoffmann

According to our database, Jan Hoffmann authored at least 56 papers between 2008 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Probabilistic Resource-Aware Session Types.

Ankush Das, Di Wang, Jan Hoffmann

Proc. ACM Program. Lang., January, 2023

Worst-Case Input Generation for Concurrent Programs under Non-Monotone Resource Metrics.

Long Pham, Jan Hoffmann

CoRR, 2023

Automatic Amortized Resource Analysis with Regular Recursive Types.

Jessie Grosen, David M. Kahn, Jan Hoffmann

LICS, 2023

2022

Preface for the special issue in homage to Martin Hofmann Part 2.

Jan Hoffmann, Donald Sannella, Ulrich Schöpp

Math. Struct. Comput. Sci., June, 2022

Two decades of automatic amortized resource analysis.

Jan Hoffmann, Steffen Jost

Math. Struct. Comput. Sci., June, 2022

2021

A unifying type-theory for higher-order (amortized) cost analysis.

Vineet Rajani, Marco Gaboardi, Deepak Garg, Jan Hoffmann

Proc. ACM Program. Lang., 2021

Modeling and analyzing evaluation cost of CUDA kernels.

Stefan K. Muller, Jan Hoffmann

Proc. ACM Program. Lang., 2021

Automatic amortized resource analysis with the Quantum physicist's method.

David M. Kahn, Jan Hoffmann

Proc. ACM Program. Lang., 2021

Preface for the special issue in homage to Martin Hofmann Part 1.

Jan Hoffmann, Donald Sannella, Ulrich Schöpp

Math. Struct. Comput. Sci., 2021

Expected-Cost Analysis for Probabilistic Programs and Semantics-Level Adaption of Optional Stopping Theorems.

Di Wang, Jan Hoffmann, Thomas W. Reps

CoRR, 2021

Sound probabilistic inference via guide types.

Di Wang, Jan Hoffmann, Thomas W. Reps

Proceedings of the PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021

Central moment analysis for cost accumulators in probabilistic programs.

Di Wang, Jan Hoffmann, Thomas W. Reps

Proceedings of the PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021

Typable Fragments of Polynomial Automatic Amortized Resource Analysis.

Long Pham, Jan Hoffmann

Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021

Resource-Aware Session Types for Digital Contracts.

Ankush Das, Stephanie Balzer, Jan Hoffmann, Frank Pfenning, Ishani Santurkar

Proceedings of the 34th IEEE Computer Security Foundations Symposium, 2021

2020

Raising expectations: automating expected cost analysis with types.

Di Wang, David M. Kahn, Jan Hoffmann

Proc. ACM Program. Lang., 2020

Liquid resource types.

Tristan Knoth, Di Wang, Adam Reynolds, Jan Hoffmann, Nadia Polikarpova

Proc. ACM Program. Lang., 2020

Exponential Amortized Resource Analysis.

David M. Kahn, Jan Hoffmann

CoRR, 2020

Tail Bound Analysis for Probabilistic Programs via Central Moments.

Di Wang, Jan Hoffmann, Thomas W. Reps

CoRR, 2020

Exponential Automatic Amortized Resource Analysis.

David M. Kahn, Jan Hoffmann

Proceedings of the Foundations of Software Science and Computation Structures, 2020

2019

Type-guided worst-case input generation.

Di Wang, Jan Hoffmann

Proc. ACM Program. Lang., 2019

A Denotational Semantics for Low-Level Probabilistic Programs with Nondeterminism.

Di Wang, Jan Hoffmann, Thomas W. Reps

Proceedings of the Thirty-Fifth Conference on the Mathematical Foundations of Programming Semantics, 2019

Resource-Aware Session Types for Digital Contracts.

Ankush Das, Stephanie Balzer, Jan Hoffmann, Frank Pfenning

CoRR, 2019

Resource-guided program synthesis.

Tristan Knoth, Di Wang, Nadia Polikarpova, Jan Hoffmann

Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019

2018

Parallel complexity analysis with temporal session types.

Ankush Das, Jan Hoffmann, Frank Pfenning

Proc. ACM Program. Lang., 2018

PMAF: an algebraic framework for static analysis of probabilistic programs.

Di Wang, Jan Hoffmann, Thomas W. Reps

Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2018

Bounded expectations: resource analysis for probabilistic programs.

Van Chan Ngo, Quentin Carbonneaux, Jan Hoffmann

Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2018

Automatic Space Bound Analysis for Functional Programs with Garbage Collection.

Yue Niu, Jan Hoffmann

Proceedings of the LPAR-22. 22nd International Conference on Logic for Programming, 2018

Work Analysis with Resource-Aware Session Types.

Ankush Das, Jan Hoffmann, Frank Pfenning

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2017

Preface: Special Issue on Automatic Resource Bound Analysis.

Jürgen Giesl, Jan Hoffmann

J. Autom. Reason., 2017

Resource Bound Analysis (Dagstuhl Seminar 17291).

Marco Gaboardi, Jan Hoffmann, Reinhard Wilhelm, Florian Zuleger

Dagstuhl Reports, 2017

ML for ML: Learning Cost Semantics by Experiment.

Ankush Das, Jan Hoffmann

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

Verifying and Synthesizing Constant-Resource Implementations with Types.

Van Chan Ngo, Mario Dehesa-Azuara, Matthew Fredrikson, Jan Hoffmann

Proceedings of the 2017 IEEE Symposium on Security and Privacy, 2017

Arrays and References in Resource Aware ML.

Benjamin Lichtman, Jan Hoffmann

Proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction, 2017

Towards automatic resource bound analysis for OCaml.

Jan Hoffmann, Ankush Das, Shu-Chun Weng

Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

Relational cost analysis.

Ezgi Çiçek, Gilles Barthe, Marco Gaboardi, Deepak Garg, Jan Hoffmann

Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

Automated Resource Analysis with Coq Proof Objects.

Quentin Carbonneaux, Jan Hoffmann, Thomas W. Reps, Zhong Shao

Proceedings of the Computer Aided Verification - 29th International Conference, 2017

2015

Type-based amortized resource analysis with integers and arrays.

Jan Hoffmann, Zhong Shao

J. Funct. Program., 2015

Compositional certified resource bounds.

Quentin Carbonneaux, Jan Hoffmann, Zhong Shao

Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2015

Automatic Static Cost Analysis for Parallel Programs.

Jan Hoffmann, Zhong Shao

Proceedings of the Programming Languages and Systems, 2015

2014

End-to-end verification of stack-space bounds for C programs.

Quentin Carbonneaux, Jan Hoffmann, Tahina Ramananandro, Zhong Shao

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2014

2013

The Complexity of Computing Minimal Unidirectional Covering Sets.

Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jan Hoffmann, Jörg Rothe

Theory Comput. Syst., 2013

Tracking Data-Flow with Open Closure Types.

Gabriel Scherer, Jan Hoffmann

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2013

Quantitative Reasoning for Proving Lock-Freedom.

Jan Hoffmann, Michael Marmar, Zhong Shao

Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Characterizing Progress Properties of Concurrent Objects via Contextual Refinements.

Hongjin Liang, Jan Hoffmann, Xinyu Feng, Zhong Shao

Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

2012

Multivariate amortized resource analysis.

Jan Hoffmann, Klaus Aehlig, Martin Hofmann

ACM Trans. Program. Lang. Syst., 2012

Higher-order functional reactive programming in bounded space.

Neelakantan R. Krishnaswami, Nick Benton, Jan Hoffmann

Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2012

Resource Aware ML.

Jan Hoffmann, Klaus Aehlig, Martin Hofmann

Proceedings of the Computer Aided Verification - 24th International Conference, 2012

2011

Types with potential: polynomial resource bounds via automatic amortized analysis.

Jan Hoffmann

PhD thesis, 2011

The Computational Complexity of Weak Saddles.

Felix Brandt, Markus Brill, Felix A. Fischer, Jan Hoffmann

Theory Comput. Syst., 2011

2010

Amortized Resource Analysis with Polynomial Potential.

Jan Hoffmann, Martin Hofmann

Proceedings of the Programming Languages and Systems, 2010

An Automatic Amortized Analysis of the Resource Consumption of Functional Programs.

Jan Hoffmann

Proceedings of the Joint Workshop of the German Research Training Groups in Computer Science, 2010

Amortized Resource Analysis with Polymorphic Recursion and Partial Big-Step Operational Semantics.

Jan Hoffmann, Martin Hofmann

Proceedings of the Programming Languages and Systems - 8th Asian Symposium, 2010

2009

Finding a tree structure in a resolution proof is NP-complete.

Jan Hoffmann

Theor. Comput. Sci., 2009

Computing Shapley's saddles.

Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein, Jan Hoffmann

SIGecom Exch., 2009

2008

The NP-hardness of finding a directed acyclic graph for regular resolution.

Samuel R. Buss, Jan Hoffmann

Theor. Comput. Sci., 2008

Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning.

Samuel R. Buss, Jan Hoffmann, Jan Johannsen

Log. Methods Comput. Sci., 2008