Improved Functional Flow and Reachability Analyses Using Indexed Linear Tree Grammars. - Jonathan Kochems; C.-H. Luke Ong (RTA, 2011)

Soter: an automatic safety verifier for erlang. - Emanuele D'Osualdo; Jonathan Kochems; Luke Ong (AGERE!@SPLASH, 2012)

Safety Verification of Asynchronous Pushdown Systems with Shaped Stacks. - Jonathan Kochems; C.-H. Luke Ong (CONCUR, 2013)

Automatic Verification of Erlang-Style Concurrency. - Emanuele D'Osualdo; Jonathan Kochems; C.-H. Luke Ong (SAS, 2013)

Decidable Models of Recursive Asynchronous Concurrency. - Jonathan Kochems; C.-H. Luke Ong (CoRR, 2014)

Verification of asynchronous concurrency and the shaped stack constraint. - Jonathan Kochems (2014)

Unboundedness and Downwards Closures of Higher-Order Pushdown Automata. - Matthew Hague; Jonathan Kochems; C.-H. Luke Ong (CoRR, 2015)

Unboundedness and downward closures of higher-order pushdown automata. - Matthew Hague; Jonathan Kochems; C.-H. Luke Ong (POPL, 2016)

Dynamic Calibration of Order Flow Models with Generative Adversarial Networks. - Felix Prenzel; Rama Cont; Mihai Cucuringu; Jonathan Kochems (ICAIF, 2022)

Limit Order Book Dynamics and Order Size Modelling Using Compound Hawkes Process. - Konark Jain; Nick Firoozye; Jonathan Kochems; Philip C. Treleaven (CoRR, 2023)

No Tick-Size Too Small: A General Method for Modelling Small Tick Limit Order Books. - Konark Jain; Jean-François Muzy; Jonathan Kochems; Emmanuel Bacry (CoRR, 2024)