Sciweavers

82 search results - page 11 / 17
» On the Correctness of Transformations in Compiler Back-Ends
Sort
View
POPL
2012
ACM
12 years 3 months ago
A compiler and run-time system for network programming languages
Software-defined networks (SDNs) are a new implementation architecture in which a controller machine manages a distributed collection of switches, by instructing them to install ...
Christopher Monsanto, Nate Foster, Rob Harrison, D...
WORDS
2003
IEEE
14 years 23 days ago
Timing Analysis of Optimised Code
Timing analysis is a crucial test for dependable hard real-time systems (DHRTS). The calculation of the worst-case execution time (WCET) is mandatory. As modern compilers are capa...
Raimund Kirner, Peter P. Puschner
ICLP
2011
Springer
12 years 11 months ago
Minimizing the overheads of dependent {AND}-parallelism
Parallel implementations of programming languages need to control synchronization overheads. Synchronization is essential for ensuring the correctness of parallel code, yet it add...
Peter Wang, Zoltan Somogyi
HASKELL
2007
ACM
13 years 11 months ago
A type-preserving closure conversion in haskell
The use of typed intermediate languages can significantly increase the reliability of a compiler. By type-checking the code produced at each transformation stage, one can identify...
Louis-Julien Guillemette, Stefan Monnier
TCC
2004
Springer
105views Cryptology» more  TCC 2004»
14 years 25 days ago
Unfair Noisy Channels and Oblivious Transfer
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...
Ivan Damgård, Serge Fehr, Kirill Morozov, Lo...