2000 search results - page 83 / 400 » Program Transformation and Proof Transformation |
127
click to vote
CRYPTO
1994
Springer
15 years 7 months ago
1994
Springer
Suppose we are given a proof of knowledge P in which a prover demonstrates that he knows a solution to a given problem instance. Suppose also that we have a secret sharing scheme S...
144
Voted
PPDP
2007
Springer
15 years 9 months ago
2007
Springer
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
149
click to vote
AGTIVE
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Since the systematic evolution of graph-like program models has become important in software engineering, graph transformation has gained much attention in this area. For...
109
click to vote
ENTCS
2008
15 years 3 months ago
2008
Logic meta-programming in Prolog is a powerful way to express program analysis and transformation. However, its use can be difficult and error-prone because it requires programmer...
117
click to vote
ASPDAC
2008
ACM
15 years 4 months ago
2008
ACM
—In this paper we describe a practical methodology to formally verify highly optimized, industrial multipliers. We a multiplier description language which abstracts from low-leve...