David M. Kahn

According to our database, David M. Kahn authored at least 11 papers between 2017 and 2026.

Collaborative distances:

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

2026

Big-Stop Semantics: Small-Step Semantics in a Big-Step Judgment.

David M. Kahn, Jan Hoffmann, Runming Li

Proc. ACM Program. Lang., 2026

2025

Efficient Cost Bounds with Linear Maps.

David M. Kahn, Jan Hoffmann, Thomas Reps, Jessie Grosen

CoRR, September, 2025

Big-Stop Semantics: A Simple Way to Get the Benefits of Small-Step Semantics in a Big-Step Judgment.

David M. Kahn, Jan Hoffmann, Runming Li

CoRR, August, 2025

2023

Automatic Amortized Resource Analysis with Regular Recursive Types.

Jessie Grosen, David M. Kahn, Jan Hoffmann

Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

2021

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

David M. Kahn, Jan Hoffmann

Proc. ACM Program. Lang., 2021

2020

Raising expectations: automating expected cost analysis with types.

Di Wang, David M. Kahn, Jan Hoffmann

Proc. ACM Program. Lang., 2020

Exponential Amortized Resource Analysis.

David M. Kahn, Jan Hoffmann

CoRR, 2020

Exponential Automatic Amortized Resource Analysis.

David M. Kahn, Jan Hoffmann

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

2019

Scalable verification of probabilistic networks.

Steffen Smolka, Praveen Kumar, David M. Kahn, Nate Foster, Justin Hsu, Dexter Kozen, Alexandra Silva

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

2017

Deciding Probabilistic Program Equivalence in NetKAT.

Steffen Smolka, David M. Kahn, Praveen Kumar, Nate Foster, Dexter Kozen, Alexandra Silva

CoRR, 2017

Undecidable Problems for Probabilistic Network Programming.

David M. Kahn

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017