1410 search results - page 198 / 282 » Proving theorems by reuse |
PODC
1998
ACM
14 years 2 months ago
1998
ACM
We study the relationship between the number of rounds needed to repeatedly perform a private computation i.e., where there are many sets of inputs sequentially given to the play...
ECAI
2006
Springer
14 years 1 months ago
2006
Springer
Semantic matching determines the mappings between the nodes of two graphs (e.g., ontologies) by computing logical relations (e.g., subsumption) holding among the nodes that corresp...
COCOA
2008
Springer
13 years 12 months ago
2008
Springer
We study (vertex-disjoint) packings of paths of length two (i.e., of P2's) in graphs under a parameterized perspective. Starting from a maximal P2-packing P of size j we use e...
WSC
2001
13 years 11 months ago
2001
This paper examines whether the ability to reuse a simulation, in whole or in part, results in tangible cost savings on the overall economics of the original simulation. Specific ...
POPL
2006
ACM
14 years 10 months ago
2006
ACM
This paper reports on the development and formal certification (proof of semantic preservation) of a compiler from Cminor (a Clike imperative language) to PowerPC assembly code, u...