2000 search results - page 82 / 400 » Program Transformation and Proof Transformation |
110
click to vote
XSYM
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Recently it was shown that existing general-purpose inductive logic programming systems are useful for learning wrappers (known as L-wrappers) to extract data from HTML d...
ICISC
2004
15 years 1 months ago
2004
Steganography embeds a secret message in an innocuous cover-object. This paper identifies three cover-specific redundancies of executable programs and presents steganographic techn...
CADE
2006
Springer
16 years 5 days ago
2006
Springer
Abstract. We introduce a semi-automated proof system for basic category-theoretic reasoning. It is based on a first-order sequent calculus that captures the basic properties of cat...
121
click to vote
LATIN
2004
Springer
15 years 5 months ago
2004
Springer
Equality logic with or without uninterpreted functions is used for proving the equivalence or refinement between systems (hardware verification, compiler’s translation, etc). C...
93
Voted
TCC
2010
Springer
15 years 8 months ago
2010
Springer
Goldreich-Krawczyk (Siam J of Comp’96) showed that only languages in BPP have constant-round public-coin black-box zero-knowledge protocols. We extend their lower bound to “ful...