Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Coherent Minimisation: Towards efficient tamper-proof compilation   Automata representing game-semantic models of programs are meant to operate
in environments whose input-output behaviour is constrained by the rules of a
game. This can lead to a notion of equivalence between states which is weaker
than the conventional notion of bisimulation, since not all actions are
available to the environment. An environment which attempts to break the rules
of the game is, effectively, mounting a low-level attack against a system. In
this paper we show how (and why) to enforce game rules in games-based hardware
synthesis and how to use this weaker notion of equivalence, called coherent
equivalence, to aggressively minimise automata.

32
The categories of this paper are: atom-ph
26
The categories of this paper are: bayes-an
17
The categories of this paper are: q-fin
29
The categories of this paper are: funct-an
35
The categories of this paper are: mtrl-th
0
The categories of this paper are: hep-ph
5
The categories of this paper are: gr-qc
21
The categories of this paper are: adap-org
24
The categories of this paper are: dg-ga
23
The categories of this paper are: solv-int
20
The categories of this paper are: acc-phys
8
The categories of this paper are: hep-ex
6
The categories of this paper are: astro-ph
9
The categories of this paper are: nlin
13
The categories of this paper are: quant-ph
34
The categories of this paper are: chem-ph