Formalization of Automated Trading Systems in a Concurrent Linear Framework

04/15/2019
by   Iliano Cervesato, et al.
0

We present a declarative and modular specification of an automated trading system (ATS) in the concurrent linear framework CLF. We implemented it in Celf, a CLF type checker which also supports executing CLF specifications. We outline the verification of two representative properties of trading systems using generative grammars, an approach to reasoning about CLF specifications.

READ FULL TEXT
research
08/17/2020

Deterministic concurrent systems

We introduce deterministic concurrent systems as a subclass of concurren...
research
09/12/2019

Tasks in Modular Proofs of Concurrent Algorithms

Proving correctness of distributed or concurrent algorithms is a mind-ch...
research
09/17/2023

Rely-guarantee Reasoning about Concurrent Reactive Systems: The PiCore Framework, Languages Integration and Applications

The rely-guarantee approach is a promising way for compositional verific...
research
02/21/2020

Adversarial Attacks on Machine Learning Systems for High-Frequency Trading

Algorithmic trading systems are often completely automated, and deep lea...
research
05/29/2023

Trace models of concurrent valuation algebras

This paper introduces Concurrent Valuation Algebras (CVAs), extending or...
research
08/21/2023

Proofs about Network Communication: For Humans and Machines

Many concurrent and distributed systems are safety-critical and therefor...
research
11/14/2022

Specification and Verification with the TLA+ Trifecta: TLC, Apalache, and TLAPS

Using an algorithm due to Safra for distributed termination detection as...

Please sign up or login with your details

Forgot password? Click here to reset