2000 search results - page 156 / 400 » Program Transformation and Proof Transformation |
135
Voted
LCPC
1991
Springer
15 years 7 months ago
1991
Springer
This paper discusses the techniques used to hand-parallelize, for the Alliant FX/80, four Fortran programs from the Perfect-Benchmark suite. The paper also includes the execution ...
109
Voted
SLP
1997
15 years 5 months ago
1997
This paper describes how a number of program-analysis problems can be solved by transforming them to graph-reachability problems. Some of the program-analysis problems that are am...
119
Voted
FAC
2006
15 years 3 months ago
2006
Hoare and He's unifying theories of programming (UTP) is a model of alphabetised relations expressed as predicates; it supports development in several programming paradigms. T...
126
Voted
TCC
2004
Springer
15 years 9 months ago
2004
Springer
In a paper from EuroCrypt’99, Damg˚ard, Kilian and Salvail show various positive and negative results on constructing Bit Commitment (BC) and Oblivious Transfer (OT) from Unfair...
120
Voted
FSE
2008
Springer
15 years 5 months ago
2008
Springer
We propose SWIFFT, a collection of compression functions that are highly parallelizable and admit very efficient implementations on modern microprocessors. The main technique under...