Skip to Main content Skip to Navigation
Conference papers

Twisting Additivity in Program Obfuscation

Mila Dalla Preda Wu Feng Roberto Giacobazzi 1 Richard Greechie Arun Lakhotia
1 UNIVR | DI - Department of Computer Science [Verona]
Abstract : Additivity plays a key role in program analysis. It is the basis for designing Galois connection based abstract interpretations, it makes a Data-Flow Analysis (DFA) problem easy being convertible into a Kildall's general form, and provides a lattice-theoretic model for disjunctive analysis. In this paper we consider reversible transformers respectively making any monotone function additive and maximally non-additive. We show that, under non restrictive hypothesis, these transformers exist and that they provide a theoretical foundation for the obfuscation of DFA.
Document type :
Conference papers
Complete list of metadata
https://hal.inria.fr/hal-00909387
Contributor : Davide Sangiogi <>
Submitted on : Tuesday, November 26, 2013 - 11:08:33 AM
Last modification on : Tuesday, May 25, 2021 - 11:46:02 AM

Identifiers

  • HAL Id : hal-00909387, version 1

Citation

Mila Dalla Preda, Wu Feng, Roberto Giacobazzi, Richard Greechie, Arun Lakhotia. Twisting Additivity in Program Obfuscation. Information Systems, Technology and Management - 6th International Conference, ICISTM, 2012, Unknown, pp.336-347. ⟨hal-00909387⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

72

 

Contact                    Legal Notice                    Personal Data