2000 search results - page 97 / 400 » Program Transformation and Proof Transformation |
128
click to vote
ICSE
2001
IEEE-ACM
15 years 7 months ago
2001
IEEE-ACM
A good object-oriented design does not necessarily make a good component-based design, and vice versa. What design principles do components introduce? This paper examines componen...
127
click to vote
CC
2008
Springer
15 years 5 months ago
2008
Springer
Portable low-level C programs must often support multiple equivalent in-memory layouts of data, due to the byte or bit order of the compiler, architecture, or external data formats...
161
click to vote
FOCS
1999
IEEE
15 years 7 months ago
1999
IEEE
We introduce the notion of non-malleable noninteractive zero-knowledge (NIZK) proof systems. We show how to transform any ordinary NIZK proof system into one that has strong non-m...
108
click to vote
CC
2003
Springer
15 years 8 months ago
2003
Springer
Many processes can be seen as transformations of tree-like data structures. In compiler construction, for example, we continuously manipulate trees and perform tree transformations...
104
click to vote
LISP
2006
15 years 3 months ago
2006
Abstract. Defunctionalization is a program transformation that eliminates functions as first-class values. We show that defunctionalization can be viewed as a type-preserving trans...