Sciweavers

2000 search results - page 54 / 400
» Program Transformation and Proof Transformation
Sort
View
ACISICIS
2007
IEEE
15 years 4 months ago
Slicing Aided Design of Obfuscating Transforms
Abstract—An obfuscation aims to transform a program, without affecting its functionality, so that some secret information within the program can be hidden for as long as possible...
Stephen Drape, Anirban Majumdar, Clark D. Thombors...
LICS
1989
IEEE
15 years 1 months ago
Elf: A Language for Logic Definition and Verified Metaprogramming
We describe Elf, a metalanguage for proof manipulation environments that are independent of any particular logical system. Elf is intended for meta-programs such as theorem prover...
Frank Pfenning
ACISICIS
2005
IEEE
14 years 12 months ago
Equivalence of Transforming Non-Linear DACG to Linear Concept Tree
This paper introduces a strategy and its theory proof to transform non-linear concept graph: Directed Acyclic Concept Graph (DACG) into a linear concept tree. The transformation i...
Wenyi Bi, Junping Sun
WAOA
2004
Springer
107views Algorithms» more  WAOA 2004»
15 years 3 months ago
Order-Preserving Transformations and Greedy-Like Algorithms
Borodin, Nielsen and Rackoff [5] proposed a framework for ing the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] ext...
Spyros Angelopoulos
ISCI
2007
135views more  ISCI 2007»
14 years 10 months ago
Generalising the array split obfuscation
An obfuscation is a behaviour-preserving program transformation whose aim is to make a program “harder to understand”. Obfuscations are mainly applied to make reverse engineer...
Stephen Drape