Maximal incompleteness as obfuscation potency
From MaRDI portal
Publication:511013
DOI10.1007/s00165-016-0374-2zbMath1355.68053OpenAlexW2343078876MaRDI QIDQ511013
Isabella Mastroeni, Roberto Giacobazzi, Mila Dalla Preda
Publication date: 14 February 2017
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00165-016-0374-2
lattice theoryclosure operatorsprogram transformationabstract interpretationprogram semanticsstatic program analysiscode obfuscation
Related Items
Property-driven code obfuscations reinterpreting Jones-optimality in abstract interpretation ⋮ Formal framework for reasoning about the precision of dynamic analysis ⋮ Encoding watermark numbers as reducible permutation graphs using self-inverting permutations
Cites Work
- Algebraic properties of program integration
- Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements
- Weakening additivity in adjoining closures
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Analyzing Program Analyses
- Specifying Imperative Data Obfuscations
- Abstract interpretation and application to logic programs
- Refining and compressing abstract domains
- Systematic design of program transformation frameworks by abstract interpretation
- Abstract Interpretation Frameworks
- Making abstract interpretations complete
- On the (im)possibility of obfuscating programs
- Automata, Languages and Programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item