Sciweavers

1882 search results - page 226 / 377
» Transformational Programming and Forests
Sort
View
PACT
1997
Springer
15 years 10 months ago
Estimating the Parallel Start-Up Overhead for Parallelizing Compilers
A technique for estimating the cost of executing a loop nest in parallel (parallel start-up overhead) is described in this paper. This technique is of utmost importance for paralle...
Rizos Sakellariou
FSE
1993
Springer
101views Cryptology» more  FSE 1993»
15 years 10 months ago
SAFER K-64: A Byte-Oriented Block-Ciphering Algorithm
: A new non-proprietary secret-key block-enciphering algorithm, SAFER K-64 (for Secure And Fast Encryption Routine with a Key of length 64 bits) is described. The blocklength is 64...
James L. Massey
CRYPTO
1991
Springer
144views Cryptology» more  CRYPTO 1991»
15 years 10 months ago
Interactive Proofs with Space Bounded Provers
Recent results in interactive proof systems [?][?] [?] seem to indicate that it is easier for a prover in a single prover interactive proof system to cheat the verifier than it i...
Joe Kilian, Ronitt Rubinfeld
PTS
1993
91views Hardware» more  PTS 1993»
15 years 7 months ago
Generating Tests for Control Portion of SDL Specifications
The signal SAVE construct is one of the features distinguishing SDL from convent specification and programming languages. On the other hand, this feature increase testing SDL-spec...
Gang Luo, Anindya Das, Gregor von Bochmann
ENTCS
2008
118views more  ENTCS 2008»
15 years 6 months ago
Barbed Model-Driven Software Development: A Case Study
When thinking of MDE, the immediate understanding is that models drive software development, in the at the software is constructed by transforming models from higher levels of abs...
Carlo Montangero, Laura Semini