2000 search results - page 35 / 400 » Program Transformation and Proof Transformation |
171
click to vote
LOPSTR
1994
Springer
15 years 10 months ago
1994
Springer
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...
140
Voted
SRDS
2003
IEEE
15 years 11 months ago
2003
IEEE
The perfectly synchronized round model provides the abstraction of crash-stop failures with atomic message delivery. This abstraction makes distributed programming very easy. We p...
160
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
In this paper, we show how genetic programming (GP) can be used to evolve system-size-independent quantum algorithms, and present a human-competitive Quantum Fourier Transform (QF...
164
click to vote
ESSOS
2009
Springer
15 years 10 months ago
2009
Springer
Injection attacks and their defense require a lot of creativity from attackers and secure system developers. Unfortunately, as attackers rely increasingly on systematic approaches ...