Sciweavers

1882 search results - page 130 / 377
» Transformational Programming and Forests
Sort
View
IH
2007
Springer
15 years 11 months ago
A Graph Game Model for Software Tamper Protection
We present a probabilistic program-transformation algorithm to render a given program tamper-resistant. In addition, we suggest a model to estimate the required effort for an atta...
Nenad Dedic, Mariusz H. Jakubowski, Ramarathnam Ve...
SIGADA
2004
Springer
15 years 10 months ago
A refactoring tool for Ada 95
Refactoring is a technique for restructuring code to improve its design. A tool for automatically applying refactoring transformations to Ada 95 programs is described. The tool is...
Paul Anderson
POPL
2009
ACM
16 years 5 months ago
Positive supercompilation for a higher order call-by-value language
Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs. This hides looping bugs from the programmer, an...
Peter A. Jonsson, Johan Nordlander
CC
2005
Springer
108views System Software» more  CC 2005»
15 years 10 months ago
Task Partitioning for Multi-core Network Processors
Abstract. Network processors (NPs) typically contain multiple concurrent processing cores. State-of-the-art programming techniques for NPs are invariably low-level, requiring progr...
Robert Ennals, Richard Sharp, Alan Mycroft
121
Voted
OOPSLA
2004
Springer
15 years 10 months ago
Deriving refactorings for aspectJ
In this paper we present aspect-oriented programming laws that are useful for deriving refactorings for AspectJ. The laws help developers to verify if the transformations they deď...
Leonardo Cole, Paulo Borba