We introduce a novel approach to secure compilation based on maps of distributive laws. We demonstrate through four examples that the coherence criterion for maps of distributive laws can potentially be a viable alternative for compiler security instead of full abstraction, which is the preservation and reflection of contextual equivalence. To that end, we also make use of the well-behavedness properties of distributive laws to construct a categorical argument for the contextual connotations of bisimilarity.
|Title of host publication
|Categorical Methods in Computer Science
|Daniela Petrisan, Jurriaan Rot
|Number of pages
|Published - 2020
|Coalgebraic Methods in Computer Science - Dublin, Ireland
Duration: 21 Sep 2020 → 19 Oct 2020
Conference number: 2020
|Lecture Notes in Computer Science
|Coalgebraic Methods in Computer Science
|21/09/20 → 19/10/20
Bibliographical noteFunding Information:
This work was partially supported by the Research Fund KU Leuven. Andreas Nuyts holds a PhD fellowship from the Research Foundation-Flanders (FWO).
© IFIP International Federation for Information Processing 2020.
Copyright 2020 Elsevier B.V., All rights reserved.