Since it appears you have chosen to incompletely quote the problem statement from the abstract as your submission statement, and since by accident or design the full title was not included in your submission:
This paper describes FaCT, a DSL for timing-sensitive computation. It is described as allowing readable, high-level cryptographic code, with efficient,
constant-time behavior.
At a very rough skim, the language seems to have interesting conveniences around implementing mitigations to timing channel attacks, like marking particular values 'secret' for the compiler.
