Coherent minimisation: towards efficient tamper-proof compilation

MaRDI QIDQ5208778zbMATH OpenFDO

Authors Dan R. Ghica, Zaid al-Zobaidi

Publication date 10 January 2020

Full work available at URL https://arxiv.org/abs/1212.3878, http://eptcs.web.cse.unsw.edu.au/paper.cgi?ICE2012.8

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Applications of game theory (91A80)

Recommendations

• Geometry of synthesis. II: From games to delay-insensitive circuits
• Synchronous game semantics via round abstraction
• Abstract machines for game semantics, revisited
• Assume-Guarantee Synthesis
• Automata and games for synthesis

Cited in

(1)

• scientific article; zbMATH DE number 7774275 (Why is no real title available?)

This page was built for publication: Coherent minimisation: towards efficient tamper-proof compilation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5208778)