Sciweavers

10055 search results - page 125 / 2011
» Structured programming using processes
Sort
View
FPCA
1995
13 years 11 months ago
Shortcut Deforestation in Calculational Form
In functional programming, intermediate data structures are often used to “glue’) together small programs. Deforestation is a program transformation to remove these intermedia...
Akihiko Takano, Erik Meijer
DSN
2007
IEEE
14 years 2 months ago
Inherent Time Redundancy (ITR): Using Program Repetition for Low-Overhead Fault Tolerance
A new approach is proposed that exploits repetition inherent in programs to provide low-overhead transient fault protection in a processor. Programs repeatedly execute the same in...
Vimal K. Reddy, Eric Rotenberg
ENTCS
2008
150views more  ENTCS 2008»
13 years 8 months ago
Analyzing Security Scenarios Using Defence Trees and Answer Set Programming
Defence trees are used to represent attack and defence strategies in security scenarios; the aim in such scenarios is to select the best set of countermeasures that are able to st...
Stefano Bistarelli, Pamela Peretti, Irina Trubitsy...
MSCS
2008
86views more  MSCS 2008»
13 years 7 months ago
Maurer computers for pipelined instruction processing
We model micro-architectures with non-pipelined instruction processing and pipelined instruction processing, using Maurer machines, basic thread algebra and program algebra. We sho...
Jan A. Bergstra, C. A. Middelburg
PDPTA
2004
13 years 9 months ago
Efficiency Considerations of PERL and Python in Distributed Processing
: With the resurgence of interest in distributed processing and programming of distributed systems, researchers are exploring methods and techniques for facilitating programming of...
Roger Eggen, Maurice Eggen