Jonathan Kochems

13 papers A* 1B 2Journal 6Unranked 3
YearRankTypeTitle / Venue / Authors
2024 J jnl
No Tick-Size Too Small: A General Method for Modelling Small Tick Limit Order Books.
CoRR
Konark Jain, Jean-François Muzy, Jonathan Kochems, Emmanuel Bacry
2023 J jnl
Limit Order Book Dynamics and Order Size Modelling Using Compound Hawkes Process.
CoRR
Konark Jain, Nick Firoozye, Jonathan Kochems, Philip C. Treleaven
2022 — conf
Dynamic Calibration of Order Flow Models with Generative Adversarial Networks.
ICAIF
Felix Prenzel, Rama Cont, Mihai Cucuringu, Jonathan Kochems
2016 A* conf
Unboundedness and downward closures of higher-order pushdown automata.
POPL
Matthew Hague, Jonathan Kochems, C.-H. Luke Ong
2015 J jnl
Unboundedness and Downwards Closures of Higher-Order Pushdown Automata.
CoRR
Matthew Hague, Jonathan Kochems, C.-H. Luke Ong
2014 J jnl
Decidable Models of Recursive Asynchronous Concurrency.
CoRR
Jonathan Kochems, C.-H. Luke Ong
2014 J jnl
Safety verification of asynchronous pushdown systems with shaped stacks.
CoRR
Jonathan Kochems, C.-H. Luke Ong
2014 — —
Verification of asynchronous concurrency and the shaped stack constraint.
Jonathan Kochems
2013 J jnl
Automatic Verification of Erlang-Style Concurrency
CoRR
Emanuele D'Osualdo, Jonathan Kochems, C.-H. Luke Ong
2013 B conf
Automatic Verification of Erlang-Style Concurrency.
SAS
Emanuele D'Osualdo, Jonathan Kochems, C.-H. Luke Ong
2013 B conf
Safety Verification of Asynchronous Pushdown Systems with Shaped Stacks.
CONCUR
Jonathan Kochems, C.-H. Luke Ong
2012 — conf
Soter: an automatic safety verifier for erlang.
AGERE!@SPLASH
Emanuele D'Osualdo, Jonathan Kochems, Luke Ong
2011 — conf
Improved Functional Flow and Reachability Analyses Using Indexed Linear Tree Grammars.
RTA
Jonathan Kochems, C.-H. Luke Ong