| 2021 | WoLLIC | Algorithmically Broad Languages for Polynomial Time and Space. | Daniel Leivant |
| 2020 | LFCS | Finitism, Imperative Programs and Primitive Recursion. | Daniel Leivant |
| 2017 | CSL | The Ackermann Award 2017. | Anuj Dawar, Daniel Leivant |
| 2015 | FOSSACS | The Computational Contents of Ramified Corecurrence. | Daniel Leivant, Ramyaa Ramyaa |
| 2013 | CSL | Global semantic typing for inductive and coinductive computing. | Daniel Leivant |
| 2013 | ICALP | Evolving Graph-Structures and Their Implicit Computational Complexity. | Daniel Leivant, Jean-Yves Marion |
| 2010 | WoLLIC | Feasible Functions over Co-inductive Data. | Ramyaa Ramyaa, Daniel Leivant |
| 2009 | FOSSACS | On the Completeness of Dynamic Logic. | Daniel Leivant |
| 2006 | LICS | Matching Explicit and Modal Reasoning about Programs: A Proof Theoretic Delineation of Dynamic Logic. | Daniel Leivant |
| 2004 | FOSSACS | Partial Correctness Assertions Provable in Dynamic Logics. | Daniel Leivant |
| 2004 | LICS | Proving Termination Assertions in Dynamic Logics. | Daniel Leivant |
| 2002 | CSL | Implicit Computational Complexity for Higher Type Functionals. | Daniel Leivant |
| 2002 | LICS | Calibrating Computational Feasibility by Abstraction Rank. | Daniel Leivant |
| 2001 | LPAR | The Functions Provable by First Order Abstraction. | Daniel Leivant |
| 1999 | CSL | Applicative Control and Computational Complexity. | Daniel Leivant |
| 1998 | FOCS | A Characterization of NC by Tree Recurrence. | Daniel Leivant |
| 1998 | SIGCSE | Panel: logic in the computer science curriculum. | Kim B. Bruce, Phokion G. Kolaitis, Daniel Leivant, Moshe Y. Vardi |
| 1994 | CSL | Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space. | Daniel Leivant, Jean-Yves Marion |
| 1994 | LFCS | Predicative Recurrence in Finite Types. | Daniel Leivant |
| 1993 | POPL | Stratified Functional Programs and Computational Complexity. | Daniel Leivant |
| 1991 | LICS | A Foundational Delineation of Computational Feasiblity | Daniel Leivant |
| 1989 | LICS | Stratified Polymorphism (Extended Summary) | Daniel Leivant |
| 1987 | POPL | Skinny and Fleshy Failures of Relative Completeness. | Daniel Leivant, Tim Fernando |
| 1985 | POPL | Logical and Mathematical Reasoning about Imperative Programs. | Daniel Leivant |
| 1983 | FOCS | Reasoning about Functional Programs and Complexity Classes Associated with Type Disciplines | Daniel Leivant |
| 1983 | POPL | Polymorphic Type Inference. | Daniel Leivant |
| 1983 | POPL | Structural Semantics for Polymorphic Data Types. | Daniel Leivant |
| 1981 | STOC | The Complexity of Parameter Passing in Polymorphic Procedures (or: Programming Language Theorems Independent of Very Strong Theories) | Daniel Leivant |