Coherent minimisation: Towards efficient tamper-proof compilation

Dan R. Ghica, Zaid Al-Zobaidi

Research output: Contribution to journalConference articlepeer-review


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.

Original languageEnglish
Pages (from-to)83-98
Number of pages16
JournalElectronic Proceedings in Theoretical Computer Science
Publication statusPublished - 14 Dec 2012
Event5th Interaction and Concurrency Experience Workshop, ICE 2012 - Stockholm, Sweden
Duration: 16 Jun 2012 → …

ASJC Scopus subject areas

  • Software


Dive into the research topics of 'Coherent minimisation: Towards efficient tamper-proof compilation'. Together they form a unique fingerprint.

Cite this