Sciweavers

1882 search results - page 68 / 377
» Transformational Programming and Forests
Sort
View
ISSTA
2006
ACM
15 years 3 months ago
The case for analysis preserving language transformation
Static analysis has gained much attention over the past few years in applications such as bug finding and program verification. As software becomes more complex and componentize...
Xiaolan Zhang, Larry Koved, Marco Pistoia, Sam Web...
IEEEIAS
2007
IEEE
15 years 4 months ago
Metrics-based Evaluation of Slicing Obfuscations
An obfuscation aims to transform a program, without affecting its functionality, so that some secret data within the program can be hidden for as long as possible from an adversar...
Anirban Majumdar, Stephen Drape, Clark D. Thombors...
ASIAN
2003
Springer
109views Algorithms» more  ASIAN 2003»
15 years 3 months ago
Deaccumulation - Improving Provability
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automated verification usually fails for functions with accumulating ar...
Jürgen Giesl, Armin Kühnemann, Janis Voi...
POPL
1996
ACM
15 years 1 months ago
Discovering Auxiliary Information for Incremental Computation
This paper presents program analyses and transformations that discover a general class of auxiliary information for any incremental computation problem. Combining these techniques...
Yanhong A. Liu, Scott D. Stoller, Tim Teitelbaum
CC
2003
Springer
141views System Software» more  CC 2003»
15 years 3 months ago
A New One-Pass Transformation into Monadic Normal Form
We present a translation from the call-by-value λ-calculus to monadic normal forms that includes short-cut boolean evaluation. The translation is higher-order, operates in one pas...
Olivier Danvy