Sciweavers

2000 search results - page 175 / 400
» Program Transformation and Proof Transformation
Sort
View
161
Voted
AFP
2008
Springer
236views Formal Methods» more  AFP 2008»
15 years 10 months ago
A Tutorial on Parallel and Concurrent Programming in Haskell
This practical tutorial introduces the features available in Haskell for writing parallel and concurrent programs. We first describe how to write semi-explicit parallel programs b...
Simon L. Peyton Jones, Satnam Singh
193
Voted
ECOOP
1999
Springer
15 years 8 months ago
Providing Fine-grained Access Control for Java Programs
There is considerable interest in programs that can migrate from one host to another and execute. Mobile programs are appealing because they support efficient utilization of networ...
Raju Pandey, Brant Hashii
226
Voted
POPL
2009
ACM
16 years 4 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
119
Voted
CC
2005
Springer
108views System Software» more  CC 2005»
15 years 9 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
OOPSLA
2004
Springer
15 years 9 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