Sciweavers

1882 search results - page 97 / 377
» Transformational Programming and Forests
Sort
View
DRM
2007
Springer
15 years 4 months ago
Slicing obfuscations: design, correctness, and evaluation
The goal of obfuscation is to transform a program, without affecting its functionality, such that some secret information within the program can be hidden for as long as possible...
Anirban Majumdar, Stephen Drape, Clark D. Thombors...
ICLP
2011
Springer
14 years 1 months ago
Minimizing the overheads of dependent {AND}-parallelism
Parallel implementations of programming languages need to control synchronization overheads. Synchronization is essential for ensuring the correctness of parallel code, yet it add...
Peter Wang, Zoltan Somogyi
MICRO
2012
IEEE
285views Hardware» more  MICRO 2012»
13 years 8 days ago
Automatic Extraction of Coarse-Grained Data-Flow Threads from Imperative Programs
This article presents a general algorithm for transforming sequential imperative programs into parallel data-flow programs. Our algorithm operates on a program dependence graph i...
Feng Li, Antoniu Pop, Albert Cohen
SAS
2009
Springer
175views Formal Methods» more  SAS 2009»
15 years 10 months ago
Automatic Parallelization and Optimization of Programs by Proof Rewriting
We show how, given a program and its separation logic proof, one can parallelize and optimize this program and transform its proof simultaneously to obtain a proven parallelized an...
Clément Hurlin
VL
2000
IEEE
118views Visual Languages» more  VL 2000»
15 years 2 months ago
Towards Generic Rule-Based Visual Programming
This paper outlines DIAPLAN, a visual rule-based programming language and environment that is based on the computational model of graph transformation. Thanks to its genericity, D...
Berthold Hoffmann, Mark Minas