Dynamic partial order reduction (DPOR) verifies concurrent programs by exploring all their interleavings up to some equivalence relation, such as the Mazurkiewicz trace equivalence. Doing so involves a complex trade-off between space and time. Existing DPOR algorithms are either exploration-optimal (i.e., explore exactly only interleaving per class) but may use exponential memory in size of pro...

Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 26 October 2020Accepted: 21 May 2021Published online: 07 September 2021KeywordsHawkes processes, market making, high frequency trading, stochastic control, partial differential equations, viscosity solutionsAMS Subject Headings68Q25, 68R10, 68U05Publication DataISSN (onli...