48 citations · 54 across the 5 of their papers we have counts for
5 papers
Idiosyncrasies and challenges of data driven learning in electronic trading
Vangelis Bacoyannis, Vacslav Glukhov, Tom Jin +2
We outline the idiosyncrasies of neural information processing and machine learning in quantitative finance. We also present some of the approaches we take towards solving the fund…
Unboundedness and Downward Closures of Higher-Order Pushdown Automata
Matthew Hague, Jonathan Kochems, C. -H. Luke Ong
We show the diagonal problem for higher-order pushdown automata (HOPDA), and hence the simultaneous unboundedness problem, is decidable. From recent work by Zetzsche this means tha…
Decidable Models of Recursive Asynchronous Concurrency
Jonathan Kochems, C. -H. Luke Ong
Asynchronously communicating pushdown systems (ACPS) that satisfy the empty-stack constraint (a pushdown process may receive only when its stack is empty) are a popular decidable m…
Safety verification of asynchronous pushdown systems with shaped stacks
Jonathan Kochems, C-H Luke Ong
In this paper, we study the program-point reachability problem of concurrent pushdown systems that communicate via unbounded and unordered message buffers. Our goal is to relax the…
Automatic Verification of Erlang-Style Concurrency
Emanuele D'Osualdo, Jonathan Kochems, C. -H. Luke Ong
This paper presents an approach to verify safety properties of Erlang-style, higher-order concurrent programs automatically. Inspired by Core Erlang, we introduce Lambda-Actor, a p…