Sciweavers

2000 search results - page 237 / 400
» Program Transformation and Proof Transformation
Sort
View
IACR
2011
104views more  IACR 2011»
14 years 3 months ago
Collusion Resistant Obfuscation and Functional Re-encryption
Program Obfuscation is the problem of transforming a program into one which is functionally equivalent, yet whose inner workings are completely unintelligible to an adversary. Des...
Nishanth Chandran, Melissa Chase, Vinod Vaikuntana...
OOPSLA
2009
Springer
15 years 10 months ago
Reimagining literate programming
In this paper we describe Ginger, a new language with first class support for literate programming. Literate programming refers to a philosophy that argues computer programs shou...
James Dean Palmer, Eddie Hillenbrand
ICDCS
2003
IEEE
15 years 9 months ago
Enhancing The Fault-Tolerance of Nonmasking Programs
In this paper, we focus on automated techniques to enhance the fault-tolerance of a nonmasking fault-tolerant program to masking. A masking program continually satisfies its spec...
Sandeep S. Kulkarni, Ali Ebnenasir
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
16 years 4 months ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur
GPCE
2007
Springer
15 years 10 months ago
Aspects of availability
In this paper, we propose a domain-specific aspect language to prevent the denials of service caused by resource management. Our aspects specify availability policies by enforcin...
Pascal Fradet, Stéphane Hong Tuan Ha