A functional correspondence between evaluators and abstract machines. - Mads Sig Ager; Dariusz Biernacki; Olivier Danvy; Jan Midtgaard (PPDP, 2003)

A functional correspondence between call-by-need evaluators and lazy abstract machines. - Mads Sig Ager; Olivier Danvy; Jan Midtgaard (Inf. Process. Lett., 2004)

A functional correspondence between monadic evaluators and abstract machines for languages with computational effects. - Mads Sig Ager; Olivier Danvy; Jan Midtgaard (Theor. Comput. Sci., 2005)

A Calculational Approach to Control-Flow Analysis by Abstract Interpretation. - Jan Midtgaard; Thomas P. Jensen (SAS, 2008)

Flow-sensitive type recovery in linear-log time. - Michael D. Adams 001; Andrew W. Keep; Jan Midtgaard; Matthew Might; Arun Chauhan 001; R. Kent Dybvig (OOPSLA, 2011)

Abstracting abstract machines: technical perspective. - Olivier Danvy; Jan Midtgaard (Commun. ACM, 2011)

Calculating Graph Algorithms for Dominance and Shortest Path. - Ilya Sergey; Jan Midtgaard; Dave Clarke 001 (MPC, 2012)

A Structural Soundness Proof for Shivers's Escape Technique - A Case for Galois Connections. - Jan Midtgaard; Michael D. Adams 001; Matthew Might (SAS, 2012)

Control-flow analysis of functional programs. - Jan Midtgaard (ACM Comput. Surv., 2012)

Preface. - Jan Midtgaard; Matthew Might (NSAD@SAS, 2012)

Control-flow analysis of function calls and returns by abstract interpretation. - Jan Midtgaard; Thomas P. Jensen (Inf. Comput., 2012)

Monadic abstract interpreters. - Ilya Sergey; Dominique Devriese; Matthew Might; Jan Midtgaard; David Darais; Dave Clarke 001; Frank Piessens (PLDI, 2013)

Engineering definitional interpreters. - Jan Midtgaard; Norman Ramsey; Bradford Larsen (PPDP, 2013)

Systematic derivation of static analyses for software product lines. - Jan Midtgaard; Claus Brabrand; Andrzej Wasowski (MODULARITY, 2014)

Systematic derivation of correct variability-aware program analyses. - Jan Midtgaard; Aleksandar S. Dimovski; Claus Brabrand; Andrzej Wasowski (Sci. Comput. Program., 2015)

Iterated process analysis over lattice-valued regular expressions. - Jan Midtgaard; Flemming Nielson; Hanne Riis Nielson (PPDP, 2016)

A Parametric Abstract Domain for Lattice-Valued Regular Expressions. - Jan Midtgaard; Flemming Nielson; Hanne Riis Nielson (SAS, 2016)

QuickChecking Patricia Trees. - Jan Midtgaard (TFP, 2017)

Effect-driven QuickChecking of compilers. - Jan Midtgaard; Mathias Nygaard Justesen; Patrick Kasting; Flemming Nielson; Hanne Riis Nielson (Proc. ACM Program. Lang., 2017)

QuickChecking static analysis properties. - Jan Midtgaard; Anders Møller (Softw. Test. Verification Reliab., 2017)

Developments in property-based testing (invited talk). - Jan Midtgaard (PEPM, 2018)

Process-Local Static Analysis of Synchronous Processes. - Jan Midtgaard; Flemming Nielson; Hanne Riis Nielson (SAS, 2018)

Stack-Driven Program Generation of WebAssembly. - Árpád Perényi; Jan Midtgaard (APLAS, 2020)

Dynamic Verification of OCaml Software with Gospel and Ortac/QCheck-STM. - Nikolaus Huber; Naomi Spargo; Nicolas Osborne; Samuel Hym; Jan Midtgaard (TACAS (3), 2025)